{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T13:16:47Z","timestamp":1771507007196,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,1,31]],"date-time":"2009-01-31T00:00:00Z","timestamp":1233360000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10107-009-0265-x","type":"journal-article","created":{"date-parts":[[2009,1,30]],"date-time":"2009-01-30T11:57:38Z","timestamp":1233316658000},"page":"315-338","source":"Crossref","is-referenced-by-count":20,"title":["Mingling: mixed-integer rounding with bounds"],"prefix":"10.1007","volume":"123","author":[{"given":"Alper","family":"Atamt\u00fcrk","sequence":"first","affiliation":[]},{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,31]]},"reference":[{"key":"265_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A. Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk A.: On the facets of mixed-integer knapsack polyhedron. Math. Program. 98, 145\u2013175 (2003)","journal-title":"Math. Program."},{"key":"265_CR2","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.1030.0099","volume":"52","author":"A. Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk A.: Sequence independent lifting for mixed-integer programming. Oper. Res. 52, 487\u2013490 (2004)","journal-title":"Oper. Res."},{"key":"265_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10479-005-3442-1","volume":"139","author":"A. Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk A.: Cover and pack inequalities for (mixed) integer programming. Ann. Oper. Res. 139, 21\u201338 (2005)","journal-title":"Ann. Oper. Res."},{"key":"265_CR4","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.: Disjunctive programming. Ann. Discret. Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discret. Math."},{"key":"265_CR5","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. Discret. Math. 4, 305\u2013337 (1973)","journal-title":"Discret. Math."},{"key":"265_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook W., Kannan R., Schrijver A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47, 155\u2013174 (1990)","journal-title":"Math. Program."},{"key":"265_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10107-005-0599-y","volume":"105","author":"S. Dash","year":"2006","unstructured":"Dash S., G\u00fcnl\u00fck O.: Valid inequalities based on simple mixed-integer sets. Math. Program. 105, 29\u201353 (2006)","journal-title":"Math. Program."},{"key":"265_CR8","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The Rand Corporation (1960)"},{"key":"265_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s101070050044","volume":"85","author":"H. Marchand","year":"1999","unstructured":"Marchand H., Wolsey L.A.: The 0-1 knapsack problem with a single continuous variable. Math. Program. 85, 15\u201333 (1999)","journal-title":"Math. Program."},{"key":"265_CR10","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H. Marchand","year":"2001","unstructured":"Marchand H., Wolsey L.A.: Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49, 363\u2013371 (2001)","journal-title":"Oper. Res."},{"key":"265_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"Nemhauser G.L., Wolsey L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"265_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser G.L., Wolsey L.A.: A recursive procedure for generating all cuts for 0-1 mixed integer programs. Math. Program. 46, 379\u2013390 (1990)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0265-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0265-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0265-x.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0265-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,9]],"date-time":"2024-03-09T20:26:00Z","timestamp":1710015960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0265-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,31]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0265-x","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,31]]}}}