{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T18:20:28Z","timestamp":1695579628774},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"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":[[2008,9]]},"DOI":"10.1007\/s10107-007-0140-6","type":"journal-article","created":{"date-parts":[[2007,6,19]],"date-time":"2007-06-19T07:10:19Z","timestamp":1182237019000},"page":"73-103","source":"Crossref","is-referenced-by-count":17,"title":["The mixing-MIR set with divisible capacities"],"prefix":"10.1007","volume":"115","author":[{"given":"M.","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr","given":"I. R.","family":"de Farias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"140_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10107-004-0558-z","volume":"102","author":"K. Andersen","year":"2005","unstructured":"Andersen K., Cornu\u00e9jols G. and Li Y. (2005). Split closure and intersection cuts. Math. Program. 102: 457\u2013493","journal-title":"Math. Program."},{"key":"140_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/opre.19.1.19","volume":"19","author":"E. Balas","year":"1971","unstructured":"Balas E. (1971). Intersection cuts\u2014a new type of cutting planes for integer programming. Oper. Res. 19: 19\u201339","journal-title":"Oper. Res."},{"key":"140_CR3","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01580440","volume":"8","author":"E. Balas","year":"1975","unstructured":"Balas E. (1975). Facets of the knapsack polytope. Math. Program. 8: 146\u2013164","journal-title":"Math. Program."},{"key":"140_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. (1979). Disjunctive programming. Ann. Discrete Math. 5: 3\u201351","journal-title":"Ann. Discrete Math."},{"key":"140_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E. Balas","year":"1998","unstructured":"Balas E. (1998). Disjunctive programming: properties of the convex hull of the feasible points. Discrete Appl. Math. 89: 3\u201344","journal-title":"Discrete Appl. Math."},{"key":"140_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E. Balas","year":"1993","unstructured":"Balas E., Ceria S. and Cornu\u00e9jols G. (1993). A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Program. 58: 295\u2013324","journal-title":"Math. Program."},{"key":"140_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-6377(96)00007-7","volume":"19","author":"E. Balas","year":"1996","unstructured":"Balas E., Ceria S., Cornu\u00e9jols G. and Natraj G. (1996). Gomory cuts revisited. Oper. Res. Lett. 19: 1\u20139","journal-title":"Oper. Res. Lett."},{"key":"140_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S1052623402420346","volume":"15","author":"D. Bienstock","year":"2004","unstructured":"Bienstock D. and Zuckerberg M. (2004). Subset\u00a0algebra lift operators for 0-1 integer programming. SIAM J. Optim. 15: 63\u201395","journal-title":"SIAM J. Optim."},{"key":"140_CR9","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/978-0-387-35514-6_2","volume-title":"System Modeling and Optimization","author":"R.E Bixby","year":"2000","unstructured":"Bixby R.E., Fenelon M., Gu Z., Rothberg E., Wunderling R. (2000) MIP: Theory and practice\u2014closing the gap. In: Powell, M.J.D., Scholtes, S. (eds.) System Modeling and Optimization. Kluwer, Dordrecht, pp. 19\u201349"},{"key":"140_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A. Caprara","year":"2003","unstructured":"Caprara A. and Letchford A.N. (2003). On the separation of split cuts and related inequalities. Math. Program. 94: 279\u2013294","journal-title":"Math. Program."},{"key":"140_CR11","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 hierarchy of combinatorial problems. Discrete Math. 4: 305\u2013337","journal-title":"Discrete Math."},{"key":"140_CR12","volume-title":"Compact formulations as a union of Polyhedra. CORE Discussion Paper 62","author":"M. Conforti","year":"2005","unstructured":"Conforti M. and Wolsey L.A. (2005). Compact formulations as a union of Polyhedra. CORE Discussion Paper 62. Universit\u00e9 Catholique de Louvain, Louvain"},{"key":"140_CR13","volume-title":"Mixing MIR Inequalities with Two Divisible Coefficients. Working Paper","author":"M. Constantino","year":"2006","unstructured":"Constantino M., Miller A.J. and van Vyve M. (2006). Mixing MIR Inequalities with Two Divisible Coefficients. Working Paper. University of Wisconsin, Wisconsin"},{"key":"140_CR14","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W. Cook","year":"1990","unstructured":"Cook W., Kannan R. and Schrijver A. (1990). Chv\u00e1tal closures for mixed integer programs. Math. Program. 47: 155\u2013174","journal-title":"Math. Program."},{"key":"140_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G. Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols G. and Li Y. (2001). Elementary closures for integer programs. Oper. Res. Lett. 28: 1\u20138","journal-title":"Oper. Res. Lett."},{"key":"140_CR16","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1287\/opre.7.1.58","volume":"7","author":"G.B. Dantzig","year":"1959","unstructured":"Dantzig G.B., Fulkerson D.R. and Johnson S.M. (1959). On a linear-programming, combinatorial approach to the traveling-salesman problem. Oper. Res. 7: 58\u201366","journal-title":"Oper. Res."},{"key":"140_CR17","volume-title":"The Mixing Set with Divisible Capacities. Working Paper","author":"M. di Summa","year":"2007","unstructured":"di Summa M. (2007). The Mixing Set with Divisible Capacities. Working Paper. University of Padua, Italy"},{"key":"140_CR18","first-page":"12","volume-title":"Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Vol. 3509","author":"M. Fischetti","year":"2005","unstructured":"Fischetti M., Lodi, A. (2005) Optimizing over the First Chv\u00e1tal Closure. In: J\u00fcnger M., Kaibel V. (eds.) Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Vol. 3509, Springer, Berlin, pp. 12\u201322"},{"key":"140_CR19","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1090\/S0002-9904-1958-10224-4","volume":"64","author":"R.E. Gomory","year":"1958","unstructured":"Gomory R.E. (1958). Outline of an algorithm for integer solutions to linear programs. Bull. Am. Math. Soc. 64: 275\u2013278","journal-title":"Bull. Am. Math. Soc."},{"key":"140_CR20","unstructured":"Gomory, R.E.: An Algorithm for the Mixed Integer Problem. RM-2597, The RAND Corporation (1960)"},{"key":"140_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel M., Lovasz L. and Schrijver A. (1981). The ellipsoid method and its consequences in combinatorial optimization. Combinatorica. 1: 169\u2013197","journal-title":"Combinatorica."},{"key":"140_CR22","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O. G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck O. and Pochet Y. (2001). Mixing mixed-integer inequalities. Math. Program. 90: 429\u2013457","journal-title":"Math. Program."},{"key":"140_CR23","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. and Peled U.N. (1975). Facets of regular 0-1 polytopes. Math. Program. 8: 179\u2013206","journal-title":"Math. Program."},{"key":"140_CR24","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L. Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz L. and Schrijver A. (1991). Cones of matrices and set functions for 0-1 optimization. SIAM J. Optim. 1: 166\u2013190","journal-title":"SIAM J. Optim."},{"key":"140_CR25","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/S0166-218X(01)00348-1","volume":"123","author":"H. Marchand","year":"2002","unstructured":"Marchand H., Martin A., Weismantel R. and Wolsey L.A. (2002). Cutting planes in integer and mixed integer programming. Discrete Appl. Math. 123: 397\u2013446","journal-title":"Discrete Appl. Math."},{"key":"140_CR26","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. and Wolsey L.A. (2001). Aggregation and mixed integer rounding to solve MIPs. Oper. Res. 49: 363\u2013371","journal-title":"Oper. Res."},{"key":"140_CR27","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/inte.27.2.17","volume":"27","author":"R.O. Mason","year":"1996","unstructured":"Mason R.O., McKenney J.L., Carlson W. and Copeland D.C. (1996). Absolutely, positively operations research: the federal express story. Interfaces. 27: 17\u201336","journal-title":"Interfaces."},{"key":"140_CR28","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/s10107-003-0397-3","volume":"98","author":"A.J. Miller","year":"2003","unstructured":"Miller A.J. and Wolsey L.A. (2003). Tight formulations for some simple mixed integer programs and convex objective integer programs. Math. Program. 98: 73\u201388","journal-title":"Math. Program."},{"key":"140_CR29","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and combinatorial optimization. Wiley, New York (1988)","DOI":"10.1002\/9781118627372"},{"key":"140_CR30","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"G.L. Nemhauser","year":"1990","unstructured":"Nemhauser G.L. and Wolsey L.A. (1990). A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Program. 46: 379\u2013390","journal-title":"Math. Program."},{"key":"140_CR31","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0166-218X(95)90600-K","volume":"59","author":"Y. Pochet","year":"1995","unstructured":"Pochet Y. and Wolsey L.A. (1995). Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separation. Discrete Appl. Math. 59: 57\u201374","journal-title":"Discrete Appl. Math."},{"key":"140_CR32","volume-title":"Production Planning by Mixed Integer Programming","author":"Y. Pochet","year":"2005","unstructured":"Pochet Y. and Wolsey L.A. (2005). Production Planning by Mixed Integer Programming. Springer, Berlin"},{"key":"140_CR33","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0166-218X(92)00190-W","volume":"52","author":"H.D. Sherali","year":"1994","unstructured":"Sherali H.D. and Adams W.P. (1994). A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52: 83\u2013106","journal-title":"Discrete Appl. Math."},{"key":"140_CR34","unstructured":"van Vyve, M.: A Solution Approach of Production Planning Based on Compact Formulations for Single-item Lot-Sizing Models. Ph.D. Dissertation, Universit\u00e9 Catholique de Louvain, Belgium (2003)"},{"key":"140_CR35","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1287\/moor.1040.0130","volume":"30","author":"M. van Vyve","year":"2005","unstructured":"van Vyve M. (2005). The continuous mixing polyhedron. Math. Oper. Res. 30: 441\u2013452","journal-title":"Math. Oper. Res."},{"key":"140_CR36","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/BF01580441","volume":"8","author":"L.A. Wolsey","year":"1975","unstructured":"Wolsey L.A. (1975). Faces for a linear inequality in 0-1 variables. Math. Program. 8: 165\u2013178","journal-title":"Math. Program."},{"key":"140_CR37","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0450-2","volume":"97","author":"L.A. Wolsey","year":"2003","unstructured":"Wolsey L.A. (2003). Strong formulations for mixed integer programs: valid inequalities and extended formulations. Math. Program. 97: 423\u2013447","journal-title":"Math. Program."},{"key":"140_CR38","volume-title":"The Polar of a Simple Mixed-Integer Set. Working Paper","author":"M. Zhao","year":"2005","unstructured":"Zhao M. and de Farias I.R. (2005). The Polar of a Simple Mixed-Integer Set. Working Paper. State University of New York, New York"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0140-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0140-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0140-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0140-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T12:12:42Z","timestamp":1581941562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0140-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0140-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,20]]}}}