{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:45:20Z","timestamp":1742921120090,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":20,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_284","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:01:04Z","timestamp":1219662064000},"page":"1617-1624","source":"Crossref","is-referenced-by-count":0,"title":["Integer Programming"],"prefix":"10.1007","author":[{"given":"Egon","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"284_CR1_284","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E. Balas","year":"1965","unstructured":"Balas E (1965) An additive algorithm for solving linear programs with 0-1 variables. Oper Res 13:517\u2013546","journal-title":"Oper. Res."},{"key":"284_CR2_284","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E (1979) Disjunctive programming. Ann Discret Math 5:3\u201351","journal-title":"Ann. Discret Math."},{"key":"284_CR3_284","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(98)00096-1","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas E (1998) Disjunctive programming: Properties of the convex hull of feasible points. Discrete Appl Math 89:1\u201344, Invited paper with a\u00a0foreword by G. Cornu\u00e9jols and W.R. Pulleyblank. Originally MSRR 348 Carnegie-Mellon Univ., July 1974.","journal-title":"Discrete Appl. Math."},{"key":"284_CR4_284","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E, Ceria. S, Cornu\u00e9jols G (1993) A\u00a0lift-and-project cutting plane algorithm for mixed 0-1 programs. Math Program 58:295\u2013324","journal-title":"Math. Program."},{"key":"284_CR5_284","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1287\/mnsc.42.9.1229","volume":"42","author":"E. Balas","year":"1996","unstructured":"Balas E, Ceria. S, Cornu\u00e9jols G (1996) Mixed 0-1 programming by lift-and-project in a\u00a0branch-and-cut framework. Managem Sci 42:1229\u20131246","journal-title":"Managem. Sci."},{"key":"284_CR6_284","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 (1973) Edmonds polytopes and a\u00a0hierarchy of combinatorial problems. Discret Math 4:305\u2013337","journal-title":"Discret Math."},{"key":"284_CR7_284","doi-asserted-by":"crossref","DOI":"10.1002\/9781118033142","volume-title":"Combinatorial optimization","author":"W.J. Cook","year":"1997","unstructured":"Cook WJ, Cunningham WH, Pulleyblank WR, Schrijver A (1997) Combinatorial optimization. Wiley, New York"},{"key":"284_CR8_284","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds J (1965) Maximum matching and a\u00a0polyhedron with 0-1 vertices. J\u00a0Res Nat Bureau Standards 69B:125\u2013130","journal-title":"J. Res. Nat. Bureau Standards"},{"key":"284_CR9_284","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"R. Gomory","year":"1963","unstructured":"Gomory R (1963) An algorithm for integer solutions to linear programs. In: Graves R, Wolfe P (eds) Recent Advances in Mathematical Programming. McGraw-Hill, New York, pp\u00a0269\u2013302"},{"key":"284_CR10_284","first-page":"223","volume-title":"Linear Inequalities and Related Systems","author":"A.J. Hoffman","year":"1956","unstructured":"Hoffman AJ, Kruskal JB (1956) Integral boundary points of convex polyhedra. In: Kuhn HW, Tucker AW (eds) Linear Inequalities and Related Systems. Princeton Univ. Press, Princeton, pp 223\u2013246"},{"key":"284_CR11_284","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land AH, Doig AG (1960) An automatic method for solving discrete programming problems. Econometrica 28:497\u2013520","journal-title":"Econometrica"},{"volume-title":"The traveling salesman problem: A\u00a0guided tour of combinatorial optimization","year":"1985","key":"284_CR12_284","unstructured":"Lawler EL Lenstra JK, Rinrooy Kan AHG, Shmoys DB (eds) (1985) The traveling salesman problem: A\u00a0guided tour of combinatorial optimization. Wiley, New York"},{"key":"284_CR13_284","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00b4sz","year":"1991","unstructured":"Lov\u00b4sz L, Schrijver A (1991) Cones of matrices and set functions and 0-1 optimization. SIAM J Optim 1:166\u2013190","journal-title":"SIAM J. Optim."},{"key":"284_CR14_284","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"Nemhauser GL, Savelsbergh MWP, Sigismondi G (1994) MINTO, a\u00a0mixed integer optimizer. Oper Res Lett 15:47\u201358","journal-title":"Oper. Res. Lett."},{"key":"284_CR15_284","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey L (1988) Integer and combinatorial optimization. Wiley, New York"},{"key":"284_CR16_284","volume-title":"Discrete optimization","author":"G. Parker","year":"1988","unstructured":"Parker G, Rardin R (1988) Discrete optimization. Acad. Press, New York"},{"key":"284_CR17_284","volume-title":"Theory of linear and integer programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A (1986) Theory of linear and integer programming. Wiley, New York"},{"key":"284_CR18_284","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"H. Sherali","year":"1990","unstructured":"Sherali H, Adams W (1990) A\u00a0hierarchy of relaxations between the continuous and convex hull presentations for 0-1 programming problems. SIAM J Discret Math 3:411\u2013430","journal-title":"SIAM J. Discret Math."},{"key":"284_CR19_284","unstructured":"Thienel S (1995) ABACUS: a\u00a0branch-and-cut system. PhD Thesis Dept. Computer Sci. Univ. Cologne"},{"key":"284_CR20_284","volume-title":"Integer programming","author":"L. Wolsey","year":"1998","unstructured":"Wolsey L (1998) Integer programming. Wiley, New York"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:55:39Z","timestamp":1720691739000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_284","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}