{"id":"https://openalex.org/W2920849150","doi":"https://doi.org/10.1007/pl00011434","title":"Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut","display_name":"Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut","publication_year":2001,"publication_date":"2001-05-01","ids":{"openalex":"https://openalex.org/W2920849150","doi":"https://doi.org/10.1007/pl00011434","mag":"2920849150"},"language":"en","primary_location":{"id":"doi:10.1007/pl00011434","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00011434","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5088693799","display_name":"Eduardo Uchoa","orcid":"https://orcid.org/0000-0002-8687-2613"},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontifical Catholic University of Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Eduardo Uchoa","raw_affiliation_strings":["Departamento de Inform\u00e1tica \u2013 Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rua Marqu\u00eas de S\u00e3o Vicente, 225, Rio de Janeiro RJ, 22453-900, Brasil, e-mail: {uchoa,poggi}@inf.puc-rio.br, , , , , , BR","Departamento de Inform\u00e1tica \u2013 Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rua Marqu\u00eas de S\u00e3o Vicente, 225, Rio de Janeiro RJ, 22453-900, Brasil, e-mail: {uchoa,poggi}@inf.puc-rio.br, , BR"],"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica \u2013 Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rua Marqu\u00eas de S\u00e3o Vicente, 225, Rio de Janeiro RJ, 22453-900, Brasil, e-mail: {uchoa,poggi}@inf.puc-rio.br, , , , , , BR","institution_ids":["https://openalex.org/I2699952"]},{"raw_affiliation_string":"Departamento de Inform\u00e1tica \u2013 Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rua Marqu\u00eas de S\u00e3o Vicente, 225, Rio de Janeiro RJ, 22453-900, Brasil, e-mail: {uchoa,poggi}@inf.puc-rio.br, , BR","institution_ids":["https://openalex.org/I2699952"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004898232","display_name":"Marcus Poggi de Arag\u00e3o","orcid":null},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontifical Catholic University of Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Marcus Poggi de Arag\u00e3o","raw_affiliation_strings":["Departamento de Inform\u00e1tica \u2013 Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rua Marqu\u00eas de S\u00e3o Vicente, 225, Rio de Janeiro RJ, 22453-900, Brasil, e-mail: {uchoa,poggi}@inf.puc-rio.br, , , , , , BR","Departamento de Inform\u00e1tica \u2013 Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rua Marqu\u00eas de S\u00e3o Vicente, 225, Rio de Janeiro RJ, 22453-900, Brasil, e-mail: {uchoa,poggi}@inf.puc-rio.br, , BR"],"affiliations":[{"raw_affiliation_string":"Departamento de Inform\u00e1tica \u2013 Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rua Marqu\u00eas de S\u00e3o Vicente, 225, Rio de Janeiro RJ, 22453-900, Brasil, e-mail: {uchoa,poggi}@inf.puc-rio.br, , , , , , BR","institution_ids":["https://openalex.org/I2699952"]},{"raw_affiliation_string":"Departamento de Inform\u00e1tica \u2013 Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rua Marqu\u00eas de S\u00e3o Vicente, 225, Rio de Janeiro RJ, 22453-900, Brasil, e-mail: {uchoa,poggi}@inf.puc-rio.br, , BR","institution_ids":["https://openalex.org/I2699952"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088693799"],"corresponding_institution_ids":["https://openalex.org/I2699952"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.4355,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73172502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"90","issue":"3","first_page":"537","last_page":"557"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/steiner-tree-problem","display_name":"Steiner tree problem","score":0.8902668952941895},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.8310838937759399},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7802006602287292},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7254290580749512},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7003411054611206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.675165057182312},{"id":"https://openalex.org/keywords/branch-and-cut","display_name":"Branch and cut","score":0.5055522918701172},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.46934664249420166},{"id":"https://openalex.org/keywords/circle-packing","display_name":"Circle packing","score":0.41332313418388367},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4085371494293213},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32160770893096924},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.2691139578819275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25280553102493286}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.8902668952941895},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8310838937759399},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7802006602287292},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7254290580749512},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7003411054611206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.675165057182312},{"id":"https://openalex.org/C50797617","wikidata":"https://www.wikidata.org/wiki/Q498566","display_name":"Branch and cut","level":3,"score":0.5055522918701172},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.46934664249420166},{"id":"https://openalex.org/C123115066","wikidata":"https://www.wikidata.org/wiki/Q5121501","display_name":"Circle packing","level":2,"score":0.41332313418388367},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4085371494293213},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32160770893096924},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.2691139578819275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25280553102493286}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00011434","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00011434","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1968143987","https://openalex.org/W1976285925","https://openalex.org/W1986798241","https://openalex.org/W1999578543","https://openalex.org/W2011039300","https://openalex.org/W2066200990","https://openalex.org/W2068595367","https://openalex.org/W2082591111","https://openalex.org/W2155239253","https://openalex.org/W2158598102"],"related_works":["https://openalex.org/W3015712661","https://openalex.org/W4251859436","https://openalex.org/W2568571446","https://openalex.org/W2143061299","https://openalex.org/W4383104139","https://openalex.org/W2174352574","https://openalex.org/W2057845274","https://openalex.org/W854593937","https://openalex.org/W2295287556","https://openalex.org/W1968206323"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}