{"id":"https://openalex.org/W4410949687","doi":"https://doi.org/10.1007/s10878-025-01288-1","title":"The multiple steiner TSP with cyclic order on terminals: valid inequalities and polyhedra","display_name":"The multiple steiner TSP with cyclic order on terminals: valid inequalities and polyhedra","publication_year":2025,"publication_date":"2025-06-02","ids":{"openalex":"https://openalex.org/W4410949687","doi":"https://doi.org/10.1007/s10878-025-01288-1"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-025-01288-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01288-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01288-1.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/s10878-025-01288-1.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101855070","display_name":"A. Ridha Mahjoub","orcid":"https://orcid.org/0000-0002-1079-1892"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]},{"id":"https://openalex.org/I56435720","display_name":"Universit\u00e9 Paris Dauphine-PSL","ror":"https://ror.org/052bz7812","country_code":"FR","type":"education","lineage":["https://openalex.org/I2746051580","https://openalex.org/I56435720"]}],"countries":["FR","KW"],"is_corresponding":true,"raw_author_name":"A. Ridha Mahjoub","raw_affiliation_strings":["Department of Statistics and Operations Research, College of Science, Kuwait University, Kuwait City, Kuwait","LAMSADE, UMR CNRS 7243, Universit\u00e9 Paris-Dauphine PSL, Paris, France"],"raw_orcid":"https://orcid.org/0000-0002-1079-1892","affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, College of Science, Kuwait University, Kuwait City, Kuwait","institution_ids":["https://openalex.org/I36721946"]},{"raw_affiliation_string":"LAMSADE, UMR CNRS 7243, Universit\u00e9 Paris-Dauphine PSL, Paris, France","institution_ids":["https://openalex.org/I56435720","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054801518","display_name":"Raouia Taktak","orcid":"https://orcid.org/0000-0003-2377-5709"},"institutions":[{"id":"https://openalex.org/I142899784","display_name":"University of Sfax","ror":"https://ror.org/04d4sd432","country_code":"TN","type":"education","lineage":["https://openalex.org/I142899784"]},{"id":"https://openalex.org/I4210119561","display_name":"Digital Research Centre of Sfax","ror":"https://ror.org/02s48dm85","country_code":"TN","type":"facility","lineage":["https://openalex.org/I4210119561"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Raouia Taktak","raw_affiliation_strings":["ISIMS, Universit\u00e9 de Sfax, Sfax, Tunisia","Sm@rts, Centre de Recherche en Num\u00e9rique de Sfax, Sfax, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ISIMS, Universit\u00e9 de Sfax, Sfax, Tunisia","institution_ids":["https://openalex.org/I142899784"]},{"raw_affiliation_string":"Sm@rts, Centre de Recherche en Num\u00e9rique de Sfax, Sfax, Tunisia","institution_ids":["https://openalex.org/I4210119561"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088693799","display_name":"Eduardo Uchoa","orcid":"https://orcid.org/0000-0002-8687-2613"},"institutions":[{"id":"https://openalex.org/I161127581","display_name":"Universidade Federal Fluminense","ror":"https://ror.org/02rjhbb08","country_code":"BR","type":"education","lineage":["https://openalex.org/I161127581"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Eduardo Uchoa","raw_affiliation_strings":["Departamento de Engenharia de Produ\u00e7\u00e3o, Universidade Federal Fluminense, Rio de Janeiro, RJ, Brasil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Engenharia de Produ\u00e7\u00e3o, Universidade Federal Fluminense, Rio de Janeiro, RJ, Brasil","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5101855070"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I36721946","https://openalex.org/I56435720"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.7777,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.73510117,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"49","issue":"5","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980000257492065,"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.9980000257492065,"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.97079998254776,"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/T11223","display_name":"Maritime Ports and Logistics","score":0.9660000205039978,"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8914526104927063},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.8578302264213562},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7084840536117554},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6605316996574402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6595615148544312},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6062353253364563},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5892337560653687},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5877968072891235},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5076621770858765},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4859836995601654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4830256402492523},{"id":"https://openalex.org/keywords/facet","display_name":"Facet (psychology)","score":0.4805193841457367},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.47952866554260254},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.4539291262626648},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4210619330406189},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.420291930437088},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.416331946849823},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38857975602149963},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2938499450683594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.27275151014328003},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.16620832681655884},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.13002434372901917}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8914526104927063},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8578302264213562},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7084840536117554},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6605316996574402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6595615148544312},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6062353253364563},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5892337560653687},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5877968072891235},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5076621770858765},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4859836995601654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4830256402492523},{"id":"https://openalex.org/C43122875","wikidata":"https://www.wikidata.org/wiki/Q5428522","display_name":"Facet (psychology)","level":4,"score":0.4805193841457367},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.47952866554260254},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.4539291262626648},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4210619330406189},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.420291930437088},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.416331946849823},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38857975602149963},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2938499450683594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.27275151014328003},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.16620832681655884},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.13002434372901917},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2865642","wikidata":"https://www.wikidata.org/wiki/Q378132","display_name":"Big Five personality traits","level":3,"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C187288502","wikidata":"https://www.wikidata.org/wiki/Q641118","display_name":"Personality","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10878-025-01288-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01288-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01288-1.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-05432861v1","is_oa":true,"landing_page_url":"https://hal.science/hal-05432861","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"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":"Journal of Combinatorial Optimization, 2025, 49 (89), ⟨10.1007/s10878-025-01288-1⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01288-1","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-025-01288-1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10878-025-01288-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-025-01288-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-025-01288-1.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F5601897671","display_name":"Universit\u00e9 Paris Dauphine - PSL","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4410949687.pdf","grobid_xml":"https://content.openalex.org/works/W4410949687.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W83064900","https://openalex.org/W626292722","https://openalex.org/W1657794465","https://openalex.org/W1974745840","https://openalex.org/W1994184140","https://openalex.org/W2004882088","https://openalex.org/W2009693817","https://openalex.org/W2015274422","https://openalex.org/W2022641305","https://openalex.org/W2022912747","https://openalex.org/W2023911069","https://openalex.org/W2033662447","https://openalex.org/W2042706982","https://openalex.org/W2050819731","https://openalex.org/W2056058917","https://openalex.org/W2065297120","https://openalex.org/W2074323873","https://openalex.org/W2089731376","https://openalex.org/W2093080906","https://openalex.org/W2116834205","https://openalex.org/W2119235896","https://openalex.org/W2137045485","https://openalex.org/W2145243417","https://openalex.org/W2147151422","https://openalex.org/W2148237104","https://openalex.org/W2735006321","https://openalex.org/W2750078990","https://openalex.org/W2891500134","https://openalex.org/W2944565881","https://openalex.org/W2962992409","https://openalex.org/W2972134833","https://openalex.org/W3033157957","https://openalex.org/W3036915266","https://openalex.org/W3043938466","https://openalex.org/W3129736740","https://openalex.org/W3130706049","https://openalex.org/W3139171943","https://openalex.org/W3167683174","https://openalex.org/W4236709137","https://openalex.org/W4245394219","https://openalex.org/W4294930823","https://openalex.org/W4319993011","https://openalex.org/W4383496079"],"related_works":["https://openalex.org/W2009796757","https://openalex.org/W4252122881","https://openalex.org/W2952452737","https://openalex.org/W1531708257","https://openalex.org/W4300637737","https://openalex.org/W2942148196","https://openalex.org/W2171830873","https://openalex.org/W2769220156","https://openalex.org/W2593343445","https://openalex.org/W2903252607"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"paper":[2,133,140],"deals":[3],"with":[4,18,26,39,74,102],"a":[5,33,44,54,61,138],"variant":[6],"of":[7,35,46,116],"the":[8,14,30,71,75,90],"Traveling":[9],"Salesman":[10],"Problem":[11],"(TSP),":[12],"called":[13],"Multiple":[15],"Steiner":[16],"TSP":[17],"Order":[19],"Constraints":[20],"(MSTSPOC).":[21],"Consider":[22],"an":[23],"undirected":[24],"graph":[25],"nonnegative":[27],"weights":[28],"on":[29],"edges,":[31],"and":[32,105],"set":[34,45],"salesmen":[36],"such":[37],"that":[38],"each":[40,59],"salesman":[41,60],"is":[42],"associated":[43,73],"ordered":[47],"terminals.":[48,68],"The":[49,127],"MSTSPOC":[50],"consists":[51],"in":[52,64,82,131,137],"finding":[53],"minimum-weight":[55],"subgraph":[56],"containing":[57],"for":[58,108],"tour":[62],"going":[63],"order":[65],"through":[66],"its":[67],"We":[69,87,95],"study":[70],"polytope":[72],"Integer":[76],"Linear":[77],"Programming":[78],"(ILP)":[79],"formulation":[80],"proposed":[81],"Borne":[83],"et":[84],"al.":[85],"(2013).":[86],"characterize":[88],"when":[89],"basic":[91],"inequalities":[92,100,110],"define":[93],"facets.":[94],"also":[96,125],"describe":[97],"new":[98],"valid":[99,117],"along":[101],"necessary":[103],"conditions":[104,107],"sufficient":[106],"these":[109],"to":[111],"be":[112],"facet-defining.":[113],"Further":[114],"families":[115],"inequalities,":[118],"coming":[119],"from":[120],"closely":[121],"related":[122],"problems,":[123],"are":[124,134],"discussed.":[126],"theoretical":[128],"results":[129],"presented":[130],"this":[132],"computationally":[135],"tested":[136],"companion":[139],"(Taktak":[141],"2024).":[142]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-13T06:13:01.061226","created_date":"2025-10-10T00:00:00"}