{"id":"https://openalex.org/W2098075313","doi":"https://doi.org/10.1007/s10107-010-0373-7","title":"On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency","display_name":"On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency","publication_year":2010,"publication_date":"2010-05-08","ids":{"openalex":"https://openalex.org/W2098075313","doi":"https://doi.org/10.1007/s10107-010-0373-7","mag":"2098075313"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-010-0373-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-010-0373-7","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/A5055693054","display_name":"Martin Skutella","orcid":"https://orcid.org/0000-0002-9814-1703"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Martin Skutella","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Sekr. MA 5\u20132, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","Technische Universit\u00e4t Berlin, Institut f\u00fcr Mathematik, Sekr. MA 5\u20132, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Sekr. MA 5\u20132, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Institut f\u00fcr Mathematik, Sekr. MA 5\u20132, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany#TAB#","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081231487","display_name":"Alexia Weber","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Alexia Weber","raw_affiliation_strings":["Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Sekr. MA 5\u20132, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","Technische Universit\u00e4t Berlin, Institut f\u00fcr Mathematik, Sekr. MA 5\u20132, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Sekr. MA 5\u20132, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]},{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Institut f\u00fcr Mathematik, Sekr. MA 5\u20132, Stra\u00dfe des 17. Juni 136, 10623, Berlin, Germany#TAB#","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055693054"],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.15920766,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"124","issue":"1-2","first_page":"441","last_page":"454"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9969000220298767,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9930999875068665,"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.9927999973297119,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8351614475250244},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.8198075890541077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7782517671585083},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.736553430557251},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.5909417271614075},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5702189207077026},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.4718211591243744},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.411077618598938},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3252902626991272},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14587143063545227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1386730670928955},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.061500757932662964}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8351614475250244},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.8198075890541077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7782517671585083},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.736553430557251},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.5909417271614075},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5702189207077026},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.4718211591243744},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.411077618598938},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3252902626991272},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14587143063545227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1386730670928955},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.061500757932662964},{"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/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10107-010-0373-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10107-010-0373-7","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.703.1443","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.703.1443","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://page.math.tu-berlin.de/%7Eskutella/MathProg10-final.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1567268701","https://openalex.org/W1963547452","https://openalex.org/W1997781543","https://openalex.org/W2002531683","https://openalex.org/W2049716158","https://openalex.org/W2135986386","https://openalex.org/W2154501376","https://openalex.org/W2160285134","https://openalex.org/W2171174546","https://openalex.org/W2619966450","https://openalex.org/W2988480584","https://openalex.org/W3127549917","https://openalex.org/W4213060883","https://openalex.org/W4231610975","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2916043681","https://openalex.org/W2896131632","https://openalex.org/W4280529077","https://openalex.org/W2391438543","https://openalex.org/W2997473813","https://openalex.org/W34983847","https://openalex.org/W4285598206","https://openalex.org/W3186549454","https://openalex.org/W1597885471","https://openalex.org/W2089808039"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}