{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T06:29:03Z","timestamp":1751869743620},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540613107"},{"type":"electronic","value":"9783540684534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61310-2_32","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:28:14Z","timestamp":1330291694000},"page":"430-444","source":"Crossref","is-referenced-by-count":4,"title":["Transitive packing"],"prefix":"10.1007","author":[{"given":"Rudolf","family":"M\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas S.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/moor.10.2.340","volume":"10","author":"F. Barahona","year":"1985","unstructured":"F. Barahona, M. Gr\u00f6tschel, and A. R. Mahjoub. Facets of the bipartite subgraph polytope. Mathematics of Operations Research, 10:340\u2013358, 1985.","journal-title":"Mathematics of Operations Research"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"F. Barahona and A. R. Mahjoub. On the cut polytope. Mathematical Programming, 36:157\u2013173, 1986.","journal-title":"Mathematical Programming"},{"key":"32_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01582278","volume":"43","author":"E. Balas","year":"1989","unstructured":"E. Balas and S. M. Ng. On the set covering polytope: I. AH the facets with coefficients in {0,1, 2}. Mathematical Programming, 43:57\u201369, 1989.","journal-title":"Mathematical Programming"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01589093","volume":"45","author":"E. Balas","year":"1989","unstructured":"E. Balas and S. M. Ng. On the set covering polytope: II. Lifting the facets with coefficients in {0,1,2}. Mathematical Programming, 45:1\u201320, 1989.","journal-title":"Mathematical Programming"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas and M. W. Padberg. Set partitioning: A survey. SIAM Review, 18:710\u2013760, 1976.","journal-title":"SIAM Review"},{"key":"32_CR6","volume-title":"Balanced 0, \u00b11 matrices, bicoloring and total dual integrality","author":"M. Conforti","year":"1992","unstructured":"M. Conforti and G. Cornu\u00e9jols. Balanced 0, \u00b11 matrices, bicoloring and total dual integrality. Preprint, Carnegie Mellon University, Pittsburgh, USA, 1992."},{"key":"32_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0024-3795(89)90476-X","volume":"114\/115","author":"V. Chv\u00e1tal","year":"1989","unstructured":"V. Chv\u00e1tal, W. Cook, and M. Hartmann. On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications, 114\/115:455\u2013499, 1989.","journal-title":"Linear Algebra and its Applications"},{"key":"32_CR8","volume-title":"0, 1\/2-Chv\u00e1tal-Gomory cuts. Technical Report, DEIS","author":"A. Caprara","year":"1993","unstructured":"A. Caprara and M. Fischetti. 0, 1\/2-Chv\u00e1tal-Gomory cuts. Technical Report, DEIS, University of Bologna, Bologna, Italy, 1993, revised 1995."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"V. Chv\u00e1tal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4:305\u2013337, 1973.","journal-title":"Discrete Mathematics"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S. Chopra","year":"1993","unstructured":"S. Chopra and M. R. Rao. The partition problem. Mathematical Programming, 59:87\u2013115, 1993.","journal-title":"Mathematical Programming"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01582277","volume":"43","author":"G. Cornu\u00e9jols","year":"1989","unstructured":"G. Cornu\u00e9jols and A. Sassano. On the 0,1 facets of the set covering polytope. Mathematical Programming, 43:45\u201355, 1989.","journal-title":"Mathematical Programming"},{"key":"32_CR12","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1090\/S0002-9904-1962-10791-5","volume":"68","author":"J. Edmonds","year":"1962","unstructured":"J. Edmonds. Covers and packings in a family of sets. Bulletin of the American Mathematical Society, 68:494\u2013499, 1962.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"32_CR13","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1287\/moor.12.3.451","volume":"12","author":"R. Euler","year":"1987","unstructured":"R. Euler, M. J\u00fcnger, and G. Reinelt. Generalizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra. Mathematics of Operations Research, 12:451\u2013462, 1987.","journal-title":"Mathematics of Operations Research"},{"key":"32_CR14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/978-94-009-5315-4_7","volume-title":"Graphs and Order","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger, and G. Reinelt. Acyclic subdigraphs and linear orderings: Polytopes, facets, and cutting plane algorithms. In I. Rival, editor, Graphs and Order, pages 217\u2013266. D. Reidel Publishing Company, Dordrecht, 1985."},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger, and G. Reinelt. On the acyclic subgraph polytope. Mathematical Programming, 33:28\u201342, 1985.","journal-title":"Mathematical Programming"},{"key":"32_CR16","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169\u2013197, 1981. (Corrigendum: 4 (1984), 291\u2013295).","journal-title":"Combinatorica"},{"key":"32_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Berlin, 1988."},{"key":"32_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M. Gr\u00f6tschel","year":"1989","unstructured":"M. Gr\u00f6tschel and Y. Wakabayashi. A cutting plane algorithm for a clustering problem. Mathematical Progamming, 45:59\u201396, 1989.","journal-title":"Mathematical Progamming"},{"key":"32_CR19","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"M. Gr\u00f6tschel and Y. Wakabayashi. Facets of the clique partitioning polytope. Mathematical Programming. 47:367\u2013388, 1990.","journal-title":"Mathematical Programming"},{"key":"32_CR20","unstructured":"M. J\u00fcnger and P. Mutzel. Solving the maximum weight planar subgraph. In G. Rinaldi and L. A, Wolsey, editors, Integer Programming and Combinatorial Optimization, pages 479\u2013492, 1993. Proceedings of the 3rd International IPCO Conference."},{"key":"32_CR21","volume-title":"Polyhedral Combinatorics and the Acyclic Subdigraph Problem, volume 7 of Research and Expositions in Mathematics","author":"M. J\u00fcnger","year":"1985","unstructured":"M. J\u00fcnger. Polyhedral Combinatorics and the Acyclic Subdigraph Problem, volume 7 of Research and Expositions in Mathematics. Heldermann Verlag Berlin, 1985."},{"key":"32_CR22","first-page":"283","volume-title":"Combinatorial Mathematics","author":"B. Korte","year":"1989","unstructured":"B. Korte and L. Lov\u00e1sz. Polyhedral results for antimatroids. In G. S. Bloom, R. L. Graham, and J. Malkevitch, editors, Combinatorial Mathematics, pages 283\u2013295. Academy of Sciences, New York, 1989. Proceedings of the Third International Conference."},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01589098","volume":"45","author":"M. Laureat","year":"1989","unstructured":"M. Laureat. A generalization of antiwebs to independence systems and their canonical facets. Mathematical Programming, 45:97\u2013108, 1989.","journal-title":"Mathematical Programming"},{"key":"32_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/3-540-59408-6_41","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. M\u00fcller","year":"1995","unstructured":"R. M\u00fcller and A. S. Schulz. The interval order polytope of a digraph. In E. Balas and J. Clausen, editors, Integer Programming and Combinatorial Optimization, number 920 in Lecture Notes in Computer Science, pages 50\u201364. Springer, Berlin, 1995. Proceedings of the 4th International IPCO Conference."},{"key":"32_CR25","volume-title":"Transitive packing","author":"R. M\u00fcller","year":"1996","unstructured":"R. M\u00fcller and A. S. Schulz. Transitive packing. Preprint, Department of Mathematics, Technical University of Berlin, Berlin, Germany, 1996."},{"key":"32_CR26","unstructured":"R. M\u00fcller. On the transitive acyclic subdigraph polytope. In G. Rinaldi and L. A. Wolsey, editors, Integer Programming and Combinatorial Optimization, pages 463\u2013477, 1993. Proceedings of the 3rd International IPCO Conference."},{"key":"32_CR27","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01589100","volume":"45","author":"P. Nobili","year":"1989","unstructured":"P. Nobili and A. Sassano. Facets and lifting procedures for the set covering polytope. Mathematical Programming, 45:111\u2013137, 1989.","journal-title":"Mathematical Programming"},{"key":"32_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1007\/3-540-59408-6_63","volume-title":"Integer Programming and Combinatorial Optimization","author":"P. Nobili","year":"1995","unstructured":"P. Nobili and A. Sassano. (0, \u00b11) ideal matrices. In E. Balas and J. Clausen, editors, Integer Programming and Combinatorial Optimization, number 920 in Lecture Notes in Computer Science, pages 344\u2013359. Springer, Berlin, 1995. Proceedings of the 4th International IPCO Conference."},{"key":"32_CR29","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BF01580222","volume":"6","author":"G. L. Nemhauser","year":"1974","unstructured":"G. L. Nemhauser and L. E. Trotter Jr. Properties of vertex packing and independence system polyhedra. Mathematical Programming, 6:48\u201361, 1974.","journal-title":"Mathematical Programming"},{"key":"32_CR30","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. L. Nemhauser","year":"1988","unstructured":"G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, New York, 1988."},{"key":"32_CR31","volume-title":"The clique partitioning polytope: Facets","author":"M. Oosten","year":"1995","unstructured":"M. Oosten, J. H. G. C. Rutten, and F. C. R. Spieksma. The clique partitioning polytope: Facets. Department of Mathematics, University of Limburg, Maastricht, The Netherlands, 1995."},{"key":"32_CR32","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M. W. Padberg","year":"1973","unstructured":"M. W. Padberg. On the facial structure of set packing polyhedra. Mathematical Programming, 5:199\u2013215, 1973.","journal-title":"Mathematical Programming"},{"key":"32_CR33","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/S0167-5060(08)70831-8","volume":"4","author":"M. W. Padberg","year":"1979","unstructured":"M. W. Padberg. Covering, packing and knapsack problems. Annals of Discrete Mathematics, 4:265\u2013287, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"32_CR34","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01587087","volume":"44","author":"A. Sassano","year":"1989","unstructured":"A. Sassano. On the facial structure of the set covering polytope. Mathematical Programming, 44:181\u2013202, 1989.","journal-title":"Mathematical Programming"},{"key":"32_CR35","unstructured":"D. F. Shallcross and R. G. Bland. On the polyhedral structure of relatively transitive subgraphs. Technical report, Cornell University, Ithaca, NY."},{"key":"32_CR36","first-page":"291","volume-title":"Combinatorics '79, Part II, volume 9 of 'Annals of Discrete Mathematics","author":"A. Schrijver","year":"1980","unstructured":"A. Schrijver. On cutting planes. In M. Deza and I. G. Rosenberg, editors, Combinatorics '79, Part II, volume 9 of 'Annals of Discrete Mathematics, pages 291\u2013296. North-Holland, Amsterdam, 1980."},{"key":"32_CR37","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, Chichester, 1986."},{"key":"32_CR38","volume-title":"PhD thesis","author":"A. S. Schulz","year":"1995","unstructured":"A. S. Schulz. Polytopes and Scheduling. PhD thesis, Technical University of Berlin, Berlin, Germany, 1995."},{"key":"32_CR39","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0012-365X(75)90077-1","volume":"12","author":"L. E. Trotter Jr.","year":"1975","unstructured":"L. E. Trotter Jr. A class of facet producing graphs for vertex packing polyhedra. Discrete Mathematics, 12:373\u2013388, 1975.","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61310-2_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:24:25Z","timestamp":1713633865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61310-2_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540613107","9783540684534"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/3-540-61310-2_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}