{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:09:00Z","timestamp":1761894540928,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":72,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428770"},{"type":"electronic","value":"9783540455868"}],"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_1","type":"book-chapter","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T01:06:11Z","timestamp":1180314371000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Martin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,19]]},"reference":[{"key":"1_CR1","series-title":"Technical Report CORE","volume-title":"Non-standard approaches to integer programming","author":"K. Aardal","year":"2000","unstructured":"K. Aardal, R. Weismantel, and L.A. Wolsey. Non-standard approaches to integer programming. Technical Report CORE DP2000\/2, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 2000."},{"key":"1_CR2","first-page":"221","volume":"71","author":"E. D. Andersen","year":"1995","unstructured":"E. D. Andersen and K. D. Andersen. Presolving in linear programming. Mathematical Programming, 71:221\u2013245, 1995.","journal-title":"Mathematical Programming"},{"key":"1_CR3","unstructured":"D. Applegate, R. E. Bixb, V. Chv\u00e1tal, and W. Cook. Finding cuts in the TSP. Technical Report 95\u201305, DIMACS, March 1995."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"E. Balas. Facets of the knapsack polytope. Mathematical Programming, 8:146\u2013164, 1975.","journal-title":"Mathematical Programming"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas, S. Ceria, and G. Cornu\u00e9jols. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Mathematical Programming, 58:295\u2013324, 1993.","journal-title":"Mathematical Programming"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"E. Balas, S. Ceria, and G. Cornu\u00e9jols. Mixed 0-1 programming by lift-and-project in a branch-and-cut framework. Management Science, 42:1229\u20131246, 1996.","journal-title":"Management Science"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols, and N. Natraj. Gomory cuts revisited. Operations Research Letters, 19:1\u20139, 1996.","journal-title":"Operations Research Letters"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. Benichou","year":"1971","unstructured":"M. Benichou, J. M. Gauthier, P. Girodet, G. Hentges, G. Ribiere, and O. Vincent. Experiments in mixed-integer programming. Mathematical Pr0gramming, 1:76\u201394, 1971.","journal-title":"Mathematical Pr0gramming"},{"key":"1_CR9","unstructured":"R. E. Bixb. Lectures on Linear Programming. Rice University, Houston, Texas, Spring 1994."},{"key":"1_CR10","unstructured":"R. E. Bixb, S. Ceria, C. McZeal, and M. W. P. Savelsbergh. An updated mixed integer programming library:MIPLIB 3.0. Information on the paper and the problems are available at WWW Page: \n                  http:\/\/www.caam.rice.edu\/~bixby\/miplib\/miplib.html\n                  \n                , 1998."},{"key":"1_CR11","series-title":"Technical report","volume-title":"MIP:Theory and practice closing the gap","author":"R. E. Bixb","year":"1999","unstructured":"R. E. Bixb, M. Fenelon, Z. Guand E. Rothberg, and R. Wunderling. MIP:Theory and practice closing the gap. Technical report, ILOG Inc., Paris, France, 1999."},{"key":"1_CR12","volume-title":"Aspects of Set Packing, Partitioning, and Covering","author":"R. Bornd\u00f6rfer","year":"1998","unstructured":"R. Bornd\u00f6rfer. Aspects of Set Packing, Partitioning, and Covering. PhD thesis, Technische Universit\u00e4t Berlin, 1998."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/S1052623497318682","volume":"9","author":"R. Bornd\u00f6rfer","year":"1998","unstructured":"R. Bornd\u00f6rfer, C. E. Ferreira, and A. Martin. Decomposing matrices into blocks. SIAM Journal on Optimization, 9:236\u2013269, 1998.","journal-title":"SIAM Journal on Optimization"},{"key":"1_CR14","first-page":"45","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"A. Caprara","year":"1997","unstructured":"A. Caprara and M. Fischetti. Branch-and-cut algorithms. In M. Dell'Amico, F. Maffioli, and S. Martello, editors, Annotated Bibliographies in Combinatorial Optimization, pages 45\u201363. John Wiley &Sons Ltd, Chichester, 1997."},{"key":"1_CR15","first-page":"201","volume":"81","author":"S. Ceria","year":"1998","unstructured":"S. Ceria, C. Cordier, H. Marchand, and L. A. Wolsey. Cutting planes for integer programs with general integer variables. Mathematical Programming, 81:201\u2013214, 1998.","journal-title":"Mathematical Programming"},{"key":"1_CR16","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 hierarch of combinatorial problems. Discrete Mathematics, 4:305\u2013337, 1973.","journal-title":"Discrete Mathematics"},{"key":"1_CR17","unstructured":"V. Chv\u00e1tal. Linear Programming. W. H. Freeman and Compan, 1983."},{"key":"1_CR18","unstructured":"J. M. Clochard and D. Naddef. Using path inequalities in a branch-and-cut code for the symmetric traveling salesman problem. In Lawrence Wolsey and Giovanni Rinaldi, editors, Proceedings on the Third IPCO Conference, pages 291\u2013311, 1993."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s101070050092","volume":"86","author":"C. Cordier","year":"1999","unstructured":"C. Cordier, H. Marchand, R. Laundy, and L. A. Wolsey. bc-opt: a branch-and-cut code for mixed integer programs. Mathematical Programming, 86:335\u2013354, 1999.","journal-title":"Mathematical Programming"},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"H. Crowder, E. Johnson, and M. W. Padberg. Solving large-scale zero-one linear programming problems. Operations Research, 31:803\u2013834, 1983.","journal-title":"Operations Research"},{"key":"1_CR21","unstructured":"DASH Associates, Blisworth House, Blisworth, Northants NN7 3BX, United Kingdom. XPRESS-MP Optimisation Subroutine Library, 2001. Information available at \n                  http:\/\/www.dash.co.uk\n                  \n                ."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/0804046","volume":"4","author":"J. Eckstein","year":"1994","unstructured":"J. Eckstein. Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM Journal on Optimization, 4:794\u2013814, 1994.","journal-title":"SIAM Journal on Optimization"},{"key":"1_CR23","volume-title":"On Combinatorial Optimization Problems Arising in Computer System Design","author":"C. E. Ferreira","year":"1994","unstructured":"C. E. Ferreira. On Combinatorial Optimization Problems Arising in Computer System Design. PhD thesis, Technische Universit\u00e4t Berlin, 1994."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1137\/S1052623493254455","volume":"6","author":"C. E. Ferreira","year":"1996","unstructured":"C. E. Ferreira, A. Martin, and R. Weismantel. Solving multiple knapsack problems by cutting planes. SIAM Journal on Optimization, 6:858\u2013877, 1996.","journal-title":"SIAM Journal on Optimization"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R. E. Gomory","year":"1958","unstructured":"R. E. Gomory. Outline of an algorithm for integer solutions to linear programs. Bulletin of the American Society, 64:275\u2013278, 1958.","journal-title":"Bulletin of the American Society"},{"key":"1_CR26","unstructured":"R. E. Gomory. An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Cooperation, 1960."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"R. E. Gomory. Solving linear programming problems in integers. In R. Bellman and M. Hall, editors, Combinatorial analysis, Proceedings of Symposia in Applied Mathematics, volume 10, Providence RI, 1960.","DOI":"10.1090\/psapm\/010\/0114670"},{"key":"1_CR28","unstructured":"R. E. Gomory. An algorithm for integer solutions to linear programming. In R. L. Graves and P. Wolfe, editors, Recent Advances in Mathematical Programming, pages 269\u2013302, New York, 1969. McGraw-Hill."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1287\/ijoc.9.1.73","volume":"9","author":"J. Gondzio","year":"1997","unstructured":"J. Gondzio. Presolve analysis of linear programs prior to apply an interior point method. INFORMS Journal on Computing, 9:73\u201391, 1997.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR30","doi-asserted-by":"publisher","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.","journal-title":"Combinatorica"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer, 1988.","DOI":"10.1007\/978-3-642-97881-4"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/ijoc.11.1.117","volume":"11","author":"Z. Gu","year":"1998","unstructured":"Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh. Cover inequalities for 0.1 linear programs:complexit. INFORMS Journal on Computing, 11:117\u2013123, 1998.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1287\/ijoc.10.4.427","volume":"10","author":"Z. Gu","year":"1998","unstructured":"Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh.Cover inequalities for 0-1 linear programs:computation. INFORMS Journal on Computing, 10:427\u2013437, 1998.","journal-title":"INFORMS Journal on Computing"},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s101070050067","volume":"85","author":"Z. Gu","year":"1999","unstructured":"Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh. Lifted flow cover inequalities for mixed 0-1 integer programs. Mathematical Programming, 85:439\u2013468, 1999.","journal-title":"Mathematical Programming"},{"key":"1_CR35","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/A:1009841107478","volume":"4","author":"Z. Gu","year":"2000","unstructured":"Z. Gu, G. L. Nemhauser, and M. W. P. Savelsbergh. Sequence independent lifting in mixed integer programming. Journal on Combinatorial optimization, 4:109\u2013129, 2000.","journal-title":"Journal on Combinatorial optimization"},{"key":"1_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BF01580442","volume":"8","author":"P. L. Hammer","year":"1975","unstructured":"P. L. Hammer, E.. L. Johnson, and U. N. Peled. Facets of regular 0-1 polytopes. Mathematical Programming, 8:179\u2013206, 1975.","journal-title":"Mathematical Programming"},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1287\/ijoc.3.2.121","volume":"3","author":"K. L. Hoffman","year":"1991","unstructured":"K. L. Hoffman and M. W. Padberg. Improved LP-representations of zero-one linear programs for branch-and-cut. ORSA Journal on Computing, 3:121\u2013134, 1991.","journal-title":"ORSA Journal on Computing"},{"key":"1_CR38","unstructured":"ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Using the CPLEX Callable Library, 1997. Information available at URL \n                  http:\/\/www.cplex.com\n                  \n                ."},{"key":"1_CR39","unstructured":"ILOG CPLEX Division, 889 Alder Avenue, Suite 200, Incline Village, NV 89451, USA. Using the CPLEX Callable Library, 2000. Information available at URL \n                  http:\/\/www.cplex.com\n                  \n                ."},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"1325","DOI":"10.1002\/1097-024X(200009)30:11<1325::AID-SPE342>3.0.CO;2-T","volume":"30","author":"M. J\u00fcnger","year":"2000","unstructured":"J\u00fcnger, M., Thienel, S.: The ABACUS System for Branch and Cut and Price Algorithms in Integer Programming and Combinatorial Optimization. Software Practice and Experience 30, 1325\u20131352, 2000.","journal-title":"Software Practice and Experience"},{"key":"1_CR41","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0167-6377(81)90019-5","volume":"1","author":"E. Johnson","year":"1981","unstructured":"E. Johnson and M. W. Padberg. A note on the knapsack problem with special ordered sets. Operations Research Letters, 1:18\u201322, 1981.","journal-title":"Operations Research Letters"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0167-6377(98)00025-X","volume":"23","author":"D. Klabjan","year":"1998","unstructured":"D. Klabjan, G. L. Nemhauser, and C. Tovey. The complexit of cover inequalit separation. Operations Research Letters, 23:35\u201340, 1998.","journal-title":"Operations Research Letters"},{"key":"1_CR43","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"T. Koch and A. Martin. Solving Steiner tree problems in graphs to optimality. Networks, 32:207\u2013232, 1998.","journal-title":"Networks"},{"key":"1_CR44","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/S0167-5060(08)70352-2","volume":"5","author":"A. Land","year":"1979","unstructured":"A. Land and S. Powell. Computer codes for problems of integer programming. Annals of Discrete Mathematics, 5:221\u2013269, 1979.","journal-title":"Annals of Discrete Mathematics"},{"key":"1_CR45","unstructured":"J. T. Linderoth and M. W. P. Savelsbergh. A computational study of search strategies for mixed integer programming. Technical Report LEC-97-12, Georgia Institute of Technology, 1997."},{"key":"1_CR46","volume-title":"A Polyhedral Study of the Mixed Knapsack Set and its Use to Solve Mixed Integer Programs","author":"H. Marchand","year":"1998","unstructured":"H. Marchand. A Polyhedral Study of the Mixed Knapsack Set and its Use to Solve Mixed Integer Programs. PhD thesis, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 1998."},{"key":"1_CR47","series-title":"Technical Report","volume-title":"Cutting planes in integer and mixed integer programming","author":"H. Marchand","year":"1999","unstructured":"H. Marchand, A. Martin, R. Weismantel, and L. A. Wolsey. Cutting planes in integer and mixed integer programming. Technical Report CORE DP9953, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium, 1999."},{"key":"1_CR48","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"H. Marchand and L. A. Wolsey. The 0-1 knapsack problem with a single continuous variable. Mathematical Programming, 85:15\u201333, 1999.","journal-title":"Mathematical Programming"},{"key":"1_CR49","volume-title":"Habilitations-Schrift","author":"A. Martin","year":"1998","unstructured":"A. Martin. Integer programs with block structure. Habilitations-Schrift, Technische Universit\u00e4t Berlin, 1998."},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"A. Martin and R. Weismantel. The intersection of knapsack polyhedra and extensions. In R. E. Bixb, E. A. Boyd, and R. Z. R\u00edos-Mercado, editors, Integer Programming and Combinatorial Optimization, Proceedings of the 6th IPCO Conference, pages 243\u2013256, 1998.","DOI":"10.1007\/3-540-69346-7_19"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01584658","volume":"4","author":"G. Mitra","year":"1973","unstructured":"G. Mitra. Investigations of some branch and bound strategies for the solution of mixed integer linear programs. Mathematical Programming, 4:155\u2013170, 1973.","journal-title":"Mathematical Programming"},{"key":"1_CR52","unstructured":"D. Naddef. Polyhedral theory and branch-and-cut algorithms for the symmetric tsp. In G. Gutin and A. Punnen, editors, The Traveling Salesman Problem and its Variations. Kluwert, 2001. To appear."},{"key":"1_CR53","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G. L. Nemhauser","year":"1994","unstructured":"G. L. Nemhauser, M. W. P. Savelsbergh, and G. C. Sigismondi. MINTO, a Mixed INTeger Optimizer. Operations Research Letters, 15:47\u201358, 1994.","journal-title":"Operations Research Letters"},{"key":"1_CR54","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0167-6377(94)90038-8","volume":"16","author":"G. L. Nemhauser","year":"1994","unstructured":"G. L. Nemhauser and P. H. Vance. Lifted cover facets of the 0-1 knapsack polytope with GUB constraints. Operations Research Letters, 16:255\u2013263, 1994.","journal-title":"Operations Research Letters"},{"key":"1_CR55","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G. L. Nemhauser","year":"1990","unstructured":"G. L. Nemhauser and L. A. Wolsey. A recursive procedure to generate all cuts for 0-1 mixed integer programs. Mathematical Programming, 46:379\u2013390, 1990.","journal-title":"Mathematical Programming"},{"key":"1_CR56","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":"1_CR57","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M. W. Padberg","year":"1975","unstructured":"M. W. Padberg. A note on zero-one programming. Operations Research, 23:833\u2013837, 1975.","journal-title":"Operations Research"},{"key":"1_CR58","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/BF01588301","volume":"18","author":"M. W. Padberg","year":"1980","unstructured":"M. W. Padberg. (1, k )-configurations and facets for packing problems. Mathematical Programming, 18:94\u201399, 1980.","journal-title":"Mathematical Programming"},{"key":"1_CR59","unstructured":"M. W. Padberg. Linear Optimization and Extensions. Springer, 1995."},{"key":"1_CR60","unstructured":"M. W. Padberg. Classical cuts for mixed-integer programming and branch-and-cut. Technical report, New York University, 2000. To appear in MMOR."},{"key":"1_CR61","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M. W. Padberg","year":"1985","unstructured":"M. W. Padberg, T. J. Van Roy, and L. A. Wolsey. Valid inequalities for fixed charge problems. Operations Research, 33:842\u2013861, 1985.","journal-title":"Operations Research"},{"key":"1_CR62","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1287\/opre.35.1.45","volume":"35","author":"T. J. Roy Van","year":"1987","unstructured":"T. J. Van Roy and L. A. Wolsey. Solving mixed integer programming problems using automatic reformulation. Operations Research, 35:45\u201357, 1987.","journal-title":"Operations Research"},{"key":"1_CR63","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0167-5060(08)70085-2","volume":"9","author":"A. Schrijver","year":"1980","unstructured":"A. Schrijver. On cutting planes. Annals of Discrete Mathematics, 9:291\u2013296,1980.","journal-title":"Annals of Discrete Mathematics"},{"issue":"5","key":"1_CR64","first-page":"49","volume":"22","author":"R. Sharda","year":"1995","unstructured":"Ramesh Sharda. Linear programming solver software for personal computers:1995 report. OR\/MS Today, 22(5):49\u201357, 1995.","journal-title":"OR\/MS Today"},{"key":"1_CR65","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01299207","volume":"3","author":"U. H. Suhl","year":"1994","unstructured":"Uwe H. Suhl and R. Szymanski. Supernode processing of mixed-integer models. Computational Optimization and Applications, 3:317\u2013331, 1994.","journal-title":"Computational Optimization and Applications"},{"key":"1_CR66","unstructured":"Stefan Thienel. ABACUS A Branch-And-CUt System. PhD thesis, Universit\u00e4t zu K\u00f6ln, 1995."},{"key":"1_CR67","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0167-6377(86)90093-3","volume":"5","author":"J. A. Tomlin","year":"1986","unstructured":"J. A. Tomlin and J. S. Welsh. Finding duplicate rows in a linear program. Operations Research Letters, 5:7\u201311, 1986.","journal-title":"Operations Research Letters"},{"key":"1_CR68","first-page":"49","volume":"77","author":"R. Weismantel","year":"1997","unstructured":"R. Weismantel. On the 0\/1 knapsack polytope. Mathematical Programming, 77:49\u201368, 1997.","journal-title":"Mathematical Programming"},{"key":"1_CR69","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L. A. Wolsey","year":"1975","unstructured":"L. A. Wolsey. Faces of linear inequalities in 0-1 variables. Mathematical Programming, 8:165\u2013178, 1975.","journal-title":"Mathematical Programming"},{"key":"1_CR70","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1287\/moor.2.1.66","volume":"2","author":"L. A. Wolsey","year":"1977","unstructured":"L. A. Wolsey. Valid inequalities and superadditivit for 0 \/1 integer programs. Mathematics of Operations Research, 2:66\u201377, 1977.","journal-title":"Mathematics of Operations Research"},{"key":"1_CR71","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(90)90148-6","volume":"29","author":"L. A. Wolsey","year":"1990","unstructured":"L. A. Wolsey. Valid inequalities for 0-1 knapsacks and MIPs with generalized upper bound constraints. Discrete Applied Mathematics, 29:251\u2013261, 1990.","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR72","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1287\/moor.14.4.760","volume":"14","author":"E. Zemel","year":"1989","unstructured":"E. Zemel. Easily computable facets of the knapsack polytope. Mathematics of Operations Research, 14:760\u2013764, 1989.","journal-title":"Mathematics of 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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:40:39Z","timestamp":1558258839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45586-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428770","9783540455868"],"references-count":72,"URL":"https:\/\/doi.org\/10.1007\/3-540-45586-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"19 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}