{"id":"https://openalex.org/W2121250153","doi":"https://doi.org/10.1007/s10878-011-9426-y","title":"The three-dimensional matching problem in Kalmanson matrices","display_name":"The three-dimensional matching problem in Kalmanson matrices","publication_year":2011,"publication_date":"2011-11-16","ids":{"openalex":"https://openalex.org/W2121250153","doi":"https://doi.org/10.1007/s10878-011-9426-y","mag":"2121250153"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-011-9426-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-011-9426-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-011-9426-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10878-011-9426-y.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082401107","display_name":"Sergey Polyakovskiy","orcid":"https://orcid.org/0000-0001-9489-1972"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Sergey Polyakovskiy","raw_affiliation_strings":["Operations Research Group, Katholieke Universiteit Leuven, Naamsestraat 69, 3000, Leuven, Belgium","Operations Research Group, Katholieke Universiteit Leuven, Leuven, Belgium 3000#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Group, Katholieke Universiteit Leuven, Naamsestraat 69, 3000, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Operations Research Group, Katholieke Universiteit Leuven, Leuven, Belgium 3000#TAB#","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052356379","display_name":"Frits Spieksma","orcid":"https://orcid.org/0000-0002-2547-3782"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Frits C. R. Spieksma","raw_affiliation_strings":["Operations Research Group, Katholieke Universiteit Leuven, Naamsestraat 69, 3000, Leuven, Belgium","Operations Research Group, Katholieke Universiteit Leuven, Leuven, Belgium 3000#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Operations Research Group, Katholieke Universiteit Leuven, Naamsestraat 69, 3000, Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Operations Research Group, Katholieke Universiteit Leuven, Leuven, Belgium 3000#TAB#","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080746477","display_name":"Gerhard J. Woeginger","orcid":"https://orcid.org/0000-0001-8816-2693"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Gerhard J. Woeginger","raw_affiliation_strings":["Department of Mathematics, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","Department of Mathematics, TU Eindhoven, Eindhoven, The Netherlands 5600 MB#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Department of Mathematics, TU Eindhoven, Eindhoven, The Netherlands 5600 MB#TAB#","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5080746477"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":1.8287,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.86548015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"26","issue":"1","first_page":"1","last_page":"9"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9962000250816345,"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.9962000250816345,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9786999821662903,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9757000207901001,"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/theory-of-computation","display_name":"Theory of computation","score":0.7892706394195557},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.686448872089386},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.6298590898513794},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5865656137466431},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5658727884292603},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5579638481140137},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.540496826171875},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5385231971740723},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5202325582504272},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48712635040283203},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.4161667227745056},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40209540724754333},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38271939754486084},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3619072437286377},{"id":"https://openalex.org/keywords/blossom-algorithm","display_name":"Blossom algorithm","score":0.27603352069854736}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7892706394195557},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.686448872089386},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.6298590898513794},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5865656137466431},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5658727884292603},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5579638481140137},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.540496826171875},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5385231971740723},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5202325582504272},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48712635040283203},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.4161667227745056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40209540724754333},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38271939754486084},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3619072437286377},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.27603352069854736},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1007/s10878-011-9426-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-011-9426-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-011-9426-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/d34d6094-4b01-4a06-ac7c-6d2c063e0f1c","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/d34d6094-4b01-4a06-ac7c-6d2c063e0f1c","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Polyakovskiy, S, Spieksma, F C R & Woeginger, G J 2013, 'The three-dimensional matching problem in Kalmanson matrices', Journal of Combinatorial Optimization, vol. 26, no. 1, pp. 1-9. https://doi.org/10.1007/s10878-011-9426-y","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:725019","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=725019","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1382-6905","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:RePEc:spr:jcomop:v:26:y:2013:i:1:d:10.1007_s10878-011-9426-y","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-011-9426-y","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:digital.library.adelaide.edu.au:2440/87190","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/87190","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dx.doi.org/10.1007/s10878-011-9426-y","raw_type":"Journal article"},{"id":"pmh:oai:dro.deakin.edu.au:DU:30108039","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401102","display_name":"Own your potential (DEAKIN)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149704539","host_organization_name":"Deakin University","host_organization_lineage":["https://openalex.org/I149704539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:figshare.com:article/20813671","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/The_three-dimensional_matching_problem_in_Kalmanson_matrices/20813671","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:library.tue.nl:725019","is_oa":false,"landing_page_url":"http://repository.tue.nl/725019","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1382-6905","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/347876","is_oa":false,"landing_page_url":"https://lirias.kuleuven.be/bitstream/123456789/347876/2/Thethreedimensional.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, vol. 26 (1), (1-9)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/d34d6094-4b01-4a06-ac7c-6d2c063e0f1c","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/d34d6094-4b01-4a06-ac7c-6d2c063e0f1c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Combinatorial Optimization, 26(1), 1 - 9. Springer","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10878-011-9426-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10878-011-9426-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10878-011-9426-y.pdf","source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Combinatorial Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2121250153.pdf","grobid_xml":"https://content.openalex.org/works/W2121250153.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1583471982","https://openalex.org/W1975442866","https://openalex.org/W1998867815","https://openalex.org/W2011039300","https://openalex.org/W2016168023","https://openalex.org/W2065841482","https://openalex.org/W2096497693","https://openalex.org/W2118189650","https://openalex.org/W2119735681","https://openalex.org/W2159736064","https://openalex.org/W2170954130","https://openalex.org/W2401610261","https://openalex.org/W2476096155","https://openalex.org/W3149604617","https://openalex.org/W4285719527","https://openalex.org/W6635069749"],"related_works":["https://openalex.org/W4250775169","https://openalex.org/W2947806671","https://openalex.org/W2390878257","https://openalex.org/W2144260821","https://openalex.org/W2005965064","https://openalex.org/W1973015798","https://openalex.org/W2056393887","https://openalex.org/W2032920297","https://openalex.org/W2151412766","https://openalex.org/W122605929"],"abstract_inverted_index":{"We":[0],"investigate":[1],"the":[2,10,15,27,44,61],"computational":[3],"complexity":[4],"of":[5,9,60],"several":[6],"special":[7],"cases":[8],"three-dimensional":[11],"matching":[12,55],"problem":[13],"where":[14],"costs":[16],"are":[17],"decomposable":[18],"and":[19],"determined":[20],"by":[21],"a":[22,52],"so-called":[23],"Kalmanson":[24,63],"matrix.":[25],"For":[26,43],"minimization":[28],"version":[29],"we":[30,47],"develop":[31],"an":[32],"efficient":[33],"polynomial":[34],"time":[35],"algorithm":[36],"that":[37,49],"is":[38,51,58],"based":[39],"on":[40],"dynamic":[41],"programming.":[42],"maximization":[45],"version,":[46],"show":[48],"there":[50],"universally":[53],"optimal":[54],"(whose":[56],"structure":[57],"independent":[59],"particular":[62],"matrix).":[64]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2025-10-10T00:00:00"}