{"id":"https://openalex.org/W2806976001","doi":"https://doi.org/10.1007/s13675-018-0099-5","title":"A polyhedral approach to the generalized minimum labeling spanning tree problem","display_name":"A polyhedral approach to the generalized minimum labeling spanning tree problem","publication_year":2018,"publication_date":"2018-06-04","ids":{"openalex":"https://openalex.org/W2806976001","doi":"https://doi.org/10.1007/s13675-018-0099-5","mag":"2806976001"},"language":"en","primary_location":{"id":"doi:10.1007/s13675-018-0099-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-018-0099-5","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1007/s13675-018-0099-5","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110562648","display_name":"ThiagoGouveiada Silva","orcid":null},"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"]},{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]},{"id":"https://openalex.org/I3018006580","display_name":"Instituto Federal de Educa\u00e7\u00e3o Ci\u00eancia e Tecnologia da Para\u00edba","ror":"https://ror.org/01xc5jm57","country_code":"BR","type":"education","lineage":["https://openalex.org/I3018006580"]},{"id":"https://openalex.org/I4210119991","display_name":"Laboratoire Informatique d'Avignon","ror":"https://ror.org/02n399288","country_code":"FR","type":"facility","lineage":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}],"countries":["BR","FR"],"is_corresponding":true,"raw_author_name":"ThiagoGouveiada Silva","raw_affiliation_strings":["IFPB, Instituto Federal de Educa\u00e7\u00e3o, Ci\u00eancia e Tecnologia da Para\u00edba, 256 Av. Jo\u00e3o da Mata, CEP: 58.015-020, Jo\u00e3o Pessoa, PB, Brazil","LIA-UAPV, Universit\u00e9 d\u2019Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","UFF, Universidade Federal Fluminense, 156 R. Passo da P\u00e1tria, CEP: 24210-240, Niter\u00f3i, RJ, Brazil","LIA-UAPV, Universit\u00e9 d'Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France"],"raw_orcid":"https://orcid.org/0000-0002-6198-7369","affiliations":[{"raw_affiliation_string":"IFPB, Instituto Federal de Educa\u00e7\u00e3o, Ci\u00eancia e Tecnologia da Para\u00edba, 256 Av. Jo\u00e3o da Mata, CEP: 58.015-020, Jo\u00e3o Pessoa, PB, Brazil","institution_ids":["https://openalex.org/I3018006580"]},{"raw_affiliation_string":"LIA-UAPV, Universit\u00e9 d\u2019Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","institution_ids":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]},{"raw_affiliation_string":"UFF, Universidade Federal Fluminense, 156 R. Passo da P\u00e1tria, CEP: 24210-240, Niter\u00f3i, RJ, Brazil","institution_ids":["https://openalex.org/I161127581"]},{"raw_affiliation_string":"LIA-UAPV, Universit\u00e9 d'Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","institution_ids":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014362095","display_name":"Serigne Gu\u00e8ye","orcid":"https://orcid.org/0000-0001-7217-8543"},"institutions":[{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]},{"id":"https://openalex.org/I4210119991","display_name":"Laboratoire Informatique d'Avignon","ror":"https://ror.org/02n399288","country_code":"FR","type":"facility","lineage":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Serigne Gueye","raw_affiliation_strings":["LIA-UAPV, Universit\u00e9 d\u2019Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","LIA-UAPV, Universit\u00e9 d'Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIA-UAPV, Universit\u00e9 d\u2019Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","institution_ids":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]},{"raw_affiliation_string":"LIA-UAPV, Universit\u00e9 d'Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","institution_ids":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016889937","display_name":"Philippe Michelon","orcid":"https://orcid.org/0000-0001-6648-5651"},"institutions":[{"id":"https://openalex.org/I198415970","display_name":"Universit\u00e9 d'Avignon et des Pays de Vaucluse","ror":"https://ror.org/00mfpxb84","country_code":"FR","type":"education","lineage":["https://openalex.org/I198415970"]},{"id":"https://openalex.org/I4210119991","display_name":"Laboratoire Informatique d'Avignon","ror":"https://ror.org/02n399288","country_code":"FR","type":"facility","lineage":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Philippe Michelon","raw_affiliation_strings":["LIA-UAPV, Universit\u00e9 d\u2019Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","LIA-UAPV, Universit\u00e9 d'Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"LIA-UAPV, Universit\u00e9 d\u2019Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","institution_ids":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]},{"raw_affiliation_string":"LIA-UAPV, Universit\u00e9 d'Avignon, 339 Chemin des Meinajaries, 84140, Avignon, France","institution_ids":["https://openalex.org/I198415970","https://openalex.org/I4210119991"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113843599","display_name":"LuizSatoru Ochi","orcid":null},"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":"LuizSatoru Ochi","raw_affiliation_strings":["UFF, Universidade Federal Fluminense, 156 R. Passo da P\u00e1tria, CEP: 24210-240, Niter\u00f3i, RJ, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UFF, Universidade Federal Fluminense, 156 R. Passo da P\u00e1tria, CEP: 24210-240, Niter\u00f3i, RJ, Brazil","institution_ids":["https://openalex.org/I161127581"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109398117","display_name":"Luc\u00eddiodosAnjosFormiga Cabral","orcid":null},"institutions":[{"id":"https://openalex.org/I169045520","display_name":"Universidade Federal da Para\u00edba","ror":"https://ror.org/00p9vpz11","country_code":"BR","type":"education","lineage":["https://openalex.org/I169045520"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Luc\u00eddiodosAnjosFormiga Cabral","raw_affiliation_strings":["UFPB, Universidade Federal da Para\u00edba, R. dos Escoteiros, CEP: 58055-000, Jo\u00e3o Pessoa, PB, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UFPB, Universidade Federal da Para\u00edba, R. dos Escoteiros, CEP: 58055-000, Jo\u00e3o Pessoa, PB, Brazil","institution_ids":["https://openalex.org/I169045520"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5110562648"],"corresponding_institution_ids":["https://openalex.org/I161127581","https://openalex.org/I198415970","https://openalex.org/I3018006580","https://openalex.org/I4210119991"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":0.6834,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.68488307,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"7","issue":"1","first_page":"47","last_page":"77"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T14304","display_name":"Transport Systems and Technology","score":0.9757000207901001,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T14304","display_name":"Transport Systems and Technology","score":0.9757000207901001,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9699000120162964,"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/T11606","display_name":"Infrastructure Maintenance and Monitoring","score":0.9535999894142151,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/spanning-tree","display_name":"Spanning tree","score":0.6868073344230652},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.63710618019104},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6288065910339355},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6232783198356628},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5900757908821106},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5605754256248474},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5450806617736816},{"id":"https://openalex.org/keywords/minimum-degree-spanning-tree","display_name":"Minimum degree spanning tree","score":0.5405115485191345},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5106423497200012},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48664554953575134},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.44254687428474426},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42815330624580383},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.42267918586730957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3616238236427307},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3179685175418854}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6868073344230652},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.63710618019104},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6288065910339355},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6232783198356628},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5900757908821106},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5605754256248474},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5450806617736816},{"id":"https://openalex.org/C64271015","wikidata":"https://www.wikidata.org/wiki/Q6865444","display_name":"Minimum degree spanning tree","level":3,"score":0.5405115485191345},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5106423497200012},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48664554953575134},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.44254687428474426},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42815330624580383},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.42267918586730957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3616238236427307},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3179685175418854},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s13675-018-0099-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-018-0099-5","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-02266931v1","is_oa":false,"landing_page_url":"https://hal.science/hal-02266931","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":"EURO Journal on Computational Optimization, 2019, 7 (1), pp.47-77. ⟨10.1007/s13675-018-0099-5⟩","raw_type":"Journal articles"},{"id":"pmh:oai:RePEc:spr:eurjco:v:7:y:2019:i:1:d:10.1007_s13675-018-0099-5","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s13675-018-0099-5","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"},{"id":"pmh:oai:doaj.org/article:05898c0ad5c440f29cd7df04ac0054f2","is_oa":true,"landing_page_url":"https://doaj.org/article/05898c0ad5c440f29cd7df04ac0054f2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"EURO Journal on Computational Optimization, Vol 7, Iss 1, Pp 47-77 (2019)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s13675-018-0099-5","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s13675-018-0099-5","pdf_url":null,"source":{"id":"https://openalex.org/S4210171502","display_name":"EURO Journal on Computational Optimization","issn_l":"2192-4406","issn":["2192-4406","2192-4414"],"is_oa":true,"is_in_doaj":true,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"EURO Journal on Computational Optimization","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.44999998807907104,"display_name":"Industry, innovation and infrastructure"}],"awards":[{"id":"https://openalex.org/G6681020638","display_name":null,"funder_award_id":"207334/2015-3","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W31709568","https://openalex.org/W90095718","https://openalex.org/W185140303","https://openalex.org/W201114412","https://openalex.org/W563908396","https://openalex.org/W1968143987","https://openalex.org/W1997809628","https://openalex.org/W1998751027","https://openalex.org/W2001366300","https://openalex.org/W2048177396","https://openalex.org/W2051100691","https://openalex.org/W2095481180","https://openalex.org/W2102073566","https://openalex.org/W2103657951","https://openalex.org/W2106233376","https://openalex.org/W2117842753","https://openalex.org/W2156312014","https://openalex.org/W2963347446","https://openalex.org/W4210500228","https://openalex.org/W4211084250","https://openalex.org/W6603586844","https://openalex.org/W6608112029"],"related_works":["https://openalex.org/W2021079478","https://openalex.org/W2038141985","https://openalex.org/W2142695913","https://openalex.org/W2109445739","https://openalex.org/W2161798622","https://openalex.org/W3126345618","https://openalex.org/W2110818895","https://openalex.org/W2803918337","https://openalex.org/W1981191225","https://openalex.org/W2109026705"],"abstract_inverted_index":{"The":[0,168,183],"minimum":[1,34,92],"labeling":[2,93],"spanning":[3,17,94],"tree":[4,18,95],"problem":[5,11,42,96],"(MLSTP)":[6],"is":[7,39,196],"a":[8,16,20,33,84,100,125,148],"combinatorial":[9],"optimization":[10],"that":[12,43,98,192],"consists":[13],"in":[14,19,24,102,124,131],"finding":[15],"simple":[21],"graph":[22],"G,":[23],"which":[25,103],"each":[26],"edge":[27],"has":[28],"one":[29],"label,":[30],"by":[31,46],"using":[32],"number":[35],"of":[36,60,86],"labels.":[37],"It":[38],"an":[40,110,122],"NP-hard":[41],"was":[44],"introduced":[45],"Chang":[47],"and":[48,75,143,160,177],"Leu":[49],"(Inf":[50],"Process":[51],"Lett":[52],"63(5):277\u2013282,":[53],"1997.":[54],"https://doi.org/10.1016/S0020-0190(97)00127-0).":[55],"Chen":[56],"et":[57],"al.":[58],"(Comparison":[59],"heuristics":[61],"for":[62,187],"solving":[63],"the":[64,87,90,116,158,162,166,174,188,193],"gmlst":[65],"problem,":[66],"in:":[67],"Raghavan,":[68],"Golden,":[69],"Wasil":[70],"(eds)":[71],"Telecommunications":[72],"modeling,":[73],"policy,":[74],"technology,":[76],"Springer,":[77],"Boston,":[78],"pp":[79],"191\u2013217,":[80],"2008)":[81],"subsequently":[82],"proposed":[83],"generalization":[85],"MLSTP,":[88],"called":[89],"generalized":[91],"(GMLSTP),":[97],"allows":[99],"situation":[101],"multiple":[104],"labels":[105],"can":[106,118],"be":[107,119],"assigned":[108],"to":[109,155,199],"edge.":[111],"Here,":[112],"we":[113],"show":[114,191],"how":[115],"GMLSTP":[117,159],"expressed":[120],"as":[121,135],"MLSTP":[123],"multigraph.":[126],"Both":[127],"problems":[128],"have":[129],"applications":[130],"various":[132],"areas":[133],"such":[134],"computer":[136],"network":[137,141],"design,":[138,142],"multimodal":[139],"transportation":[140],"data":[144],"compression.":[145],"We":[146],"propose":[147],"new":[149,171,180,194],"compact":[150],"binary":[151],"integer":[152],"programming":[153],"model":[154,195],"solve":[156],"exactly":[157],"analyze":[161],"polytope":[163,175,190],"associated":[164],"with":[165],"formulation.":[167],"paper":[169],"introduces":[170],"concepts,":[172],"gives":[173],"dimension,":[176],"describes":[178],"five":[179],"facet":[181],"families.":[182],"polyhedral":[184],"comparison":[185],"results":[186],"studied":[189],"theoretically":[197],"superior":[198],"current":[200],"state-of-the-art":[201],"formulations.":[202]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-06T08:25:59.206177","created_date":"2025-10-10T00:00:00"}