{"id":"https://openalex.org/W3128961640","doi":"https://doi.org/10.5220/0010347000880098","title":"A LP Relaxation based Matheuristic for Multi-objective Integer Programming","display_name":"A LP Relaxation based Matheuristic for Multi-objective Integer Programming","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3128961640","doi":"https://doi.org/10.5220/0010347000880098","mag":"3128961640"},"language":"en","primary_location":{"id":"doi:10.5220/0010347000880098","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0010347000880098","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0010347000880098","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018499374","display_name":"Duleabom An","orcid":null},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Duleabom An","raw_affiliation_strings":["Institute of Production and Logistics Management, Johannes Kepler University Linz, Altenberger Strae 69, 4040 Linz, Austria, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Production and Logistics Management, Johannes Kepler University Linz, Altenberger Strae 69, 4040 Linz, Austria, --- Select a Country ---","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037046189","display_name":"Sophie N. Parragh","orcid":"https://orcid.org/0000-0002-7428-9770"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Sophie Parragh","raw_affiliation_strings":["Institute of Production and Logistics Management, Johannes Kepler University Linz, Altenberger Strae 69, 4040 Linz, Austria, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Production and Logistics Management, Johannes Kepler University Linz, Altenberger Strae 69, 4040 Linz, Austria, --- Select a Country ---","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030387525","display_name":"Markus Sinnl","orcid":"https://orcid.org/0000-0003-1439-8702"},"institutions":[{"id":"https://openalex.org/I121883995","display_name":"Johannes Kepler University of Linz","ror":"https://ror.org/052r2xn60","country_code":"AT","type":"education","lineage":["https://openalex.org/I121883995"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Markus Sinnl","raw_affiliation_strings":["Institute of Production and Logistics Management, Johannes Kepler University Linz, Altenberger Strae 69, 4040 Linz, Austria, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Production and Logistics Management, Johannes Kepler University Linz, Altenberger Strae 69, 4040 Linz, Austria, --- Select a Country ---","institution_ids":["https://openalex.org/I121883995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026344649","display_name":"Fabien Tricoire","orcid":"https://orcid.org/0000-0002-3700-5134"},"institutions":[{"id":"https://openalex.org/I102248843","display_name":"Vienna University of Economics and Business","ror":"https://ror.org/03yn8s215","country_code":"AT","type":"education","lineage":["https://openalex.org/I102248843"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Fabien Tricoire","raw_affiliation_strings":["Institute for Transport and Logistics Management, Vienna University of Economics and Business, Welthandelsplatz 1, 1020 Vienna, Austria, --- Select a Country ---"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Transport and Logistics Management, Vienna University of Economics and Business, Welthandelsplatz 1, 1020 Vienna, Austria, --- Select a Country ---","institution_ids":["https://openalex.org/I102248843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0337258,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"88","last_page":"98"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9973000288009644,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9973000288009644,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9940999746322632,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.9919000267982483,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7786221504211426},{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.7581949830055237},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6571442484855652},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6489307880401611},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6408178210258484},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6251304149627686},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.621878445148468},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5828112959861755},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4931301772594452},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4887687861919403},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45655813813209534},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44731199741363525},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4387173354625702},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4221140146255493},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41024327278137207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3233433961868286}],"concepts":[{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7786221504211426},{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.7581949830055237},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6571442484855652},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6489307880401611},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6408178210258484},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6251304149627686},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.621878445148468},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5828112959861755},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4931301772594452},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4887687861919403},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45655813813209534},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44731199741363525},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4387173354625702},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4221140146255493},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41024327278137207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3233433961868286},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0010347000880098","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0010347000880098","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0010347000880098","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0010347000880098","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th International Conference on Operations Research and Enterprise Systems","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4252122881","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4243934122","https://openalex.org/W3100114454","https://openalex.org/W2035016254","https://openalex.org/W4302819359","https://openalex.org/W2507810539","https://openalex.org/W1963627056","https://openalex.org/W4232431455"],"abstract_inverted_index":{"Motivated":[0],"by":[1,30],"their":[2],"success":[3],"in":[4],"the":[5,23,33,61,80,85,105,114,122],"single-objective":[6],"domain,":[7],"we":[8,25],"propose":[9],"a":[10,73,101],"very":[11],"simple":[12,40],"linear":[13,35],"programming-based":[14],"matheuristic":[15,88],"for":[16,90,121],"tri-objective":[17,91],"binary":[18],"integer":[19,92],"programming.":[20,93],"To":[21],"tackle":[22],"problem,":[24],"obtain":[26,57],"lower":[27,53],"bound":[28,54],"sets":[29],"means":[31],"of":[32,60,64,82,104],"vector":[34],"programming":[36],"solver":[37],"Bensolve.":[38],"Then,":[39],"heuristic":[41],"approaches,":[42],"such":[43],"as":[44],"rounding":[45],"and":[46],"path":[47],"relinking,":[48],"are":[49],"applied":[50],"to":[51,56,72,79],"this":[52],"set":[55,63],"high-quality":[58],"approximations":[59],"optimal":[62],"trade-off":[65],"solutions.":[66],"The":[67],"proposed":[68],"algorithm":[69,76],"is":[70],"compared":[71],"recently":[74],"suggested":[75],"which":[77],"is,":[78],"best":[81],"our":[83,98],"knowledge,":[84],"only":[86],"existing":[87],"method":[89,99,116],"Computational":[94],"experiments":[95],"show":[96],"that":[97],"produces":[100],"better":[102],"approximation":[103],"true":[106],"Pareto":[107],"front":[108],"using":[109],"significantly":[110],"less":[111],"time":[112],"than":[113],"benchmark":[115,119],"on":[117],"standard":[118],"instances":[120],"three-objective":[123],"knapsack":[124],"problem.":[125]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}