{"id":"https://openalex.org/W2412657279","doi":"https://doi.org/10.1007/bf02592196","title":"{0, 1/2}-Chv\u00e1tal-Gomory cuts","display_name":"{0, 1/2}-Chv\u00e1tal-Gomory cuts","publication_year":1996,"publication_date":"1996-09-01","ids":{"openalex":"https://openalex.org/W2412657279","doi":"https://doi.org/10.1007/bf02592196","mag":"2412657279"},"language":"hu","primary_location":{"id":"doi:10.1007/bf02592196","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02592196","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011745294","display_name":"Alberto Caprara","orcid":null},"institutions":[{"id":"https://openalex.org/I9360294","display_name":"University of Bologna","ror":"https://ror.org/01111rn36","country_code":"IT","type":"education","lineage":["https://openalex.org/I9360294"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Alberto Caprara","raw_affiliation_strings":["DEIS, University of Bologna, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DEIS, University of Bologna, Italy","institution_ids":["https://openalex.org/I9360294"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019439480","display_name":"Matteo Fischetti","orcid":"https://orcid.org/0000-0001-6601-0568"},"institutions":[{"id":"https://openalex.org/I129043915","display_name":"University of Udine","ror":"https://ror.org/05ht0mh31","country_code":"IT","type":"education","lineage":["https://openalex.org/I129043915"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Matteo Fischetti","raw_affiliation_strings":["DMI, University of Udine, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DMI, University of Udine, Italy","institution_ids":["https://openalex.org/I129043915"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.1335,"has_fulltext":false,"cited_by_count":136,"citation_normalized_percentile":{"value":0.94439946,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"74","issue":"3","first_page":"221","last_page":"235"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8652745485305786},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8458800315856934},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6759359240531921},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.618611216545105},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6076561212539673},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5268501043319702},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.49543583393096924},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.48001828789711},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.46618008613586426},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.457265704870224},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.456916868686676},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44466227293014526},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.41900867223739624},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.38844719529151917},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18009135127067566}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8652745485305786},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8458800315856934},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6759359240531921},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.618611216545105},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6076561212539673},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5268501043319702},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.49543583393096924},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.48001828789711},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.46618008613586426},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.457265704870224},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.456916868686676},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44466227293014526},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.41900867223739624},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.38844719529151917},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18009135127067566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/bf02592196","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf02592196","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.103.2838","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.2838","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.dei.unipd.it/~fisch/papers/theory_on_012_cuts.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.4145","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.4145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.or.deis.unibo.it/alberto/012cutre.ps","raw_type":"text"},{"id":"pmh:oai:www.research.unipd.it:11577/2499232","is_oa":false,"landing_page_url":"http://hdl.handle.net/11577/2499232","pdf_url":null,"source":{"id":"https://openalex.org/S4377196283","display_name":"Research Padua  Archive (University of Padua)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I138689650","host_organization_name":"University of Padua","host_organization_lineage":["https://openalex.org/I138689650"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1316039","https://openalex.org/W1803694112","https://openalex.org/W1843974934","https://openalex.org/W1963547452","https://openalex.org/W1968143987","https://openalex.org/W1993052292","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2020898729","https://openalex.org/W2023672749","https://openalex.org/W2036075346","https://openalex.org/W2040101882","https://openalex.org/W2042649619","https://openalex.org/W2047893320","https://openalex.org/W2048346525","https://openalex.org/W2082001376","https://openalex.org/W2099103397","https://openalex.org/W2123805664","https://openalex.org/W2131987076","https://openalex.org/W2164209543","https://openalex.org/W2327315803","https://openalex.org/W2505968561","https://openalex.org/W3034528871","https://openalex.org/W4285719527","https://openalex.org/W4301808069","https://openalex.org/W6701294544"],"related_works":["https://openalex.org/W1531708257","https://openalex.org/W2109445739","https://openalex.org/W2021079478","https://openalex.org/W2110818895","https://openalex.org/W134055995","https://openalex.org/W566167518","https://openalex.org/W4210880521","https://openalex.org/W2105006450","https://openalex.org/W3126345618","https://openalex.org/W2979455991"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":6}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}