{"id":"https://openalex.org/W2065297120","doi":"https://doi.org/10.1137/s0895480102419445","title":"Two Edge-Disjoint Hop-Constrained Paths and Polyhedra","display_name":"Two Edge-Disjoint Hop-Constrained Paths and Polyhedra","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2065297120","doi":"https://doi.org/10.1137/s0895480102419445","mag":"2065297120"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480102419445","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480102419445","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054538299","display_name":"David Huygens","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Huygens","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101855070","display_name":"A. Ridha Mahjoub","orcid":"https://orcid.org/0000-0002-1079-1892"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ali Ridha Mahjoub","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072205266","display_name":"Pierre Pesneau","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pierre Pesneau","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.3431,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.95735772,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"2","first_page":"287","last_page":"312"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.998199999332428,"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.998199999332428,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9976999759674072,"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/combinatorics","display_name":"Combinatorics","score":0.830746054649353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8066447973251343},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.7200552225112915},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7089860439300537},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6440749168395996},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.4933113157749176},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4737340211868286},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4485244154930115},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4475308060646057},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44172051548957825},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4219118654727936},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.12554526329040527},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08653545379638672}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.830746054649353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8066447973251343},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.7200552225112915},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7089860439300537},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6440749168395996},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.4933113157749176},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4737340211868286},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4485244154930115},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4475308060646057},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44172051548957825},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4219118654727936},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.12554526329040527},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08653545379638672},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0895480102419445","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480102419445","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.14.232","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://smg.ulb.ac.be/Preprints/FullText/Huygens02_13.ps","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00281980v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00281980","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":"SIAM Journal on Discrete Mathematics, 2004, 18 (2), pp.287-312. ⟨10.1137/S0895480102419445⟩","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/167276","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/167276","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM journal on discrete mathematics, 18 (2","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W7302391","https://openalex.org/W1484040084","https://openalex.org/W1541536235","https://openalex.org/W1967079221","https://openalex.org/W1975457241","https://openalex.org/W1987520910","https://openalex.org/W1989714486","https://openalex.org/W1997556033","https://openalex.org/W1999679195","https://openalex.org/W2000733920","https://openalex.org/W2012329067","https://openalex.org/W2012939571","https://openalex.org/W2019067222","https://openalex.org/W2019658506","https://openalex.org/W2020130108","https://openalex.org/W2036527839","https://openalex.org/W2039611868","https://openalex.org/W2050851587","https://openalex.org/W2052035035","https://openalex.org/W2056058917","https://openalex.org/W2061552894","https://openalex.org/W2082883608","https://openalex.org/W2089731376","https://openalex.org/W2117754372","https://openalex.org/W2121204510","https://openalex.org/W2133150235","https://openalex.org/W2138913744","https://openalex.org/W2142299762","https://openalex.org/W2148237104","https://openalex.org/W2172955861","https://openalex.org/W2284291999","https://openalex.org/W2912533262","https://openalex.org/W4234408051"],"related_works":["https://openalex.org/W2228244008","https://openalex.org/W4252122881","https://openalex.org/W134055995","https://openalex.org/W2009796757","https://openalex.org/W4302819359","https://openalex.org/W1973873435","https://openalex.org/W4244487479","https://openalex.org/W1963627056","https://openalex.org/W2154792656","https://openalex.org/W2952452737"],"abstract_inverted_index":{"Given":[0],"a":[1,10,18,33,63,144,148,193],"graph":[2],"G":[3,181],"with":[4],"distinguished":[5],"nodes":[6],"s":[7,40],"and":[8,17,41,99,136,165,191],"t,":[9],"cost":[11,35],"on":[12],"each":[13],"edge":[14],"of":[15,50,66,83,94,127,174,189,196],"G,":[16],"fixed":[19],"integer":[20,71],"L":[21,78,100,113,158,177,200],"\\geq":[22,178,201],"2,":[23],"the":[24,75,87,92,108,124,132,134,137,155,187],"two":[25,47],"edge-disjoint":[26,48],"hop-constrained":[27],"paths":[28,49,96],"problem":[29,61,76,156],"is":[30,97,103,141,182],"to":[31,86,171],"find":[32],"minimum":[34],"subgraph":[36],"such":[37],"that":[38,60,123],"between":[39],"t":[42],"there":[43],"exist":[44],"at":[45,52],"least":[46],"length":[51],"most":[53],"L.":[54],"In":[55,116],"this":[56,84,121,197],"paper,":[57],"we":[58,118,146],"consider":[59],"from":[62],"polyhedral":[64],"point":[65],"view.":[67],"We":[68,106,161,184],"give":[69,163,192],"an":[70],"programming":[72],"formulation":[73],"for":[74,112,154,168,176,199],"when":[77,157,180,203],"=":[79,101,114,159,205],"2,3.":[80,115,160],"An":[81],"extension":[82],"result":[85],"more":[88],"general":[89],"case":[90,122],"where":[91],"number":[93],"required":[95],"arbitrary":[98],"2,3":[102],"also":[104,162],"given.":[105],"discuss":[107],"associated":[109],"polytope,":[110],"P(G,L),":[111,128],"particular,":[117],"show":[119],"in":[120],"linear":[125],"relaxation":[126],"Q(G,L),":[129],"given":[130],"by":[131],"trivial,":[133],"st-cut,":[135],"so-called":[138],"L-path-cut":[139],"inequalities,":[140],"integral.":[142],"As":[143],"consequence,":[145],"obtain":[147],"polynomial":[149],"time":[150],"cutting":[151],"plane":[152],"algorithm":[153],"necessary":[164],"sufficient":[166],"conditions":[167],"these":[169],"inequalities":[170],"define":[172],"facets":[173],"P(G,L)":[175,190,204],"2":[179,202],"complete.":[183],"finally":[185],"investigate":[186],"dominant":[188],"complete":[194],"description":[195],"polyhedron":[198],"Q(G,L).":[206]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}