{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T10:37:11Z","timestamp":1726310231170},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540767954"},{"type":"electronic","value":"9783540767961"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76796-1_2","type":"book-chapter","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T02:24:04Z","timestamp":1225938244000},"page":"33-55","source":"Crossref","is-referenced-by-count":2,"title":["Facet Generating Techniques"],"prefix":"10.1007","author":[{"given":"Sylvia","family":"Boyd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. \n                http:\/\/miplib.zib.de\/\n                \n               (2003)"},{"key":"2_CR2","volume-title":"The Traveling Salesman Problem and Its Variations","author":"E. Balas","year":"2007","unstructured":"Balas, E., Fischetti, M.: Polyhedral theory for the asymmetric traveling salesman problem. In: Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations. Springer, New York (2007)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1287\/moor.22.1.110","volume":"22","author":"P. Bauer","year":"1997","unstructured":"Bauer, P.: The circuit polytope: Facets. Math. Oper. Res. 22, 110\u2013145 (1997)","journal-title":"Math. Oper. Res."},{"key":"2_CR4","unstructured":"Boyd, S.: The subtour polytope of the travelling salesman problem. Ph.D. Thesis, University of Waterloo, Waterloo, Canada (1986)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1137\/0406047","volume":"6","author":"S. Boyd","year":"1993","unstructured":"Boyd, S., Hao, T.: An integer polytope related to the design of survivable communication networks. SIAM J. Discrete Math. 6, 612\u2013630 (1993)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR6","unstructured":"Boyd, S., Pulleyblank, W.R.: Facet generating techniques. Technical Report TR-91-31, Dept. of Computer Science, University of Ottawa (1993)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V. Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4, 305\u2013337 (1973)","journal-title":"Discrete Math."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W. Cook","year":"1986","unstructured":"Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, E.: Sensitivity theorems in integer linear programming. Math. Program. 34, 251\u2013264 (1986)","journal-title":"Math. Program."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02579233","volume":"2","author":"J. Edmonds","year":"1982","unstructured":"Edmonds, J., Lov\u00e1sz, L., Pulleyblank, W.R.: Brick decompositions and the matching rank of graphs. Combinatorica 2, 247\u2013274 (1982)","journal-title":"Combinatorica"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s004930050057","volume":"19","author":"F. Eisenbrand","year":"1999","unstructured":"Eisenbrand, F.: On the membership problem for the elementary closure of a polyhedron. Combinatorica 19, 297\u2013300 (1999)","journal-title":"Combinatorica"},{"issue":"1","key":"2_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-006-0054-8","volume":"110","author":"M. Fischetti","year":"2007","unstructured":"Fischetti, M., Lodi, A.: Optimizing over the first Chv\u00e1tal closure. Math. Program. B 110(1), 3\u201320 (2007)","journal-title":"Math. Program. B"},{"key":"2_CR12","volume-title":"Combinatorial Analysis","author":"R. Gomory","year":"1960","unstructured":"Gomory, R.: Solving linear programming problems in integers. In: Bellman, R.E., Hall, M. Jr. (eds.) Combinatorial Analysis. Am. Math. Soc., Providence (1960)"},{"key":"2_CR13","volume-title":"Recent Advances in Mathematical Programming","author":"R. Gomory","year":"1963","unstructured":"Gomory, R.: An algorithm for integer solutions to linear programs. In: Graves, R., Wolfe, P. (eds.) Recent Advances in Mathematical Programming. McGraw-Hill, New York (1963)"},{"key":"2_CR14","volume-title":"Polyedrische Charakterisierungen kombinatorischer Optimierungs-probleme","author":"M. Gr\u00f6tschel","year":"1977","unstructured":"Gr\u00f6tschel, M.: Polyedrische Charakterisierungen kombinatorischer Optimierungs-probleme. Hain, Meisenheim am Glan (1977)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1137\/0403043","volume":"3","author":"M. Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel, M., Monma, C.L.: Integer polyhedra arising from certain network design problems with connectivity constraints. SIAM J. Discrete Math. 3, 502\u2013523 (1990)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01582116","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel, M., Padberg, M.: On the symmetric travelling salesman problem I: Inequalities. Math. Program. 16, 265\u2013280 (1979a)","journal-title":"Math. Program."},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01582117","volume":"16","author":"M. Gr\u00f6tschel","year":"1979","unstructured":"Gr\u00f6tschel, M., Padberg, M.: On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Program. 16, 281\u2013302 (1979b)","journal-title":"Math. Program."},{"key":"2_CR18","volume-title":"The Travelling Salesman Problem","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., Padberg, M.: Polyhedral theory. In: Lawler, E.L., et al. (eds.) The Travelling Salesman Problem. Wiley, New York (1985)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1287\/moor.11.4.537","volume":"11","author":"M. Gr\u00f6tschel","year":"1986","unstructured":"Gr\u00f6tschel, M., Pulleyblank, W.R.: Clique tree inequalities and the symmetric travelling salesman problem. Math. Oper. Res. 11, 537\u2013569 (1986)","journal-title":"Math. Oper. Res."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF01582010","volume":"33","author":"M. Gr\u00f6tschel","year":"1982","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: Facets of the linear ordering polytope. Math. Program. 33, 43\u201360 (1982a)","journal-title":"Math. Program."},{"key":"2_CR21","first-page":"1","volume":"33","author":"M. Gr\u00f6tschel","year":"1982","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: On the acyclic subgraph polytope. Math. Program. 33, 1\u201327 (1982b)","journal-title":"Math. Program."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1137\/0802024","volume":"2","author":"M. Gr\u00f6tschel","year":"1992","unstructured":"Gr\u00f6tschel, M., Monma, C.L., Stoer, M.: Facets for polyhedra arising in the design of communication networks with low-connectivity constraints. SIAM J. Optim. 2, 474\u2013504 (1992)","journal-title":"SIAM J. Optim."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0166-218X(92)00151-B","volume":"50","author":"J. Leung","year":"1994","unstructured":"Leung, J., Lee, J.: More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl. Math. 50, 185\u2013200 (1994)","journal-title":"Discrete Appl. Math."},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01582572","volume":"64","author":"A.R. Mahjoub","year":"1994","unstructured":"Mahjoub, A.R.: Two-edge connected spanning subgraphs and polyhedra. Math. Program. 64, 199\u2013208 (1994)","journal-title":"Math. Program."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1993","unstructured":"Naddef, D., Rinaldi, G.: The graphical relaxation: A new framework for the travelling salesman polytope. Math. Program. 58, 53\u201388 (1993)","journal-title":"Math. Program."},{"key":"2_CR26","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1287\/moor.7.1.67","volume":"7","author":"M.W. Padberg","year":"1982","unstructured":"Padberg, M.W., Rao, M.R.: Odd minimum cut-sets and b-matchings. Math. Oper. Res. 7, 67\u201380 (1982)","journal-title":"Math. Oper. Res."},{"key":"2_CR28","volume-title":"Handbooks in Operational Research and Management Science","author":"W.R. Pulleyblank","year":"1989","unstructured":"Pulleyblank, W.R.: Polyhedral combinatorics. In: Nemhauser, G.L., et al. (eds.) Handbooks in Operational Research and Management Science, vol. 1. Elsevier Science\/North-Holland, Amsterdam (1989)"},{"key":"2_CR29","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/BFb0066196","volume-title":"Hypergraph Seminar","author":"W.R. Pulleyblank","year":"1974","unstructured":"Pulleyblank, W.R., Edmonds, J.: Facets of 1-matching polyhedra. In: Berge, C., Ray-Chaudhuri, D.K. (eds.) Hypergraph Seminar. Lecture Notes in Mathematics, vol. 411, pp.\u00a0214\u2013242. Springer, Berlin (1974)"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A. Schrijver","year":"1980","unstructured":"Schrijver, A.: On cutting planes. Ann. Discrete Math. 9, 291\u2013296 (1980)","journal-title":"Ann. Discrete Math."}],"container-title":["Research Trends in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76796-1_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:38:59Z","timestamp":1619505539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76796-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540767954","9783540767961"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76796-1_2","relation":{},"subject":[]}}