{"id":"https://openalex.org/W2107977163","doi":"https://doi.org/10.1137/s1052623499363256","title":"Transitive Packing: A Unifying Concept in Combinatorial Optimization","display_name":"Transitive Packing: A Unifying Concept in Combinatorial Optimization","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2107977163","doi":"https://doi.org/10.1137/s1052623499363256","mag":"2107977163"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623499363256","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623499363256","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5113493367","display_name":"Rudolf M\u00fcller","orcid":"https://orcid.org/0000-0002-4089-290X"},"institutions":[{"id":"https://openalex.org/I4210129476","display_name":"Institute of Quantitative and Technical Economics","ror":"https://ror.org/02nf1ky18","country_code":"CN","type":"facility","lineage":["https://openalex.org/I114218197","https://openalex.org/I4210129476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rudolf M\u00fcller","raw_affiliation_strings":["Quantitative Economics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Quantitative Economics","institution_ids":["https://openalex.org/I4210129476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103095757","display_name":"Andreas S. Schulz","orcid":"https://orcid.org/0000-0002-9595-459X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andreas S. Schulz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8111,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.75368462,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"2","first_page":"335","last_page":"367"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9991999864578247,"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.9979000091552734,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9969000220298767,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8018561005592346},{"id":"https://openalex.org/keywords/transitive-relation","display_name":"Transitive relation","score":0.5582526922225952},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.5202221274375916},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5097617506980896},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.5078309178352356},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46970221400260925}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8018561005592346},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.5582526922225952},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.5202221274375916},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5097617506980896},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.5078309178352356},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46970221400260925}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s1052623499363256","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623499363256","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/371dacd3-328d-406b-8975-fe95a74a3411","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/371dacd3-328d-406b-8975-fe95a74a3411","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"M\u00fcller, R J & Schulz, A S 2002, 'Transitive Packing - A Unifying concept in Combinatorial Optimization', Siam Journal on Optimization, vol. 13, pp. 335-367. https://doi.org/10.1137/S1052623499363256","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.66.6607","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.66.6607","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/schulz/www/epapers/print/ms-siopt-2002.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.86.1264","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.86.1264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://dspace.mit.edu/bitstream/1721.1/5412/1/OR-346-00.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.7200000286102295,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W1316039","https://openalex.org/W5833057","https://openalex.org/W65792763","https://openalex.org/W864504950","https://openalex.org/W1499349936","https://openalex.org/W1530753374","https://openalex.org/W1532702306","https://openalex.org/W1546862091","https://openalex.org/W1560944777","https://openalex.org/W1579527683","https://openalex.org/W1870929205","https://openalex.org/W1963547452","https://openalex.org/W1968143987","https://openalex.org/W1987163060","https://openalex.org/W1992197964","https://openalex.org/W1993052292","https://openalex.org/W1997644902","https://openalex.org/W2001341021","https://openalex.org/W2006934540","https://openalex.org/W2011805810","https://openalex.org/W2012605254","https://openalex.org/W2018145024","https://openalex.org/W2019181253","https://openalex.org/W2021320246","https://openalex.org/W2027421115","https://openalex.org/W2039086748","https://openalex.org/W2042649619","https://openalex.org/W2042708383","https://openalex.org/W2047893320","https://openalex.org/W2050470778","https://openalex.org/W2055747219","https://openalex.org/W2059909742","https://openalex.org/W2067178640","https://openalex.org/W2075339720","https://openalex.org/W2076018916","https://openalex.org/W2078992232","https://openalex.org/W2090845660","https://openalex.org/W2100440346","https://openalex.org/W2110839968","https://openalex.org/W2112660220","https://openalex.org/W2113011069","https://openalex.org/W2145243417","https://openalex.org/W2147407736","https://openalex.org/W2158907148","https://openalex.org/W2164209543","https://openalex.org/W2249755937","https://openalex.org/W2340149117","https://openalex.org/W2505968561","https://openalex.org/W2912523842","https://openalex.org/W2913132751","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W4312527695","https://openalex.org/W2361167282","https://openalex.org/W2091342995","https://openalex.org/W1528932152","https://openalex.org/W1677394555","https://openalex.org/W3007067598","https://openalex.org/W1963504579","https://openalex.org/W2359420171","https://openalex.org/W2271118953","https://openalex.org/W2058038705"],"abstract_inverted_index":{"This":[0],"paper":[1],"attempts":[2],"to":[3,33,150,159],"provide":[4],"a":[5,135],"better":[6],"understanding":[7],"of":[8,12,21,37,74,77,106,129,147],"the":[9,19,25,38,43,78,97,114,130,145],"facial":[10],"structure":[11],"polyhedra":[13],"previously":[14],"investigated":[15],"separately.":[16],"It":[17],"introduces":[18],"notion":[20],"transitive":[22,26,39,55,62,79,148],"packing":[23,27,40,80,149,153],"and":[24,60,92,154,161],"polytope.":[28],"Polytopes":[29],"that":[30],"turn":[31],"out":[32],"be":[34],"special":[35,111,125],"cases":[36],"polytope":[41],"include":[42],"node":[44],"packing,":[45],"acyclic":[46,56],"subdigraph,":[47,57],"bipartite":[48],"subgraph,":[49,51],"planar":[50],"clique":[52],"partitioning,":[53],"partition,":[54],"interval":[58],"order,":[59],"relatively":[61],"subgraph":[63],"polytopes.":[64],"We":[65],"give":[66],"cutting":[67],"plane":[68],"proofs":[69],"for":[70,109,122],"several":[71,103,110,123],"rich":[72],"classes":[73,101,105,131],"valid":[75,107],"inequalities":[76,108,121],"polytope,":[81],"thereby":[82],"introducing":[83],"generalized":[84,86,88,90,151],"cycle,":[85],"clique,":[87],"antihole,":[89],"antiweb,":[91],"odd":[93],"partition":[94],"inequalities.":[95],"On":[96],"one":[98],"hand,":[99,116],"these":[100],"subsume":[102],"known":[104],"cases;":[112],"on":[113,138],"other":[115,124],"they":[117],"yield":[118],"many":[119],"new":[120],"cases.":[126],"For":[127],"some":[128],"we":[132,143],"also":[133],"prove":[134],"lower":[136],"bound":[137],"their":[139],"Gomory\u2013Chv\u00e1tal":[140],"rank.":[141],"Finally,":[142],"relate":[144],"concept":[146],"(set)":[152],"covering,":[155],"as":[156,158],"well":[157],"balanced":[160],"ideal":[162],"matrices.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}