{"id":"https://openalex.org/W2115718900","doi":"https://doi.org/10.1007/s10107-014-0855-0","title":"Lower bounds on the sizes of integer programs without additional variables","display_name":"Lower bounds on the sizes of integer programs without additional variables","publication_year":2014,"publication_date":"2014-12-16","ids":{"openalex":"https://openalex.org/W2115718900","doi":"https://doi.org/10.1007/s10107-014-0855-0","mag":"2115718900"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-014-0855-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-014-0855-0","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/A5062961656","display_name":"Volker Kaibel","orcid":"https://orcid.org/0000-0002-0388-7597"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Volker Kaibel","raw_affiliation_strings":["Otto-von-Guericke-Universit\u00e4t\u00a0Magdeburg, Magdeburg, Germany","Otto-Von-Guericke-Universit\u00e4t Magdeburg, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Otto-von-Guericke-Universit\u00e4t\u00a0Magdeburg, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]},{"raw_affiliation_string":"Otto-Von-Guericke-Universit\u00e4t Magdeburg, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023809656","display_name":"Stefan Weltge","orcid":"https://orcid.org/0000-0002-0102-8326"},"institutions":[{"id":"https://openalex.org/I95793202","display_name":"Otto-von-Guericke University Magdeburg","ror":"https://ror.org/00ggpsq73","country_code":"DE","type":"education","lineage":["https://openalex.org/I95793202"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Weltge","raw_affiliation_strings":["Otto-von-Guericke-Universit\u00e4t\u00a0Magdeburg, Magdeburg, Germany","Otto-Von-Guericke-Universit\u00e4t Magdeburg, Magdeburg, Germany"],"affiliations":[{"raw_affiliation_string":"Otto-von-Guericke-Universit\u00e4t\u00a0Magdeburg, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]},{"raw_affiliation_string":"Otto-Von-Guericke-Universit\u00e4t Magdeburg, Magdeburg, Germany","institution_ids":["https://openalex.org/I95793202"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062961656"],"corresponding_institution_ids":["https://openalex.org/I95793202"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":3.1137,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.91813905,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"154","issue":"1-2","first_page":"407","last_page":"425"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9965000152587891,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9810000061988831,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.8226476311683655},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8083959817886353},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7991906404495239},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7206190824508667},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.7033690214157104},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7008739709854126},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6875527501106262},{"id":"https://openalex.org/keywords/integer-points-in-convex-polyhedra","display_name":"Integer points in convex polyhedra","score":0.6580701470375061},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5509948134422302},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5305182337760925},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48607590794563293},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4789305627346039},{"id":"https://openalex.org/keywords/polyhedral-combinatorics","display_name":"Polyhedral combinatorics","score":0.47816282510757446},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4650946855545044},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44173556566238403},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.42791682481765747},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.41313815116882324},{"id":"https://openalex.org/keywords/branch-and-price","display_name":"Branch and price","score":0.25736552476882935},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24470531940460205},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.10908323526382446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08655035495758057},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07757845520973206},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.06519946455955505}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8226476311683655},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8083959817886353},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7991906404495239},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7206190824508667},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.7033690214157104},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7008739709854126},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6875527501106262},{"id":"https://openalex.org/C147700949","wikidata":"https://www.wikidata.org/wiki/Q6042594","display_name":"Integer points in convex polyhedra","level":4,"score":0.6580701470375061},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5509948134422302},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5305182337760925},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48607590794563293},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4789305627346039},{"id":"https://openalex.org/C174248988","wikidata":"https://www.wikidata.org/wiki/Q8348314","display_name":"Polyhedral combinatorics","level":5,"score":0.47816282510757446},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4650946855545044},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44173556566238403},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.42791682481765747},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.41313815116882324},{"id":"https://openalex.org/C123558587","wikidata":"https://www.wikidata.org/wiki/Q4956382","display_name":"Branch and price","level":3,"score":0.25736552476882935},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24470531940460205},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.10908323526382446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08655035495758057},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07757845520973206},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.06519946455955505},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-014-0855-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-014-0855-0","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W987035227","https://openalex.org/W1504684182","https://openalex.org/W1527197079","https://openalex.org/W1536948141","https://openalex.org/W1963547452","https://openalex.org/W1967232806","https://openalex.org/W1994799860","https://openalex.org/W2033871299","https://openalex.org/W2049287714","https://openalex.org/W2061987651","https://openalex.org/W2068066892","https://openalex.org/W2074577851","https://openalex.org/W2083210138","https://openalex.org/W2119368733","https://openalex.org/W2161226285","https://openalex.org/W2343290769","https://openalex.org/W2568023417","https://openalex.org/W2951693280","https://openalex.org/W2988480584","https://openalex.org/W4256534641","https://openalex.org/W4298227433","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W134055995","https://openalex.org/W2979455991","https://openalex.org/W4299306546","https://openalex.org/W2949788276","https://openalex.org/W1222945658","https://openalex.org/W2115718900","https://openalex.org/W1505865794","https://openalex.org/W1664252374","https://openalex.org/W2773049524","https://openalex.org/W4301657475"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}