{"id":"https://openalex.org/W2034992634","doi":"https://doi.org/10.1007/pl00009302","title":"A Polyhedral Approach for a Constrained Matching Problem","display_name":"A Polyhedral Approach for a Constrained Matching Problem","publication_year":1997,"publication_date":"1997-06-01","ids":{"openalex":"https://openalex.org/W2034992634","doi":"https://doi.org/10.1007/pl00009302","mag":"2034992634"},"language":"en","primary_location":{"id":"doi:10.1007/pl00009302","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009302","pdf_url":null,"source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","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/A5039425292","display_name":"A. Hefner","orcid":null},"institutions":[{"id":"https://openalex.org/I1325886976","display_name":"Siemens (Germany)","ror":"https://ror.org/059mq0909","country_code":"DE","type":"company","lineage":["https://openalex.org/I1325886976"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"A. Hefner","raw_affiliation_strings":["Corporate Research and Development (ZFE T SE 1), Siemens AG,  81730 M\u00fcnchen, Germany  Andreas.Hefner@zfe.siemens.de, , , , , , DE","Corporate Research and Development (ZFE T SE 1), Siemens AG, 81730 M\u00fcnchen, Germany Andreas.Hefner@zfe.siemens.de, DE"],"affiliations":[{"raw_affiliation_string":"Corporate Research and Development (ZFE T SE 1), Siemens AG,  81730 M\u00fcnchen, Germany  Andreas.Hefner@zfe.siemens.de, , , , , , DE","institution_ids":["https://openalex.org/I1325886976"]},{"raw_affiliation_string":"Corporate Research and Development (ZFE T SE 1), Siemens AG, 81730 M\u00fcnchen, Germany Andreas.Hefner@zfe.siemens.de, DE","institution_ids":["https://openalex.org/I1325886976"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066056236","display_name":"Peter Kleinschmidt","orcid":"https://orcid.org/0000-0001-8812-9260"},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"P. Kleinschmidt","raw_affiliation_strings":["Department of Business Administration and Economics, University of Passau, Innstra\u00df e 29, 94032 Passau, Germany kleinsch@winf.uni-passau.de, , , , , , DE","Department of Business Administration and Economics, University of Passau, Innstra\u00df e 29, 94032 Passau, Germany kleinsch@winf.uni-passau.de, , DE"],"affiliations":[{"raw_affiliation_string":"Department of Business Administration and Economics, University of Passau, Innstra\u00df e 29, 94032 Passau, Germany kleinsch@winf.uni-passau.de, , , , , , DE","institution_ids":["https://openalex.org/I186354981"]},{"raw_affiliation_string":"Department of Business Administration and Economics, University of Passau, Innstra\u00df e 29, 94032 Passau, Germany kleinsch@winf.uni-passau.de, , DE","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5039425292"],"corresponding_institution_ids":["https://openalex.org/I1325886976"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.19642086,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"4","first_page":"429","last_page":"437"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9557999968528748,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9557999968528748,"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/mathematics","display_name":"Mathematics","score":0.7331538200378418},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7004063725471497},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6922812461853027},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5457018613815308},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.5310172438621521},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.49105048179626465},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.45073452591896057},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4173396825790405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4077916443347931},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.21405649185180664},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09909653663635254}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7331538200378418},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7004063725471497},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6922812461853027},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5457018613815308},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.5310172438621521},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.49105048179626465},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.45073452591896057},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4173396825790405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4077916443347931},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.21405649185180664},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09909653663635254},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/pl00009302","is_oa":false,"landing_page_url":"https://doi.org/10.1007/pl00009302","pdf_url":null,"source":{"id":"https://openalex.org/S103671469","display_name":"Discrete & Computational Geometry","issn_l":"0179-5376","issn":["0179-5376","1432-0444"],"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":"Discrete & Computational Geometry","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":3,"referenced_works":["https://openalex.org/W2004108795","https://openalex.org/W2059608229","https://openalex.org/W2340149117"],"related_works":["https://openalex.org/W2916043681","https://openalex.org/W4280529077","https://openalex.org/W2391438543","https://openalex.org/W4205506869","https://openalex.org/W1497213067","https://openalex.org/W2113011069","https://openalex.org/W1513565830","https://openalex.org/W3012113686","https://openalex.org/W1996239617","https://openalex.org/W3197304203"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}