{"id":"https://openalex.org/W4403197454","doi":"https://doi.org/10.1007/s12532-024-00269-5","title":"A fix-propagate-repair heuristic for mixed integer programming","display_name":"A fix-propagate-repair heuristic for mixed integer programming","publication_year":2024,"publication_date":"2024-10-07","ids":{"openalex":"https://openalex.org/W4403197454","doi":"https://doi.org/10.1007/s12532-024-00269-5"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-024-00269-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-024-00269-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-024-00269-5.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s12532-024-00269-5.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043142156","display_name":"Domenico Salvagnin","orcid":"https://orcid.org/0000-0002-0232-2244"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Domenico Salvagnin","raw_affiliation_strings":["Department of Information Engineering (DEI), University of Padova, Padua, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering (DEI), University of Padova, Padua, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024400368","display_name":"Roberto Roberti","orcid":"https://orcid.org/0000-0002-2987-1593"},"institutions":[{"id":"https://openalex.org/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto Roberti","raw_affiliation_strings":["Department of Information Engineering (DEI), University of Padova, Padua, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering (DEI), University of Padova, Padua, Italy","institution_ids":["https://openalex.org/I138689650"]}]},{"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/I138689650","display_name":"University of Padua","ror":"https://ror.org/00240q980","country_code":"IT","type":"education","lineage":["https://openalex.org/I138689650"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Matteo Fischetti","raw_affiliation_strings":["Department of Information Engineering (DEI), University of Padova, Padua, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering (DEI), University of Padova, Padua, Italy","institution_ids":["https://openalex.org/I138689650"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043142156"],"corresponding_institution_ids":["https://openalex.org/I138689650"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2390,"currency":"EUR","value_usd":3090},"fwci":0.9101,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.78081196,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"17","issue":"1","first_page":"111","last_page":"139"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","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/T10567","display_name":"Vehicle Routing Optimization Methods","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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9969000220298767,"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.9940000176429749,"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/integer-programming","display_name":"Integer programming","score":0.7824581861495972},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6144561171531677},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5891574025154114},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.5556782484054565},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4855015277862549},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36918890476226807},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.320600688457489},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2950299382209778},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16717153787612915},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13981369137763977}],"concepts":[{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7824581861495972},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6144561171531677},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5891574025154114},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5556782484054565},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4855015277862549},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36918890476226807},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.320600688457489},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2950299382209778},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16717153787612915},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13981369137763977}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s12532-024-00269-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-024-00269-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-024-00269-5.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},{"id":"pmh:oai:www.research.unipd.it:11577/3541116","is_oa":true,"landing_page_url":"https://hdl.handle.net/11577/3541116","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s12532-024-00269-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-024-00269-5","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-024-00269-5.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5719717806","display_name":null,"funder_award_id":"20229ZWC97","funder_id":"https://openalex.org/F4320331528","funder_display_name":"Ministero dell'Universit\u00e0 e della Ricerca"},{"id":"https://openalex.org/G7084909240","display_name":null,"funder_award_id":"PRIN 2022","funder_id":"https://openalex.org/F4320331528","funder_display_name":"Ministero dell'Universit\u00e0 e della Ricerca"},{"id":"https://openalex.org/G8348146674","display_name":null,"funder_award_id":"PRIN 2022","funder_id":"https://openalex.org/F4320321966","funder_display_name":"Universit\u00e0 degli Studi di Padova"}],"funders":[{"id":"https://openalex.org/F4320321966","display_name":"Universit\u00e0 degli Studi di Padova","ror":"https://ror.org/00240q980"},{"id":"https://openalex.org/F4320331528","display_name":"Ministero dell'Universit\u00e0 e della Ricerca","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4403197454.pdf","grobid_xml":"https://content.openalex.org/works/W4403197454.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W83093243","https://openalex.org/W1534573459","https://openalex.org/W1549710443","https://openalex.org/W1553045544","https://openalex.org/W1586233612","https://openalex.org/W1965523840","https://openalex.org/W1991332269","https://openalex.org/W2004489140","https://openalex.org/W2008454042","https://openalex.org/W2041252457","https://openalex.org/W2056121010","https://openalex.org/W2068133968","https://openalex.org/W2068537726","https://openalex.org/W2081431552","https://openalex.org/W2106106289","https://openalex.org/W2112502194","https://openalex.org/W2126442135","https://openalex.org/W2127022339","https://openalex.org/W2130289059","https://openalex.org/W2136931788","https://openalex.org/W2137277194","https://openalex.org/W2156708389","https://openalex.org/W2746454974","https://openalex.org/W2794901481","https://openalex.org/W2913657094","https://openalex.org/W3016297128","https://openalex.org/W3085454911","https://openalex.org/W4232585008","https://openalex.org/W4324354234","https://openalex.org/W6609936487"],"related_works":["https://openalex.org/W2064563243","https://openalex.org/W2052299349","https://openalex.org/W4250775169","https://openalex.org/W4297728441","https://openalex.org/W1901944325","https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W2011675579"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"describe":[2],"a":[3,122,136,139,167,170,191,200],"diving":[4,64],"heuristic":[5],"framework":[6,176],"based":[7,41],"on":[8,42,135,199],"constraint":[9],"propagation":[10],"for":[11,46,51,90,111],"mixed":[12],"integer":[13],"linear":[14,79],"programs.":[15],"The":[16,36,66,175],"proposed":[17],"approach":[18,141],"is":[19,39,69,74,82],"an":[20],"extension":[21],"of":[22,30,97,121,156,169,173],"the":[23,28,43,77,86,91,112,119,160,182],"common":[24],"fix-and-propagate":[25],"scheme,":[26],"with":[27],"addition":[29],"solution":[31],"repairing":[32],"after":[33],"each":[34],"step.":[35],"repair":[37],"logic":[38],"loosely":[40],"WalkSAT":[44],"strategy":[45],"boolean":[47],"satisfiability.":[48],"Different":[49],"strategies":[50,93,126],"variable":[52],"ranking":[53,92],"and":[54,187],"value":[55],"selection,":[56],"as":[57,59,72],"well":[58],"other":[60],"options,":[61],"yield":[62],"different":[63],"heuristics.":[65],"overall":[67],"method":[68],"relatively":[70],"inexpensive,":[71],"it":[73,147],"basically":[75],"LP-free:":[76],"full":[78],"programming":[80],"relaxation":[81],"solved":[83],"only":[84,89,106],"at":[85,118],"beginning":[87],"(and":[88],"that":[94],"make":[95],"use":[96],"it),":[98],"while":[99],"additional,":[100],"typically":[101],"much":[102],"smaller,":[103],"LPs":[104],"are":[105,127],"used":[107],"to":[108,189,197],"compute":[109],"values":[110],"continuous":[113],"variables":[114],"(if":[115],"any),":[116],"once":[117],"bottom":[120],"dive.":[123],"While":[124],"individual":[125],"not":[128],"very":[129],"robust":[130],"in":[131,153,166,195],"finding":[132],"feasible":[133,151],"solutions":[134,152],"heterogeneous":[137,203],"testbed,":[138,165],"portfolio":[140],"proved":[142],"quite":[143],"effective.":[144],"In":[145],"particular,":[146],"could":[148],"consistently":[149],"find":[150],"189":[154],"out":[155],"240":[157],"instances":[158],"from":[159],"public":[161],"MIPLIB":[162],"2017":[163],"benchmark":[164],"matter":[168],"few":[171],"seconds":[172],"runtime.":[174],"has":[177],"also":[178],"been":[179],"implemented":[180],"inside":[181],"commercial":[183],"MIP":[184],"solver":[185],"Xpress":[186],"shown":[188],"give":[190],"small":[192],"performance":[193],"improvement":[194],"time":[196],"optimality":[198],"large":[201],"internal":[202],"testbed.":[204]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}