{"id":"https://openalex.org/W2032311650","doi":"https://doi.org/10.1007/bf01581694","title":"A separation algorithm for the matchable set polytope","display_name":"A separation algorithm for the matchable set polytope","publication_year":1994,"publication_date":"1994-02-01","ids":{"openalex":"https://openalex.org/W2032311650","doi":"https://doi.org/10.1007/bf01581694","mag":"2032311650"},"language":"en","primary_location":{"id":"doi:10.1007/bf01581694","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01581694","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/A5113489094","display_name":"William H. Cunningham","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"William H. Cunningham","raw_affiliation_strings":["Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada","DEPARTMENT OF COMBINATORICS AND OPTIMIZATION; UNIVERSITY OF WATERLOO; WATERLOO CANADA N2L 3G1"],"affiliations":[{"raw_affiliation_string":"Department of Combinatorics and Optimization, University of Waterloo, N2L 3G1, Waterloo, Ontario, Canada","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"DEPARTMENT OF COMBINATORICS AND OPTIMIZATION; UNIVERSITY OF WATERLOO; WATERLOO CANADA N2L 3G1","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069818602","display_name":"Jan Green\u2010Kr\u00f3tki","orcid":null},"institutions":[{"id":"https://openalex.org/I142476485","display_name":"\u00c9cole Polytechnique","ror":"https://ror.org/05hy3tk52","country_code":"FR","type":"education","lineage":["https://openalex.org/I142476485","https://openalex.org/I4210145102"]},{"id":"https://openalex.org/I4210129850","display_name":"D\u00e9l\u00e9gation Paris 6","ror":"https://ror.org/03rt48n94","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I4210129850"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jan Green-Kr\u00f3tki","raw_affiliation_strings":["19, rue de l'Ecole Polytechnique, 75005, Paris, France",", Paris, France 75005#TAB#"],"affiliations":[{"raw_affiliation_string":"19, rue de l'Ecole Polytechnique, 75005, Paris, France","institution_ids":["https://openalex.org/I142476485"]},{"raw_affiliation_string":", Paris, France 75005#TAB#","institution_ids":["https://openalex.org/I4210129850"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5113489094"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.9272,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.74071016,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"65","issue":"1-3","first_page":"139","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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.9847000241279602,"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/mathematics","display_name":"Mathematics","score":0.8425763845443726},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.808539628982544},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7945356965065002},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7693871259689331},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7263436913490295},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.5686939358711243},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.5467303395271301},{"id":"https://openalex.org/keywords/birkhoff-polytope","display_name":"Birkhoff polytope","score":0.473242849111557},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46944332122802734},{"id":"https://openalex.org/keywords/separation","display_name":"Separation (statistics)","score":0.461336225271225},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44080492854118347},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.425708532333374},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38947761058807373},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.38457781076431274},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.340175598859787},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2999756336212158},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.2565003037452698},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.18561580777168274},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.0824970006942749},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0768599808216095}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8425763845443726},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.808539628982544},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7945356965065002},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7693871259689331},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7263436913490295},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.5686939358711243},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.5467303395271301},{"id":"https://openalex.org/C206304794","wikidata":"https://www.wikidata.org/wiki/Q4916482","display_name":"Birkhoff polytope","level":5,"score":0.473242849111557},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46944332122802734},{"id":"https://openalex.org/C2776061190","wikidata":"https://www.wikidata.org/wiki/Q7451805","display_name":"Separation (statistics)","level":2,"score":0.461336225271225},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44080492854118347},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.425708532333374},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38947761058807373},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.38457781076431274},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.340175598859787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2999756336212158},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.2565003037452698},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.18561580777168274},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0824970006942749},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0768599808216095},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/bf01581694","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01581694","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:hdl:10068/227927","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/227927","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"I - Miscellaneous"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W37994088","https://openalex.org/W1843974934","https://openalex.org/W1965217041","https://openalex.org/W2012329067","https://openalex.org/W2029228217","https://openalex.org/W2074520661","https://openalex.org/W2077213914","https://openalex.org/W2090960684","https://openalex.org/W2123805664","https://openalex.org/W2327315803","https://openalex.org/W3034528871","https://openalex.org/W4232540105","https://openalex.org/W6701294544"],"related_works":["https://openalex.org/W1968764954","https://openalex.org/W4288640859","https://openalex.org/W2045645047","https://openalex.org/W2910483300","https://openalex.org/W3204036718","https://openalex.org/W1975814637","https://openalex.org/W2300145982","https://openalex.org/W2578380588","https://openalex.org/W3105871490","https://openalex.org/W1964049108"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}