{"id":"https://openalex.org/W7125430012","doi":"https://doi.org/10.1016/j.ejor.2026.01.018","title":"Two-index formulations for the traveling purchaser problem with incompatibility constraints","display_name":"Two-index formulations for the traveling purchaser problem with incompatibility constraints","publication_year":2026,"publication_date":"2026-01-22","ids":{"openalex":"https://openalex.org/W7125430012","doi":"https://doi.org/10.1016/j.ejor.2026.01.018"},"language":"en","primary_location":{"id":"doi:10.1016/j.ejor.2026.01.018","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.01.018","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"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":"European Journal of Operational 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.ejor.2026.01.018","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040709862","display_name":"Raquel Bernardino","orcid":"https://orcid.org/0000-0003-3289-2587"},"institutions":[{"id":"https://openalex.org/I141596103","display_name":"University of Lisbon","ror":"https://ror.org/01c27hj86","country_code":"PT","type":"education","lineage":["https://openalex.org/I141596103"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Raquel Bernardino","raw_affiliation_strings":["ISEG Lisbon School of Economics Management, ISEG Research, Universidade de Lisboa, Lisbon, Portugal"],"affiliations":[{"raw_affiliation_string":"ISEG Lisbon School of Economics Management, ISEG Research, Universidade de Lisboa, Lisbon, Portugal","institution_ids":["https://openalex.org/I141596103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101861222","display_name":"Daniel Santos","orcid":"https://orcid.org/0000-0003-0611-2460"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Daniel Santos","raw_affiliation_strings":["CEGIST, Instituto Superior T\u00e9cnico, Universidade de Lisboa"],"affiliations":[{"raw_affiliation_string":"CEGIST, Instituto Superior T\u00e9cnico, Universidade de Lisboa","institution_ids":["https://openalex.org/I121345201"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5040709862"],"corresponding_institution_ids":["https://openalex.org/I141596103"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":{"value":3290,"currency":"USD","value_usd":3290},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15607595,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"332","issue":"3","first_page":"748","last_page":"763"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9562000036239624,"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.9562000036239624,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.007499999832361937,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.006000000052154064,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/compatibility","display_name":"Compatibility (geochemistry)","score":0.6373000144958496},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6330999732017517},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5863999724388123},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.5238999724388123},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5080000162124634},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4447000026702881},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4388999938964844},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.420199990272522}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7409999966621399},{"id":"https://openalex.org/C2778648169","wikidata":"https://www.wikidata.org/wiki/Q967768","display_name":"Compatibility (geochemistry)","level":2,"score":0.6373000144958496},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6330999732017517},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5863999724388123},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5268999934196472},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.5238999724388123},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5080000162124634},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4447000026702881},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4388999938964844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43630000948905945},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.420199990272522},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41260001063346863},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3788999915122986},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.2847999930381775},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C108005400","wikidata":"https://www.wikidata.org/wiki/Q1305598","display_name":"Facility location problem","level":2,"score":0.25459998846054077},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.2540999948978424},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.25}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.ejor.2026.01.018","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.01.018","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"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":"European Journal of Operational Research","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.ejor.2026.01.018","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejor.2026.01.018","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"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":"European Journal of Operational Research","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3386161786","display_name":null,"funder_award_id":"UID/97/2025","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G667923300","display_name":null,"funder_award_id":"UID/06522/2025","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1428828117","https://openalex.org/W2138571421","https://openalex.org/W2554097742","https://openalex.org/W2564703335","https://openalex.org/W2587506683","https://openalex.org/W2889309367","https://openalex.org/W3005220884","https://openalex.org/W3142352709","https://openalex.org/W3177079419","https://openalex.org/W4205857536","https://openalex.org/W4283460758","https://openalex.org/W4390086088","https://openalex.org/W4407947347"],"related_works":[],"abstract_inverted_index":{"\u2022":[0,10,19,29],"Two-index":[1],"formulations":[2,148,163,180],"for":[3],"the":[4,15,25,34,42,57,76,81,103,141,147,161,166,178,182,194,200,208],"traveling":[5],"purchaser":[6],"problem":[7,54],"with":[8,46,216],"incompatibilities.":[9],"Valid":[11],"inequalities":[12,138,145],"based":[13,164],"on":[14,75,165],"incompatibilities":[16,65],"between":[17,24,66],"items.":[18,67,100],"Theoretical":[20],"and":[21,117,124,149,206],"empirical":[22],"comparison":[23,126],"proposed":[26],"two-index":[27,108,162],"formulations.":[28],"Branch-and-cut":[30],"algorithm":[31],"to":[32,177,199],"solve":[33,186],"non-compact":[35],"models.":[36,129],"In":[37,130],"this":[38],"article,":[39],"we":[40,105,132],"study":[41],"Traveling":[43,59],"Purchaser":[44,60],"Problem":[45,61],"Incompatibility":[47],"Constraints":[48],"(TPP-IC),":[49],"an":[50],"NP-hard":[51],"combinatorial":[52],"optimization":[53],"that":[55,92,139,160,197],"extends":[56],"classical":[58],"(TPP)":[62],"by":[63,90],"introducing":[64],"These":[68,144],"prohibit":[69],"incompatible":[70,99],"items":[71],"from":[72],"being":[73],"transported":[74],"same":[77],"route.":[78],"We":[79,120],"model":[80],"TPP-IC":[82,204],"using":[83],"structures":[84],"called":[85],"compatibility":[86,167],"graphs,":[87],"which":[88],"ensure,":[89],"construction,":[91],"any":[93],"feasible":[94],"route":[95],"does":[96],"not":[97],"transport":[98],"To":[101],"address":[102],"problem,":[104],"propose":[106],"several":[107],"mixed-integer":[109],"linear":[110,172],"programming":[111,173],"(MILP)":[112],"formulations,":[113],"including":[114],"both":[115],"item-based":[116],"market-based":[118],"approaches.":[119],"present":[121],"a":[122,134,153,217],"theoretical":[123],"computational":[125,157],"of":[127,136,202,210,220],"these":[128],"addition,":[131],"introduce":[133],"family":[135],"valid":[137],"exploit":[140],"incompatibility":[142],"constraints.":[143],"strengthen":[146],"are":[150],"incorporated":[151],"into":[152],"branch-and-cut":[154],"algorithm.":[155],"Our":[156,190],"experiments":[158],"show":[159],"graphs":[168],"yield":[169],"significantly":[170],"higher":[171],"relaxation":[174],"values":[175],"compared":[176],"three-index":[179],"in":[181,214],"literature.":[183],"They":[184],"also":[185,192],"more":[187],"benchmark":[188],"instances.":[189],"results":[191],"highlight":[193],"main":[195],"factors":[196],"contribute":[198],"difficulty":[201],"solving":[203],"instances":[205,215],"reveal":[207],"limitations":[209],"exact":[211],"solution":[212],"methods":[213],"high":[218],"degree":[219],"item":[221],"incompatibility.":[222]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2026-01-23T00:00:00"}