{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T18:19:18Z","timestamp":1695579558039},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,2,3]],"date-time":"2009-02-03T00:00:00Z","timestamp":1233619200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10107-009-0266-9","type":"journal-article","created":{"date-parts":[[2009,2,2]],"date-time":"2009-02-02T13:23:19Z","timestamp":1233580999000},"page":"451-483","source":"Crossref","is-referenced-by-count":6,"title":["Mixing MIR inequalities with two divisible coefficients"],"prefix":"10.1007","volume":"123","author":[{"given":"Miguel","family":"Constantino","sequence":"first","affiliation":[]},{"given":"Andrew J.","family":"Miller","sequence":"additional","affiliation":[]},{"given":"Mathieu","family":"Van Vyve","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,2,3]]},"reference":[{"key":"266_CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.disopt.2005.10.008","volume":"3","author":"A. Agra","year":"2006","unstructured":"Agra A., Constantino M.F.: Description of 2-integer continuous knapsack polyhedra. Discrete Optim. 3, 95\u2013110 (2006)","journal-title":"Discrete Optim."},{"issue":"1","key":"266_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10107-006-0705-9","volume":"109","author":"A. Agra","year":"2007","unstructured":"Agra A., Constantino M.F.: Lifting two-integer knapsack inequalities. Math. Program. 109(1), 115\u2013154 (2007)","journal-title":"Math. Program."},{"key":"266_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E. Balas","year":"1979","unstructured":"Balas E.: Disjunctive programming. Annal. Discrete Math. 5, 3\u201351 (1979)","journal-title":"Annal. Discrete Math."},{"key":"266_CR4","doi-asserted-by":"crossref","unstructured":"Conforti, M., Zambelli, G.: The mixing set with divisible capacities: a simple approach. Working Paper, 2008","DOI":"10.1007\/978-3-540-68891-4_30"},{"key":"266_CR5","first-page":"435","volume-title":"IPCO. Lecture Notes in Computer Science, vol. 5035","author":"M. Conforti","year":"2008","unstructured":"Conforti M., Di Summa M., Wolsey L.A.: The mixing set with divisible capacities. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) IPCO. Lecture Notes in Computer Science, vol. 5035, pp. 435\u2013449. Springer, Heidelberg (2008). ISBN 978-3-540-68886-0"},{"key":"266_CR6","unstructured":"Constantino, M.: A Polyhedral Approach to Production Planning Models: Start-up Costs and Times, and Lower Bounds on Production. PhD thesis, Facult\u00e9 des Sciences, Universit\u00e9 Catholique de Louvain, Belgium (1995)"},{"key":"266_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/moor.23.1.101","volume":"23","author":"M. Constantino","year":"1998","unstructured":"Constantino M.: Lower bounds in lot-sizing models: a polyhedral study. Math. Oper. Res. 23, 101\u2013118 (1998)","journal-title":"Math. Oper. Res."},{"key":"266_CR8","unstructured":"Di Summa, M.: The mixing set with divisible capacities. Working Paper, 2007"},{"key":"266_CR9","unstructured":"Gomory, R.E.: An algorithm for the mixed integer problem. Technical Report RM-2597, The RAND Corporation, 1960"},{"key":"266_CR10","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O. G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck O., Pochet Y.: Mixing MIR inequalities for mixed integer programs. Math. Program. 90, 429\u2013258 (2001)","journal-title":"Math. Program."},{"key":"266_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10107-003-0397-3","volume":"98","author":"A.J. Miller","year":"2003","unstructured":"Miller A.J., Wolsey L.A.: Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. B 98, 73\u201388 (2003)","journal-title":"Math. Program. B"},{"key":"266_CR12","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":"266_CR13","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","volume":"18","author":"Y. Pochet","year":"1993","unstructured":"Pochet Y., Wolsey L.A.: Lot-sizing with constant batches: formulations and valid inequalities. Math. Oper. Res. 18, 767\u2013785 (1993)","journal-title":"Math. Oper. Res."},{"key":"266_CR14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01582225","volume":"67","author":"Y. Pochet","year":"1994","unstructured":"Pochet Y., Wolsey L.A.: Polyhedra for lot\u2013sizing with Wagner\u2013Whitin costs. Math. Program. 67, 297\u2013323 (1994)","journal-title":"Math. Program."},{"key":"266_CR15","unstructured":"Van Vyve, M.: A Solution Approach of Production Planning Problems based on Compact Formulations for Single-Item Lot-Sizing Models. PhD thesis, CORE, Universit\u00e9 Catholique de Louvain, Belgium (2003)"},{"key":"266_CR16","doi-asserted-by":"crossref","unstructured":"Zhao, M., de Farias, I.R.: The mixing-MIR set with two nondivisible capacities. Industrial and Systems Engineering, University of Buffalo (2007a, submitted)","DOI":"10.1007\/s10107-007-0140-6"},{"key":"266_CR17","doi-asserted-by":"crossref","unstructured":"Zhao, M., de Farias, I.R.: The mixing-mir set with divisible capacities. Math. Programm. (2007b, in press)","DOI":"10.1007\/s10107-007-0140-6"},{"key":"266_CR18","unstructured":"Zhao, M., de Farias, I.R.: A note on the continuous mixing polyhedron. Industrial and Systems Engineering, University of Buffalo (2007c, submitted)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0266-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-009-0266-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-009-0266-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:06Z","timestamp":1559123406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-009-0266-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["266"],"URL":"https:\/\/doi.org\/10.1007\/s10107-009-0266-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,2,3]]}}}