{"id":"https://openalex.org/W2972134833","doi":"https://doi.org/10.1109/codit.2019.8820661","title":"A layered compact formulation for the Multiple Steiner TSP with Order constraints","display_name":"A layered compact formulation for the Multiple Steiner TSP with Order constraints","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2972134833","doi":"https://doi.org/10.1109/codit.2019.8820661","mag":"2972134833"},"language":"en","primary_location":{"id":"doi:10.1109/codit.2019.8820661","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2019.8820661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://basepub.dauphine.psl.eu/handle/123456789/24715","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/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"],"is_corresponding":true,"raw_author_name":"A. Ridha Mahjoub","raw_affiliation_strings":["Universit?? Paris-Dauphine, LAM-SADE, Paris, France"],"affiliations":[{"raw_affiliation_string":"Universit?? Paris-Dauphine, LAM-SADE, Paris, France","institution_ids":["https://openalex.org/I56435720"]}]},{"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"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Raouia Taktak","raw_affiliation_strings":["ISIMS & LT2S, Sfax University, Tunisia"],"affiliations":[{"raw_affiliation_string":"ISIMS & LT2S, Sfax University, Tunisia","institution_ids":["https://openalex.org/I142899784"]}]},{"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????o, Universidade Federal Fluminense, Niter??i, RJ, Brasil"],"affiliations":[{"raw_affiliation_string":"Departamento de Engenharia de Produ????o, Universidade Federal Fluminense, Niter??i, RJ, Brasil","institution_ids":["https://openalex.org/I161127581"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101855070"],"corresponding_institution_ids":["https://openalex.org/I56435720"],"apc_list":null,"apc_paid":null,"fwci":0.6619,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76729191,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1462","last_page":"1467"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9995999932289124,"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.9995999932289124,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9843999743461609,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9793000221252441,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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.8315141201019287},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.7002930641174316},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6837767362594604},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.6279654502868652},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5883923768997192},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.5300310254096985},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49243173003196716},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4545447528362274},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4462703466415405}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8315141201019287},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.7002930641174316},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6837767362594604},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.6279654502868652},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5883923768997192},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.5300310254096985},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49243173003196716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4545447528362274},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4462703466415405},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/codit.2019.8820661","is_oa":false,"landing_page_url":"https://doi.org/10.1109/codit.2019.8820661","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03964738v1","is_oa":false,"landing_page_url":"https://hal.science/hal-03964738","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT), Apr 2019, Paris, France. pp.1462-1467, ⟨10.1109/CoDIT.2019.8820661⟩","raw_type":"Conference papers"},{"id":"pmh:oai:basepub.dauphine.psl.eu:123456789/24715","is_oa":true,"landing_page_url":"https://basepub.dauphine.psl.eu/handle/123456789/24715","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"}],"best_oa_location":{"id":"pmh:oai:basepub.dauphine.psl.eu:123456789/24715","is_oa":true,"landing_page_url":"https://basepub.dauphine.psl.eu/handle/123456789/24715","pdf_url":null,"source":{"id":"https://openalex.org/S4306401007","display_name":"Base Institutionnelle de Recherche de l'universit\u00e9 Paris-Dauphine (BIRD) (University Paris-Dauphine)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I102197404","host_organization_name":"Universit\u00e9 Paris-Sud","host_organization_lineage":["https://openalex.org/I102197404"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Communication / Conf\u00e9rence"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W195014378","https://openalex.org/W626292722","https://openalex.org/W1540760152","https://openalex.org/W1571087346","https://openalex.org/W1657794465","https://openalex.org/W1963547452","https://openalex.org/W1968143987","https://openalex.org/W1975457241","https://openalex.org/W1993862500","https://openalex.org/W1994184140","https://openalex.org/W1997039203","https://openalex.org/W2009693817","https://openalex.org/W2029242918","https://openalex.org/W2033662447","https://openalex.org/W2040481750","https://openalex.org/W2050819731","https://openalex.org/W2083210138","https://openalex.org/W2116834205","https://openalex.org/W2119235896","https://openalex.org/W2137045485","https://openalex.org/W2147151422","https://openalex.org/W2346818566","https://openalex.org/W2505968561","https://openalex.org/W2735006321","https://openalex.org/W2750078990","https://openalex.org/W4213255380","https://openalex.org/W4245394219","https://openalex.org/W6743418789"],"related_works":["https://openalex.org/W2118320476","https://openalex.org/W2161182859","https://openalex.org/W2025658531","https://openalex.org/W1503036335","https://openalex.org/W4244816249","https://openalex.org/W2115973883","https://openalex.org/W2739242419","https://openalex.org/W1585318792","https://openalex.org/W59641357","https://openalex.org/W28092394"],"abstract_inverted_index":{"In":[0,71],"this":[1],"paper":[2],"we":[3,77],"study":[4],"a":[5,13,30,65,83],"network":[6],"design":[7],"problem":[8],"that":[9,41],"consists":[10],"in":[11],"finding":[12],"minimum":[14],"weight":[15],"subgraph":[16],"containing":[17],"solutions":[18,63],"for":[19,35],"multiple":[20],"Steiner":[21],"Traveling":[22],"Salesman":[23],"Problems":[24],"with":[25],"Order":[26],"constraints.":[27],"We":[28],"propose":[29],"layered":[31],"compact":[32],"ILP":[33],"formulation":[34],"the":[36],"problem.":[37],"Experimental":[38],"results":[39],"show":[40],"it":[42],"is":[43],"reasonably":[44],"effective":[45],"and":[46,58],"can":[47],"solve":[48],"to":[49,73],"optimality":[50],"medium-sized":[51],"instances.":[52],"Lage-scale":[53],"instances":[54],"are":[55],"more":[56],"difficult,":[57],"does":[59],"not":[60],"reach":[61],"optimal":[62],"within":[64],"time":[66],"limit":[67],"of":[68],"3":[69],"hours.":[70],"order":[72],"improve":[74],"our":[75],"formulation,":[76],"investigate":[78],"valid":[79],"inequalities":[80],"efficiency":[81],"using":[82],"column-generation-based":[84],"approach.":[85]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}