{"id":"https://openalex.org/W4412548904","doi":"https://doi.org/10.1016/j.cor.2025.107204","title":"Augmentation search for integer programming over a polyhedron","display_name":"Augmentation search for integer programming over a polyhedron","publication_year":2025,"publication_date":"2025-07-22","ids":{"openalex":"https://openalex.org/W4412548904","doi":"https://doi.org/10.1016/j.cor.2025.107204"},"language":"en","primary_location":{"id":"doi:10.1016/j.cor.2025.107204","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2025.107204","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.cor.2025.107204","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5021959924","display_name":"Tolga Bekta\u015f","orcid":"https://orcid.org/0000-0003-0634-144X"},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Tolga Bekta\u015f","raw_affiliation_strings":["University of Liverpool Management School, Liverpool, Chatham Street, L69 7ZH, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0003-0634-144X","affiliations":[{"raw_affiliation_string":"University of Liverpool Management School, Liverpool, Chatham Street, L69 7ZH, United Kingdom","institution_ids":["https://openalex.org/I146655781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021959924"],"corresponding_institution_ids":["https://openalex.org/I146655781"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":{"value":3210,"currency":"USD","value_usd":3210},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22229128,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"183","issue":null,"first_page":"107204","last_page":"107204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9988999962806702,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9973999857902527,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9961000084877014,"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.7936468124389648},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.7786167860031128},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5750213265419006},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.48417121171951294},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4758983552455902},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3625463843345642},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34249961376190186},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.26274484395980835},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12599268555641174}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7936468124389648},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7786167860031128},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5750213265419006},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.48417121171951294},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4758983552455902},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3625463843345642},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34249961376190186},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26274484395980835},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12599268555641174}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.cor.2025.107204","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2025.107204","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.cor.2025.107204","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.cor.2025.107204","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320333374","display_name":"HEC Montr\u00e9al","ror":"https://ror.org/05ww3wq27"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W23064316","https://openalex.org/W603729728","https://openalex.org/W1513894211","https://openalex.org/W1770886307","https://openalex.org/W1974166590","https://openalex.org/W2001741445","https://openalex.org/W2003617534","https://openalex.org/W2004060844","https://openalex.org/W2011943258","https://openalex.org/W2029403470","https://openalex.org/W2038546526","https://openalex.org/W2074042195","https://openalex.org/W2083860925","https://openalex.org/W2087799931","https://openalex.org/W2095579752","https://openalex.org/W2127022339","https://openalex.org/W2137614705","https://openalex.org/W2140541505","https://openalex.org/W2155014525","https://openalex.org/W2170006979","https://openalex.org/W2170213261","https://openalex.org/W2329417820","https://openalex.org/W2798965501","https://openalex.org/W2803699435","https://openalex.org/W2964108155","https://openalex.org/W2976023331","https://openalex.org/W3106587995","https://openalex.org/W3160604577","https://openalex.org/W4391051905","https://openalex.org/W4404853279","https://openalex.org/W6639250105","https://openalex.org/W6682975537","https://openalex.org/W6702137884"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2916043681","https://openalex.org/W2896131632","https://openalex.org/W2391438543","https://openalex.org/W2228244008","https://openalex.org/W2301583490","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,14,46],"primal":[4],"search":[5,17,32],"algorithm":[6],"to":[7],"optimise":[8],"an":[9],"integer":[10],"programme":[11],"defined":[12],"over":[13],"polyhedron.":[15],"The":[16],"is":[18],"conducted":[19],"on":[20,54],"the":[21,25,29,37],"lattice":[22],"described":[23],"by":[24],"linear":[26],"constraints":[27],"of":[28,39],"model,":[30],"where":[31],"directions":[33],"are":[34],"derived":[35],"in":[36],"spirit":[38],"Graver":[40],"bases":[41],"and":[42],"extracted":[43],"dynamically":[44],"using":[45],"feasibility-seeking":[47],"black-box.":[48],"Computational":[49],"results":[50],"show":[51],"potential":[52],"particularly":[53],"0-1":[55],"programming":[56],"formulations":[57],"with":[58,64],"complex":[59],"objective":[60],"functions":[61],"when":[62],"compared":[63],"state-of-the-art":[65],"solvers.":[66]},"counts_by_year":[],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}