{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:27:47Z","timestamp":1751282867514},"publisher-location":"Berlin, Heidelberg","reference-count":107,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642688768"},{"type":"electronic","value":"9783642688744"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/978-3-642-68874-4_13","type":"book-chapter","created":{"date-parts":[[2011,10,25]],"date-time":"2011-10-25T17:36:08Z","timestamp":1319564168000},"page":"312-345","source":"Crossref","is-referenced-by-count":21,"title":["Polyhedral Combinatorics"],"prefix":"10.1007","author":[{"given":"W. R.","family":"Pulleyblank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"A. Bachem and M. Gr\u00f6tschel, \u201cNew aspects of polyhedral theory\u201d, in B. Korte (ed.) Modern Applied Mathematics - Optimization and Operations Research, North Holland (1982) 51\u2013106. (1979) A. Bachem and R. Kannan, \u201cApplications of polynomial Smith normal form calculations\u201d in L. Collatz et al. (eds.) Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen, Band 2. Birkh\u00e4user Verlag Basel (1979) 195\u2013215."},{"key":"13_CR2","first-page":"19","volume":"32","author":"A Bachem","year":"1979","unstructured":"A. Bachem and R. von Randow, \u201cInteger theorems of Farkas lemma type\u201d, Operations Verfahren Vol. 32 (1979) 19\u201328.","journal-title":"Operations Verfahren"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01584228","volume":"21","author":"E Balas","year":"1981","unstructured":"E. Balas and N. Christofides, \u201cA restricted Lagrangian approach to the travelling salesman problem\u201d, Mathematical Programming 21 (1981) 19\u201346.","journal-title":"Mathematical Programming"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1287\/opre.20.6.1152","volume":"20","author":"E Balas","year":"1972","unstructured":"E. Balas and M. Padberg, \u201cOn the set covering problem\u201d, Operations Research 20 (1972) 1152\u20131161.","journal-title":"Operations Research"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(72)90002-0","volume":"13","author":"M Balinski","year":"1972","unstructured":"M. Balinski, \u201cEstablishing the matching polytope\u201d, Journal of Combinatorial Theory B13 (1972) 1\u201313.","journal-title":"Journal of Combinatorial Theory"},{"key":"13_CR6","first-page":"258","volume":"247","author":"C Berge","year":"1958","unstructured":"C. Berge, \u201cSur le couplage maximum d\u2019un graphe\u201d, C. R. Acad\u00e9mie des Sciences, Paris 247 (1958) 258\u2013259.","journal-title":"C. R. Acad\u00e9mie des Sciences, Paris"},{"key":"13_CR7","first-page":"147","volume":"5","author":"G","year":"1946","unstructured":"G. Birkhoff, \u201cObservaciones sobre el algebra lineal\u201d, Rev. Univ. Nac. Turcuman (Ser. A) 5 (1946) 147\u2013148.","journal-title":"Rev. Univ. Nac. Turcuman (Ser. A)"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-0208(08)73456-X","volume-title":"Studies on Graphs and Discrete Programming, Annals of Discrete Math. 11","author":"R Chandresekaran","year":"1981","unstructured":"R. Chandresekaran, \u201cPolynomial algorithms for totally dual integral systems and extensions\u201d, in P. Hansen (ed.) Studies on Graphs and Discrete Programming, Annals of Discrete Math. 11 (1981) 39\u201351."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/BF01580109","volume":"5","author":"V Chv\u00e2tal","year":"1973","unstructured":"V. Chv\u00e2tal, \u201cEdmonds polytopes and weakly hamiltonian graphs\u201d, Mathematical Programming 5 (1973) 29\u201340.","journal-title":"Mathematical Programming"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal, \u201cOn certain polytopes associated with graphs\u201d, Journal of Combinatorial Theory B18 (1975) 138\u2013154.","journal-title":"Journal of Combinatorial Theory"},{"key":"13_CR11","unstructured":"W. Cook, \u201cA minimal totally dual integral defining system for the b-matching polyhedron\u201d, Research report CORR 81-15, University of Waterloo (1981), to appear in SIAM Journal on Algebraic and Discrete Methods."},{"key":"13_CR12","unstructured":"W. Cook, \u201cOperations that preserve total dual integrality\u201d, Research report CORR 82\u201334, University of Waterloo (1982), to appear in Operations Research Letters."},{"key":"13_CR13","first-page":"27","volume":"16","author":"G Cornu\u00e9jols","year":"1982","unstructured":"G. Cornu\u00e9jols and W. R. Pulleyblank, \u201cThe travelling salesman polytope and {0, 2}-matching\u201d, Annals of Discrete Mathematics 16 (1982) 27\u201355.","journal-title":"Annals of Discrete Mathematics"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"HP Crowder","year":"1980","unstructured":"H. P. Crowder and M. W. Padberg, \u201cSolving large scale symmetric travelling salesman problems to optimality\u201d, Management Science 26 (1980) 495\u2013509.","journal-title":"Management Science"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"WH Cunningham","year":"1979","unstructured":"W. H. Cunningham, \u201cTheoretical properties of the network simplex method\u201d, Mathematics of Operations Research 4 (1979) 196\u2013208.","journal-title":"Mathematics of Operations Research"},{"key":"13_CR16","unstructured":"W. H. Cunningham, \u201cTesting membership in matroid polyhedra\u201d, Research Report WP81207-OR, Inst, f\u00fcr Operations Research, Universit\u00e4t Bonn."},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BFb0121194","volume":"8","author":"WH Cunningham","year":"1978","unstructured":"W. H. Cunningham and A. B. Marsh III, \u201cA primal algorithm for optimum matching\u201d, Mathematical Programming Study 8 (1978) 50\u201372.","journal-title":"Mathematical Programming Study"},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"G. B. Dantzig, D. R. Fulkerson and S. M. Johnson, \u201cSolution of a large-scale travelling salesman problem\u201d, Operations Research 2 (1954) 393\u2013410.","journal-title":"Operations Research"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cPaths, trees and flowers\u201d, Canadian Journal of Mathematics 17 (1965) 449\u2013469.","journal-title":"Canadian Journal of Mathematics"},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0-1 vertices\u201d, Journal of Research of the National Bureau of Standards 69 B (1965) 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"13_CR21","first-page":"233","volume-title":"Mathematics of the Decision Sciences, AMS (1968) 346\u2013361, reprinted from Journal of Research of the National Bureau of Standards 71 B","author":"J Edmonds","year":"1967","unstructured":"J. Edmonds, \u201cOptimum branchings\u201d, in G. B. Dantzig and P. Veinott (eds.) Mathematics of the Decision Sciences, AMS (1968) 346\u2013361, reprinted from Journal of Research of the National Bureau of Standards 71 B (1967) 233\u2013240."},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF01584082","volume":"1","author":"J Edmonds","year":"1971","unstructured":"J. Edmonds, \u201cMatroids and the greedy algorithm\u201d, Mathematical Programming 1 (1971) 127\u2013136.","journal-title":"Mathematical Programming"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0167-5060(08)70817-3","volume":"4","author":"J Edmonds","year":"1979","unstructured":"J. Edmonds, \u201cMatroid intersection\u201d, Annals of Discrete Mathematics 4 (1979) 39\u201349.","journal-title":"Annals of Discrete Mathematics"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J Edmonds","year":"1977","unstructured":"J. Edmonds and R. Giles, \u201cA min-max relation for submodular functions on graphs\u201d, Annals of Discrete Mathematics 1 (1977) 185\u2013204.","journal-title":"Annals of Discrete Mathematics"},{"key":"13_CR25","unstructured":"J. Edmonds and R. Gilles, \u201cTotal integrality of linear inequality systems\u201d, Proceedings of Silver Jubilee Conference on Combinatorics, University of Waterloo (1982)."},{"key":"13_CR26","first-page":"89","volume-title":"Combinatorial Structures and their Applications","author":"J Edmonds","year":"1970","unstructured":"J. Edmonds and E. L. Johnson, \u201cMatching: a well-solved class of integer linear programs\u201d in R. K. Guy et al. (eds.) Combinatorial Structures and their Applications, Gordon and Breach, New York (1970), 89\u201392."},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"J. Edmonds, L. Lov\u00e4sz and W. R. Pulleyblank, \u201cBrick decompositions and the matching rank of graphs\u201d, Research Report CORR 82\u201317, University of Waterloo (1982) to appear in Combinatorica.","DOI":"10.1007\/BF02579233"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"P. Elias, A. Feinstein and C. E. Shannon, \u201cA note on the maximum flow through a network\u201d, IRE Transactions on Information Theory IT2 (1956) 117\u2013119.","DOI":"10.1109\/TIT.1956.1056816"},{"key":"13_CR29","doi-asserted-by":"publisher","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"LR Ford","year":"1956","unstructured":"L. R. Ford and D. R. Fulkerson, \u201cMaximum flow through a network\u201d, Canadian Journal of Mathematics 8 (1956) 399\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"DR Fulkerson","year":"1971","unstructured":"D. R. Fulkerson, \u201cBlocking and anti-blocking pairs of polyhedra\u201d, Mathematical Programming 1 (1971) 168\u2013194.","journal-title":"Mathematical Programming"},{"key":"13_CR31","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","volume":"4","author":"D Gale","year":"1968","unstructured":"D. Gale, \u201cOptimal assignments in an ordered set: an application of matroid theory\u201d, Journal of Combinatorial Theory 4 (1968) 176\u2013180.","journal-title":"Journal of Combinatorial Theory"},{"key":"13_CR32","volume-title":"Computers and Intractability, a Guide to the Theory of NP-Completeness, W. H","author":"MR Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson, Computers and Intractability, a Guide to the Theory of NP-Completeness, W. H. Freeman & Co., San Francisco (1979)."},{"key":"13_CR33","volume-title":"Submodular functions, graphs and integer polyhedra, Ph.D","author":"R Giles","year":"1975","unstructured":"R. Giles, Submodular functions, graphs and integer polyhedra, Ph.D. Thesis, University of Waterloo (1975)."},{"key":"13_CR34","unstructured":"R. Giles, \u201cFacets and other faces of branching polyhedra\u201d, Colloq. Math. Soc. J\u00e1nos Bolyai 18 Combinatorics (1976) 401\u2013418."},{"key":"13_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01581022","volume":"22","author":"R Giles","year":"1982","unstructured":"R. Giles, \u201cOptimum matching forests I: Special weights\u201d, Mathematical Programming 22 (1982) 1\u201311.","journal-title":"Mathematical Programming"},{"key":"13_CR36","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BF01581023","volume":"22","author":"R Giles","year":"1982","unstructured":"R. Giles, \u201cOptimum matching forests II: General weights\u201d, Mathematical Programming 22 (1982) 12\u201338.","journal-title":"Mathematical Programming"},{"key":"13_CR37","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF01581024","volume":"22","author":"R Giles","year":"1982","unstructured":"R. Giles, \u201cOptimum matching forests III: Facets of matching forest polyhedra\u201d, Mathematical Programming 22 (1982) 39\u201351.","journal-title":"Mathematical Programming"},{"key":"13_CR38","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0024-3795(79)90018-1","volume":"25","author":"R Giles","year":"1979","unstructured":"R. Giles and W. R. Pulleyblank, \u201cTotal dual integrality and integer polyhedra\u201d, Linear Algebra and Its Applications 25 (1979) 191\u2013196.","journal-title":"Linear Algebra and Its Applications"},{"key":"13_CR39","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/0095-8956(81)90033-2","volume":"31","author":"R Giles","year":"1981","unstructured":"R. Giles and L. Trotter, \u201cOn stable set polyhedron for \u00a3u-free graphs\u201d, Journal of Combinatorial Theory B31 (1981) 313\u2013326.","journal-title":"Journal of Combinatorial Theory"},{"key":"13_CR40","first-page":"41","volume-title":"Linear Inequalities and Related Systems, Annals of Mathematics Study 38","author":"AJ Goldman","year":"1956","unstructured":"A. J. Goldman, \u201cResolution and separation theorems for polyhedral convex sets\u201d, in H. W. Kuhn and A. W. Tucker eds., Linear Inequalities and Related Systems, Annals of Mathematics Study 38 (1956) 41 - 51."},{"key":"13_CR41","first-page":"551","volume":"9","author":"RE Gomory","year":"1961","unstructured":"R. E. Gomory and T. C. Hu, \u201cMultiterminal network flows\u201d, Journal of S.I.A.M. 9 (1961) 551 - 570.","journal-title":"Journal of S.I.A.M."},{"key":"13_CR42","volume-title":"Matching polyhedra","author":"JJ Green-Krotki","year":"1980","unstructured":"J. J. Green-Krotki, Matching polyhedra, M.Sc. Thesis, Carleton University (1980)."},{"key":"13_CR43","unstructured":"M. Gr\u00f6tschel, \u201cPolyedrische Charakterisierungen kombinatorischer Optimierung sprobleme\u201d, Dissertation, Universit\u00e4t Bonn ( 1977 ), Verlag A. Hain, Meisenheim (1977)."},{"key":"13_CR44","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1287\/moor.5.2.285","volume":"5","author":"M Gr\u00f6tschel","year":"1980","unstructured":"M. Gr\u00f6tschel, \u201cOn the monotone symmetric travelling salesman problem: hypohamiltonian\/hypotraceable graphs and facets\u201d, Mathematics of Operations Research 5 (1980) 285 - 292.","journal-title":"Mathematics of Operations Research"},{"key":"13_CR45","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0120887","volume":"12","author":"M","year":"1980","unstructured":"M. Gr\u00f6tschel, On the symmetric travelling salesman problem: solution of a 120 city problem, Mathematical Programming Study 12 (1980) 61\u201377.","journal-title":"Mathematical Programming Study"},{"key":"13_CR46","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/BF02579273","volume":"1","author":"M Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e4sz, A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization\u201d, Combinatorica 1 (1981) 70\u201389.","journal-title":"Combinatorica"},{"key":"13_CR47","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M Gr\u00f6tschel","year":"1979","unstructured":"M. Gr\u00f6tschel and M. Padberg, \u201cOn the symmetric travelling salesman problem I: inequalities\u201d, Mathematical Programming 16 (1979) 265\u2013280.","journal-title":"Mathematical Programming"},{"key":"13_CR48","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"M. Gr\u00f6tschel and M. Padberg, \u201cOn the symmetric travelling salesman problem II: lifting theorems and facets\u201d, Mathematical Programming 16 (1979) 281\u2013 302.","journal-title":"Mathematical Programming"},{"key":"13_CR49","volume-title":"Wiley","author":"to appear in E. Lawler, J. Lenstra, A","year":"1983","unstructured":"to appear in E. Lawler, J. Lenstra, A. Rinnooy Kan (eds.) The Travelling Salesman Problem, Wiley (1983)."},{"key":"13_CR50","volume-title":"Wiley","author":"to appear in E. Lawler, J. Lenstra, A","year":"1983","unstructured":"to appear in E. Lawler, J. Lenstra, A. Rinnooy Kan (eds.) The Travelling Salesman Problem, Wiley (1983)."},{"key":"13_CR51","volume-title":"Clique tree inequalities and the travelling salesman problem, Research Report 81196-OR","author":"M Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel and W. R. Pulleyblank, \u201cClique tree inequalities and the travelling salesman problem\u201d, Research Report 81196-OR, Institut f\u00fcr Operations Research, Universit\u00e4t Bonn (1981)."},{"key":"13_CR52","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"P. Hall, \u201cOn representations of subsets\u201d, Journal of the London Mathematical Society 10 (1935) 26\u201330.","journal-title":"Journal of the London Mathematical Society"},{"key":"13_CR53","volume-title":"Adjacency on Polytopes in Combinatorial Optimization","author":"D Hausmann","year":"1980","unstructured":"D. Hausmann, Adjacency on Polytopes in Combinatorial Optimization, Anton Hain, Meisenheim (1980)."},{"key":"13_CR54","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/BFb0121197","volume":"8","author":"D Hausmann","year":"1978","unstructured":"D. Hausmann and B. Korte, \u201cColouring criteria for adjacency on 0-1 polyhe- dra\u201d, Mathematical Programming Study 8 (1978) 106\u2013127.","journal-title":"Mathematical Programming Study"},{"key":"13_CR55","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/BF01580250","volume":"6","author":"A Hoffman","year":"1974","unstructured":"A. Hoffman, \u201cA generalization of max flow-min cut\u201d, Mathematical Programming 6 (1974) 352\u2013359.","journal-title":"Mathematical Programming"},{"key":"13_CR56","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/978-94-009-7798-3_20","volume-title":"Ordered Sets, D","author":"A Hoffman","year":"1982","unstructured":"A. Hoffman, \u201cOrdered sets and linear programming\u201d, in I. Rival (ed.), Ordered Sets, D. Reidel, Dordrecht, Holland (1982) 619 - 654."},{"key":"13_CR57","first-page":"233","volume-title":"Linear Inequalities and Related Systems, Annals of Mathematics Studies 38","author":"A Hoffman","year":"1956","unstructured":"A. Hoffman and J. Kruskal, \u201cIntegral boundary points of convex polyhedra\u201d, in H. Kuhn and A. Tucker (eds.), Linear Inequalities and Related Systems, Annals of Mathematics Studies 38 (1956) 233 - 246."},{"key":"13_CR58","volume-title":"A linear programming approach for the travelling salesman problem, Ph. D","author":"S Hong","year":"1972","unstructured":"S. Hong, A linear programming approach for the travelling salesman problem, Ph. D. Thesis, Johns Hopkins University (1972)."},{"key":"13_CR59","volume-title":"Integer Programming and Network Flows","author":"TC Hu","year":"1969","unstructured":"T. C. Hu, Integer Programming and Network Flows, Addison Wesley, Reading (1969)."},{"key":"13_CR60","volume-title":"Simplex pivots on the set packing polytope, Tech. Report","author":"Y Ikura","year":"1981","unstructured":"Y. Ikura and G. Nemhauser, \u201cSimplex pivots on the set packing polytope\u201d, Tech. Report 513, S.O.R.I.E., Cornell University (1981)."},{"key":"13_CR61","doi-asserted-by":"crossref","DOI":"10.21236\/AD0614578","volume-title":"Programming in networks and graphs, Ph. D. thesis","author":"E Johnson","year":"1965","unstructured":"E. Johnson, Programming in networks and graphs, Ph. D. thesis, Operations Research Center, University of California Berkley (1965)."},{"key":"13_CR62","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"R. Karp, \u201cReducibility among combinatorial problems\u201d, in R. Miller and J. Thatcher (eds.) Complexity of Computer Computations, Plenum Press, New York (1972) 85\u2013103."},{"key":"13_CR63","doi-asserted-by":"crossref","unstructured":"R. Karp and C. Papadimitriou, \u201cOn linear characterizations of combinatorial optimization problems\u201d, Proceedings of the Twenty-first Annual Symposium on the Foundations of Computer Science, IEEE (1980), 1\u20139.","DOI":"10.1109\/SFCS.1980.29"},{"key":"13_CR64","first-page":"116","volume":"38","author":"D. K\u00f6nig","year":"1931","unstructured":"D. K\u00f6nig, \u201cGraphs and matrices\u201d (Hungarian) Mat. Fiz. Lapok 38 (1931) 116\u2013 119.","journal-title":"Mat. Fiz. Lapok"},{"key":"13_CR65","first-page":"47","volume-title":"Leopold Kroneckers Werke Band III, Teubner Leipzig","author":"L Kronecker","year":"1899","unstructured":"L. Kronecker, \u201cN\u00e4herungsweise ganzzahlige Aufl\u00f6sung linearer Gleichungen\u201d in K. Hensel (ed.) Leopold Kroneckers Werke Band III, Teubner Leipzig (1899) 47\u2013110."},{"key":"13_CR66","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E Lawler","year":"1976","unstructured":"E. Lawler, Combinatorial Optimization: Networks and Matroids, Holt Rinehart and Winston, New York (1976)."},{"key":"13_CR67","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF01588263","volume":"17","author":"A Lehman","year":"1979","unstructured":"A. Lehman, \u201cOn the width-length inequality\u201d, Mathematical Programming 17 (1979) 403\u2013417.","journal-title":"Mathematical Programming"},{"key":"13_CR68","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"S. Lin and B. Kernighan, \u201cAn effective heuristic algorithm for the travelling- salesman problem\u201d, Operations Research 21 (1973) 498\u2013516.","journal-title":"Operations Research"},{"key":"13_CR69","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0167-5060(08)70822-7","volume":"4","author":"L Lov\u00e1sz","year":"1979","unstructured":"L. Lov\u00e1sz, \u201cGraph theory and integer programming\u201d, Annals of Discrete Mathematics 4 (1979) 141\u2013158.","journal-title":"Annals of Discrete Mathematics"},{"key":"13_CR70","first-page":"1051","volume-title":"Infinite and Finite Sets (Colloqu. Math. Soc. J. Bolyai 10","author":"L Lov\u00e1sz","year":"1975","unstructured":"L. Lov\u00e1sz and M. Plummer, \u201cOn bicritical graphs\u201d, in A. Hajnal et al. (eds.) Infinite and Finite Sets (Colloqu. Math. Soc. J. Bolyai 10 (1975) 1051\u20131079."},{"key":"13_CR71","unstructured":"J. Maurras, Polytopes \u00e1 sommets dans {0, l}n, Dissertation, Univ. Paris V II (1976)."},{"key":"13_CR72","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"B","author":"G. Minty","year":"1980","unstructured":"G. Minty, \u201cOn maximal independent sets of vertices in claw-free graphs\u201d, Journal of Combinatorial Theory B (1980) 284\u2013304.","journal-title":"Journal of Combinatorial Theory"},{"key":"13_CR73","volume-title":"Basel (1933) Jerusalem","author":"T. S","year":"1936","unstructured":"T. S. Motzkin, \u201cBeitr\u00e4ge zur Theorie der linearen Ungleichungen\u201d, Dissertation, Basel (1933) Jerusalem (1936)."},{"key":"13_CR74","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01581025","volume":"22","author":"D Naddef","year":"1982","unstructured":"D. Naddef, \u201cRank of maximum matchings in a graph\u201d, Mathematical Programming 22 (1982) 52\u201370.","journal-title":"Mathematical Programming"},{"key":"13_CR75","doi-asserted-by":"crossref","unstructured":"D. Naddef and W. R. Pulleyblank, \u201cHamiltonicity and combinatorial polyhedra\u201d, Journal of Combinatorial Theory B (1981) 297\u2013312.","DOI":"10.1016\/0095-8956(81)90032-0"},{"key":"13_CR76","first-page":"5","volume-title":"Contributions to the Theory of Games II, Annals of Mathematics Study, 38, Princeton University Press","author":"J Neumann von","year":"1953","unstructured":"J. von Neumann, \u201cA certain zero-sum two person game equivalent to the optimum assignment problem\u201d, in A. Tucker and H. Kuhn (eds.), Contributions to the Theory of Games II, Annals of Mathematics Study, 38, Princeton University Press (1953) 5\u201312."},{"key":"13_CR77","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-94-011-7557-9_14","volume-title":"Combinatorial Programming: Methods and Applications","author":"M Padberg","year":"1975","unstructured":"M. Padberg, \u201cCharacterizations of totally unimodular, balanced and perfect matrices\u201d, in B. Roy (ed.) Combinatorial Programming: Methods and Applications, Reidel, Boston (1975) 275\u2013284."},{"key":"13_CR78","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0120888","volume":"12","author":"M Padberg","year":"1980","unstructured":"M. Padberg and S. Hong, \u201cOn the symmetric travelling salesman problem: a computational study\u201d, Mathematical Programming Study 12 (1980) 78\u2013107.","journal-title":"Mathematical Programming Study"},{"key":"13_CR79","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BF01585502","volume":"1","author":"M Padberg","year":"1974","unstructured":"M. Padberg and M. R. Rao, \u201cThe travelling salesman problem and a class of polyhedra of diameter two\u201d, Mathematical Programming 1 (1974) 32\u201345.","journal-title":"Mathematical Programming"},{"key":"13_CR80","unstructured":"M. Padberg and M. R. Rao, \u201cOn the Russian method for linear inequalities III: Bounded integer programs\u201d, Research Report, Inria, Paris (1981) to appear in Mathematical Programming Studies."},{"key":"13_CR81","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"1","author":"M Padberg","year":"1982","unstructured":"M. Padberg and M. R. Rao, \u201cOdd minimum cuts and b-matching\u201d, Mathematics of Operations Research 1 (1982) 67\u201380.","journal-title":"Mathematics of Operations Research"},{"key":"13_CR82","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01588973","volume":"14","author":"C Papadimitriou","year":"1978","unstructured":"C. Papadimitriou, \u201cThe adjacency relation on the travelling salesman polytope is NP-complete\u201d, Mathematical Programming 14 (1978) 312\u2013324.","journal-title":"Mathematical Programming"},{"key":"13_CR83","volume-title":"University of Waterloo","author":"C","year":"1982","unstructured":"C. Papadimitiou, \u201cPolytopes and complexity\u201d, Proceedings of the Silver Jubilee Conference on Combinatorics, University of Waterloo (1982)."},{"key":"13_CR84","volume-title":"Faces of Matching Polyhedra, Ph.D","author":"WR Pulleyblank","year":"1973","unstructured":"W. R. Pulleyblank, Faces of Matching Polyhedra, Ph.D. Thesis, University of Waterloo (1973)."},{"key":"13_CR85","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/BFb0066196","volume-title":"Hypergraph Seminar","author":"WR Pulleyblank","year":"1974","unstructured":"W. R. Pulleyblank and J. Edmonds, \u201cFacets of 1-matching polyhedra\u201d in C. Berge and D. Ray-Chaudhuri (eds.), Hypergraph Seminar, Springer-Verlag, Berlin (1974) 214\u2013242."},{"key":"13_CR86","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BFb0120895","volume":"12","author":"WR Pulleyblank","year":"1980","unstructured":"W. R. Pulleyblank, \u201cDual integrality in b-matching problems\u201d, Mathematical Programming Study 12 (1980) 176\u2013196.","journal-title":"Mathematical Programming Study"},{"key":"13_CR87","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/0167-6377(81)90021-3","volume":"1","author":"WR Pulleyblank","year":"1981","unstructured":"W. R. Pulleyblank, \u201cTotal dual integrality and b-matchings\u201d, Operations Research Letters 1 (1981) 28\u201330.","journal-title":"Operations Research Letters"},{"key":"13_CR88","doi-asserted-by":"publisher","first-page":"228","DOI":"10.2307\/1968764","volume":"44","author":"R Rado","year":"1943","unstructured":"R. Rado, \u201cTheorems on linear combinatorial topology and general measure\u201d, Annals of Mathematics, 44 (1943) 228\u2013270.","journal-title":"Annals of Mathematics"},{"key":"13_CR89","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1112\/plms\/s3-7.1.300","volume":"1","author":"R Rado","year":"1957","unstructured":"R. Rado, \u201cNote on independence functions\u201d, Proceedings of the London Mathematical Society 1 (1957) 300\u2013320.","journal-title":"Proceedings of the London Mathematical Society"},{"key":"13_CR90","doi-asserted-by":"crossref","unstructured":"T. Rockafellar, Convex Analysis, Princeton University Press (1970).","DOI":"10.1515\/9781400873173"},{"key":"13_CR91","volume-title":"Etude des Stables dans les Graphes sans Etoile","author":"N Sbihi","year":"1978","unstructured":"N. Sbihi, Etude des Stables dans les Graphes sans Etoile, Doctoral disseration, University of Grenoble (1978)."},{"key":"13_CR92","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0012-365X(90)90287-R","volume":"29","author":"N Sbihi","year":"1980","unstructured":"N. Sbihi, \u201cAlgorithme de recherche d\u2019un stable de cardinalit\u00e9 maximum dans un graphe sans \u00e9toile\u201d, Discrete Mathematics 29 (1980) 53\u201376.","journal-title":"Discrete Mathematics"},{"key":"13_CR93","unstructured":"A. Schrijver, \u201cShort proofs on the matching polytope\u201d, Rapport AE17\/81, Inst. Act. & Econ, Univ. van Amsterdam (1981), to appear in Journal of Combinatorial Theory B."},{"key":"13_CR94","unstructured":"A. Schrijver, \u201cTheory of Integer Linear Programming\u201d, preprint."},{"key":"13_CR95","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0024-3795(81)90005-7","volume":"38","author":"A Schrijver","year":"1981","unstructured":"A. Schrijver, \u201cOn total dual integrality\u201d, Linear Algebra and its Applications 38 (1981) 27 - 32.","journal-title":"Linear Algebra and its Applications"},{"key":"13_CR96","unstructured":"A. Schrijver, \u201cMin-max Results in Combinatorial Optimization\u201d, this volume."},{"key":"13_CR97","doi-asserted-by":"crossref","unstructured":"P. Seymour, \u201cOn multi-colourings of cubic graphs and conjectures of Fulker- son and Tutte\u201d, Proceedings of the London Mathematical Society 38 (1979) 423- 460.","DOI":"10.1112\/plms\/s3-38.3.423"},{"key":"13_CR98","doi-asserted-by":"crossref","unstructured":"P. D. Seymour, \u201cDecomposition of regular matroids\u201d, Journal of Combinatorial Theory B (1980) 305 - 359.","DOI":"10.1016\/0095-8956(80)90075-1"},{"key":"13_CR99","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-46216-0","volume-title":"Convexity and Optimization in Finite Dimensions","author":"J Stoer","year":"1970","unstructured":"J. Stoer and C. Witzgall, Convexity and Optimization in Finite Dimensions, Springer, Berlin (1970)."},{"key":"13_CR100","first-page":"1544","volume":"10","author":"V Trubin","year":"1969","unstructured":"V. Trubin, \u201cOn a method of solution of integer linear programming problems of a special kind\u201d, Soviet Mathematics Doklody 10 (1969) 1544 - 1546.","journal-title":"Soviet Mathematics Doklody"},{"key":"13_CR101","doi-asserted-by":"publisher","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"WT Tutte","year":"1952","unstructured":"W. T. Tutte, \u201cThe factors of graphs\u201d, Canadian Journal of Mathematics 4 (1952) 314 - 328.","journal-title":"Canadian Journal of Mathematics"},{"key":"13_CR102","doi-asserted-by":"crossref","unstructured":"W. T. Tutte, \u201cLectures on matroids\u201d, Journal of Research of the National Bureau of Standards 69 B, 1\u201347.","DOI":"10.6028\/jres.069B.001"},{"key":"13_CR103","volume-title":"Berlin","author":"BL Waerden van der","year":"1937","unstructured":"B. L. van der Waerden, Moderne Algebra (2nd ed.) Springer, Berlin (1937)."},{"key":"13_CR104","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S030500410004247X","volume":"64","author":"D Welsh","year":"1968","unstructured":"D. Welsh, \u201cKruskal\u2019s theorem for matroids\u201d, Proceedings of the Cambridge Philosophical Society 64 (1968) 3\u20134.","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"13_CR105","volume-title":"Matroid Theory","author":"D Welsh","year":"1976","unstructured":"D. Welsh, Matroid Theory, Academic Press, London (1976)."},{"key":"13_CR106","first-page":"290","volume":"1","author":"H Weyl","year":"1935","unstructured":"H. Weyl, \u201cElementare Theorie der konvexen Polyeder\u201d, Commentarii Mathematici Helvetici 1 (1935) 290\u2013306.","journal-title":"Commentarii Mathematici Helvetici"},{"key":"13_CR107","doi-asserted-by":"crossref","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"H. Whitney, \u201cOn the abstract properties of linear dependence\u201d, American Journal of Mathematics 57 (1935) 509\u2013533.\\","journal-title":"American Journal of Mathematics"}],"container-title":["Mathematical Programming The State of the Art"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-68874-4_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T22:31:15Z","timestamp":1606257075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-68874-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783642688768","9783642688744"],"references-count":107,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-68874-4_13","relation":{},"subject":[],"published":{"date-parts":[[1983]]}}}