{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T03:31:15Z","timestamp":1776310275657,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":69,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540428770","type":"print"},{"value":"9783540455868","type":"electronic"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45586-8_7","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T05:06:11Z","timestamp":1180328771000},"page":"261-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":56,"title":["TSP Cuts Which Do Not Conform to the Template Paradigm"],"prefix":"10.1007","author":[{"given":"David","family":"Applegate","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Bixby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Va\u0161ek","family":"Chv\u00e1tal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Cook","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"7_CR1","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Finding cuts in the TSP (A preliminary report). DIMACS Technical Report 95-05, 1995. Available at ftp:\/\/dimacs.rutgers.edu\/pub\/dimacs\/TechnicalReports\/TechReports\/1995\/"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: On the solution of traveling salesman problems. Documenta Mathematica Extra Volume (Proceedings of the International Congress of Mathematicians), 645\u2013656, 1998. Also available at http:\/\/www.mathematik.uni-bielefeld.de\/documenta\/xvol-icm\/17\/17.html","DOI":"10.4171\/dms\/1-3\/62"},{"key":"7_CR3","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Concorde, 1999. Available at http:\/\/www.math.princeton.edu\/tsp\/concorde.html"},{"key":"7_CR4","unstructured":"Applegate, D., Bixby, R., Chv\u00e1tal, V., Cook, W.: Solving Traveling Salesman Problems. To appear."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas, E.: Facets of the knapsack polytope. Mathematical Programming 8, 146\u2013164, 1975.","journal-title":"Mathematical Programming"},{"key":"7_CR6","unstructured":"Batoukov, R., S\u00f8revik, T.: A generic parallel branch and bound environment on a network of workstations. In:Proceedings of HiPer\u201999, pp. 474\u2013483, 1999. Also available at http:\/\/www.ii.uib.no\/~tors\/publications\/"},{"key":"7_CR7","unstructured":"Bock, F.: An algorithm for solving \u2018traveling-salesman\u2019 and related network optimization problems. Research Report, Armour Research Foundation. Presented at the Operations Research Society of America Fourteenth National Meeting, St. Louis, October 24, 1958."},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1137\/0803038","volume":"3","author":"E.A. Boyd","year":"1993","unstructured":"Boyd, E.A.: Generating Fenchel cutting planes for knapsack polyhedra. SIAM Journal of Optimization 3, 734\u2013750, 1993.","journal-title":"SIAM Journal of Optimization"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"E.A. Boyd","year":"1994","unstructured":"Boyd, E.A.: Fenchel cutting planes for integer programs. Operations Research 42, 53\u201364, 1994.","journal-title":"Operations Research"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.22.2.257","volume":"22","author":"R. Carr","year":"1997","unstructured":"Carr, R.: Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time. Mathematics of Operations Research 22, 257\u2013265, 1997.","journal-title":"Mathematics of Operations Research"},{"key":"7_CR11","unstructured":"Christof, T., Reinelt, G.: Parallel cutting plane generation for the TSP. In: Parallel Programming and Applications (P. Fritzson and L. Finmo, eds.), IOS Press, pp. 163\u2013169, 1995."},{"key":"7_CR12","first-page":"1","volume":"4","author":"T. Christof","year":"1996","unstructured":"Christof, T., Reinelt, G.: Combinatorial optimization and small polytopes. Top 4, 1\u201364, 1996.","journal-title":"Combinatorial optimization and small polytopes"},{"key":"7_CR13","unstructured":"Clochard, J.-M., Naddef, D.: Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. In: Third IPCO Conference, (G. Rinaldi and L. Wolsey, eds.), pp. 291\u2013311, 1993."},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582008","volume":"33","author":"G. Cornu\u00e9jols","year":"1985","unstructured":"Cornu\u00e9jols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Mathematical Programming 33, 1\u201327, 1985.","journal-title":"Mathematical Programming"},{"key":"7_CR15","volume-title":"Fractional Programming","author":"B.D. Craven","year":"1988","unstructured":"Craven, B.D.: Fractional Programming. Heldermann, Berlin, 1988."},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G.A. Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Operations Research 6, 791\u2013812, 1958.","journal-title":"Operations Research"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder, H., Johnson, E.L., Padberg, M.: Solving large-scale zero-one linear programming problems. Operations Research 31, 803\u2013834, 1983.","journal-title":"Operations Research"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/mnsc.26.5.495","volume":"26","author":"H. Crowder","year":"1980","unstructured":"Crowder, H., Padberg, M.W.: Solving large-scale symmetric travelling salesman problems to optimality. Management Science 26, 495\u2013509, 1980.","journal-title":"Management Science"},{"key":"7_CR19","first-page":"393","volume":"2","author":"G. Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a large-scale traveling salesman problem. Operations Research 2, 393\u2013410, 1954.","journal-title":"Operations Research"},{"key":"7_CR20","unstructured":"Eastman, W.L.: Linear programming with pattern constraints. Ph.D. Thesis, Harvard University, 1958."},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0,1-vertices. Journal of Research of the National Bureau of Standards 69B, 125\u2013130, 1965.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"7_CR22","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/moor.24.1.130","volume":"24","author":"L.K. Fleischer","year":"1999","unstructured":"Fleischer, L.K., Tardos, \u00c9.: Separating Maximally Violated Combs in Planar Graphs. Mathematics of Operations Research 24, 130\u2013148, 1999.","journal-title":"Mathematics of Operations Research"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0377-2217(85)90151-1","volume":"21","author":"B. Fleischmann","year":"1985","unstructured":"Fleischmann, B.: A cutting plane procedure for the travelling salesman problem on road networks. European Journal of Operational Research 21, 307\u2013317, 1985.","journal-title":"European Journal of Operational Research"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01580734","volume":"40","author":"B. Fleischmann","year":"1988","unstructured":"Fleischmann, B.: A new class of cutting planes for the symmetric travelling salesman problem. Mathematical Programming 40, 225\u2013246, 1988.","journal-title":"Mathematical Programming"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1287\/mnsc.5.1.97","volume":"5","author":"L.R. Ford Jr","year":"1958","unstructured":"Ford, L.R.Jr., Fulkerson, D.R.: A suggested computation for maximal multicommodity networks flows. Management Science 5, 97\u2013101, 1958.","journal-title":"Management Science"},{"key":"7_CR26","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"G. R.E","year":"1958","unstructured":"Gomory, R.E.: Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Mathematical Society 64, 275\u2013278, 1958.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"7_CR27","unstructured":"Gomory, R.E.: Solving linear programs in integers. In: Combinatorial Analysis (R. E. Bellman and M. Hall, Jr., eds.), Proceedings of the Symposia on Applied Mathematics X, pp. 211\u2013216, 1960."},{"key":"7_CR28","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R.E. Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solutions to linear programs. In: Recent Advances in Mathematical Programming (R. L. Graves and P. Wolfe, eds.), McGraw-Hill, New York, pp. 269\u2013302, 1963."},{"key":"7_CR29","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","volume":"2","author":"R.E. Gomory","year":"1969","unstructured":"Gomory, R.E.: Some polyhedra related to combinatorial problems. Linear Algebra and Its Applications 2, 451\u2013558, 1969.","journal-title":"Linear Algebra and Its Applications"},{"key":"7_CR30","volume-title":"Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme","author":"M. Gr\u00f6tschel","year":"1977","unstructured":"Gr\u00f6tschel, M.: Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme, Anton Hain Verlag, Meisenheim\/Glan, 1977."},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0120887","volume":"12","author":"M. Gr\u00f6tschel","year":"1980","unstructured":"Gr\u00f6tschel, M.: On the symmetric travelling salesman problem: solution of a 120-city problem. Mathematical Programming Study 12, 61\u201377, 1980.","journal-title":"Mathematical Programming Study"},{"key":"7_CR32","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01586932","volume":"51","author":"M. Gr\u00f6tschel","year":"1991","unstructured":"Gr\u00f6tschel, M., O. Holland.: Solution of large-scale symmetric travelling salesman problems. Mathematical Programming 51, 141\u2013202, 1991.","journal-title":"Mathematical Programming"},{"key":"7_CR33","doi-asserted-by":"publisher","first-page":"1195","DOI":"10.1287\/opre.32.6.1195","volume":"32","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Operations Research 32, 1195\u20131220, 1984.","journal-title":"Operations Research"},{"key":"7_CR34","unstructured":"Gr\u00f6tschel, M., Padberg, M.W.: On the Symmetric Travelling Salesman Problem, Report No.7536-OR, Institut f\u00fcr \u00d6konometrie und Operations Research, Universit\u00e4t Bonn, 1975."},{"key":"7_CR35","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.W.: On the symmetric travelling salesman problem I: Inequalities. Mathematical Programming 16, 265\u2013280, 1979.","journal-title":"Mathematical Programming"},{"key":"7_CR36","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.W.: On the symmetric travelling salesman problem II: Lifting theorems and facets. Mathematical Programming 16, 281\u2013302, 1979.","journal-title":"Mathematical Programming"},{"key":"7_CR37","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.: Clique tree inequalities and the symmetric travelling salesman problem. Mathematics of Operations Research 11, 537\u2013569, 1986.","journal-title":"Mathematics of Operations Research"},{"key":"7_CR38","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P.L. Hammer","year":"1975","unstructured":"Hammer, P.L., Johnson, E.L., Peled, U.N.: Facets of regular 0-1 polytopes. Mathematical Programming 8, 179\u2013206, 1975.","journal-title":"Mathematical Programming"},{"key":"7_CR39","unstructured":"Hong, S.: A linear programming approach for the traveling salesman problem, Ph.D. Thesis, The Johns Hopkins University, 1972."},{"key":"7_CR40","unstructured":"Jewell, W.S.: Optimal flow through networks. Interim Technical Report No. 8, Massachusetts Institute of Technology, 1958."},{"key":"7_CR41","unstructured":"Land, A.: The solution of some 100-city travelling salesman problems. Unpublished manuscript, 1979."},{"key":"7_CR42","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28, 497\u2013520, 1960.","journal-title":"Econometrica"},{"key":"7_CR43","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/moor.25.3.443.12213","volume":"25","author":"A.N. Letchford","year":"2000","unstructured":"Letchford, A.N.: Separating a superclass of comb inequalities in planar graphs. Mathematics of Operations Research 25, 443\u2013454, 2000.","journal-title":"Mathematics of Operations Research"},{"key":"7_CR44","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1287\/opre.11.6.972","volume":"11","author":"J.D.C. Little","year":"1963","unstructured":"Little, J.D.C., Murty, K.G., Sweeney, D.W., Karel, C.: An algorithm for the traveling salesman problem. Operations Research 11, 972\u2013989, 1963.","journal-title":"Operations Research"},{"key":"7_CR45","unstructured":"Martin, G.T.: An accelerated euclidean algorithm for integer linear programming. In: Recent advances in mathematical programming (R. L. Graves and P. Wolfe, eds.), McGraw-Hill, pp. 311\u2013318, 1963."},{"key":"7_CR46","unstructured":"Martin, G.T.: Solving the traveling salesman problem by integer linear programming. Operations Research 14(Supplement 1), Abstract WA7.10, 1966."},{"key":"7_CR47","unstructured":"Maurras, J.F.: Some results on the convex hull of Hamiltonian cycles of symmetric complete graphs. In: Combinatorial Programming: Methods and Applications (B. Roy, ed.), Reidel, Dordrecht, pp. 179\u2013190, 1975."},{"key":"7_CR48","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580682","volume":"10","author":"P. Miliotis","year":"1976","unstructured":"Miliotis, P.: Integer programming approaches to the travelling salesman problem. Mathematical Programming 10, 367\u2013378, 1976.","journal-title":"Mathematical Programming"},{"key":"7_CR49","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01609016","volume":"15","author":"P. Miliotis","year":"1978","unstructured":"Miliotis, P.: Using cutting planes to solve the symmetric travelling salesman problem. Mathematical Programming 15, 177\u2013188, 1978.","journal-title":"Mathematical Programming"},{"key":"7_CR50","volume-title":"Geometrie der Zahlen (Erste Lieferung)","author":"H. Minkowski","year":"1896","unstructured":"Minkowski, H.: Geometrie der Zahlen (Erste Lieferung). Teubner, Leipzig, 1896. Reprinted: Chelsea, New York, 1953."},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Naddef, D.: Handles and teeth in the symmetric traveling salesman polytope. In: Polyhedral combinatorics (W. Cook and P. D. Seymour, eds.), DIMACS Series in Mathematics and Theoretical Computer Science 1, American Mathematical Society, pp. 61\u201374, 1990.","DOI":"10.1090\/dimacs\/001\/07"},{"key":"7_CR52","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF01586945","volume":"51","author":"D. Naddef","year":"1991","unstructured":"Naddef, D., Rinaldi, G.: The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities. Mathematical Programming 51, 359\u2013400, 1991.","journal-title":"Mathematical Programming"},{"key":"7_CR53","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01581259","volume":"58","author":"D. Naddef","year":"1992","unstructured":"Naddef, D., Rinaldi, G.: The graphical relaxation: A new framework for the symmetric traveling salesman polytope. Mathematical Programming 58, 53\u201388, 1992.","journal-title":"Mathematical Programming"},{"key":"7_CR54","unstructured":"Naddef, D., Thienel, S.: Efficient separation routines for the symmetric traveling salesman problem I: General tools and comb separation. Working paper, 1999. Available at http:\/\/www-id.imag.fr\/Laboratoire\/Membres\/Naddef_Denis\/perso.html"},{"key":"7_CR55","unstructured":"Naddef, D., Thienel, S.: Efficient separation routines for the symmetric traveling salesman problem II: Separating multi handle inequalities. Working paper, 1999. Available at http:\/\/www-id.imag.fr\/Laboratoire\/Membres\/Naddef_Denis\/perso.html"},{"key":"7_CR56","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"Padberg, M.W.: On the facial structure of set packing polyhedra. Mathematical Programming 5, 199\u2013215, 1973.","journal-title":"Mathematical Programming"},{"key":"7_CR57","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M.W. Padberg","year":"1975","unstructured":"Padberg, M.W.: A note on zero-one programming. Operations Research 23, 833\u2013837, 1975.","journal-title":"Operations Research"},{"key":"7_CR58","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0120888","volume":"12","author":"M.W. Padberg","year":"1980","unstructured":"Padberg, M.W., Hong, S.: On the symmetric travelling salesman problem: a computational study. Mathematical Programming Study 12, 78\u2013107, 1980.","journal-title":"Mathematical Programming Study"},{"key":"7_CR59","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. Mathematics of Operations Research 7, 67\u201380, 1982.","journal-title":"Mathematics of Operations Research"},{"key":"7_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(87)90002-2","volume":"6","author":"M.W. Padberg","year":"1987","unstructured":"Padberg, M.W., Rinaldi, G.: Optimization of a 532-city symmetric traveling salesman problem by branch and cut. Operations Research Letters 6, 1\u20137, 1987.","journal-title":"Operations Research Letters"},{"key":"7_CR61","doi-asserted-by":"crossref","unstructured":"Padberg, M.W., Rinaldi, G.: An efficient algorithm for the minimum capacity cut problem. Mathematical Programming 47, 1990.","DOI":"10.1007\/BF01580850"},{"key":"7_CR62","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01580861","volume":"47","author":"M.W. Padberg","year":"1990","unstructured":"Padberg, M.W., Rinaldi, G.: Facet identification for the symmetric traveling salesman polytope. Mathematical Programming 47, 219\u2013257, 1990.","journal-title":"Mathematical Programming"},{"key":"7_CR63","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"Padberg, M.W., Rinaldi, G.: A branch-and-cut algorithm for the resolution of largescale symmetric traveling salesman problems. SIAM Review 33, 60\u2013100, 1991.","journal-title":"SIAM Review"},{"key":"7_CR64","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-A traveling salesman problem library. ORSA Journal on Computing 3, 376\u2013384, 1991. An updated version is available at http:\/\/www.iwr.uni-heidelberg.de\/iwr\/comopt\/software\/TSPLIB95\/ .","journal-title":"ORSA Journal on Computing"},{"key":"7_CR65","first-page":"687","volume":"6","author":"M.J. Rossman","year":"1958","unstructured":"Rossman, M.J., Twery, R.J.: A solution to the travelling salesman problem. Operations Research 6, p.687, Abstract E3.1.3, 1958.","journal-title":"Operations Research"},{"key":"7_CR66","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester, 1986."},{"key":"7_CR67","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional Programming","author":"I.M. Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian, I.M.: Fractional Programming. Kluwer, Dordrecht, 1997."},{"key":"7_CR68","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Faces for a linear inequality in 0-1 variables. Mathematical Programming 8, 165\u2013178, 1975.","journal-title":"Mathematical Programming"},{"key":"7_CR69","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.24.2.367","volume":"24","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey, L.A.: Facets and strong valid inequalities for integer programs. Operations Research 24, 367\u2013372, 1975.","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Computational Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45586-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,12]],"date-time":"2023-05-12T01:34:29Z","timestamp":1683855269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45586-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428770","9783540455868"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/3-540-45586-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}