{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T13:58:13Z","timestamp":1712411893499},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,5,15]],"date-time":"2010-05-15T00:00:00Z","timestamp":1273881600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10898-010-9554-4","type":"journal-article","created":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T13:08:16Z","timestamp":1273842496000},"page":"623-649","source":"Crossref","is-referenced-by-count":9,"title":["Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices"],"prefix":"10.1007","volume":"49","author":[{"given":"Sanjay","family":"Mehrotra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,15]]},"reference":[{"key":"9554_CR1","doi-asserted-by":"crossref","unstructured":"Aardal, K., Hurkens, C., Lenstra, A.K.: Solving a Linear Diophantine Equation with Lower and Upper Bounds on the Variables. LNCS, vol. 1412, pp. 229\u2013242 (1998)","DOI":"10.1007\/3-540-69346-7_18"},{"key":"9554_CR2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1287\/moor.25.3.427.12219","volume":"25","author":"K. Aardal","year":"2000","unstructured":"Aardal K., Hurkens C.A.J., Lenstra A.K.: Solving a system of diophantine equation with lower and upper bounds on the variables. Math. Oper. Res. 25, 427\u2013442 (2000)","journal-title":"Math. Oper. Res."},{"key":"9554_CR3","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1287\/ijoc.12.3.192.12635","volume":"12","author":"K. Aardal","year":"2000","unstructured":"Aardal K., Bixby R., Hurkens C., Lenstra A.K., Smeltink J.: Market split and basis reduction: towards a solution of the Cornu\u00e9jols\u2013Dawande instances. INFORMS J. Comput. 12, 192\u2013202 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9554_CR4","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1287\/moor.1040.0099","volume":"29","author":"K. Aardal","year":"2004","unstructured":"Aardal K., Lenstra A.K.: Hard equality constrained integer knapsacks. Math. Oper. Res. 29(3), 724\u2013738 (2004)","journal-title":"Math. Oper. Res."},{"key":"9554_CR5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0166-218X(01)00337-7","volume":"123","author":"K. Aardal","year":"2002","unstructured":"Aardal K., Weismantel R., Wolsey L.A.: Non-standard approaches to integer programming. Discrete Applied Mathematics 123, 5\u201374 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"9554_CR6","first-page":"16","volume":"4513","author":"A. Atamt\u00fcrk","year":"2007","unstructured":"Atamt\u00fcrk A., Narayanan V.: Cuts for Conic Mixed-Integer Programming. LCNS 4513, 16\u201329 (2007)","journal-title":"LCNS"},{"issue":"1","key":"9554_CR7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/S1052623497318013","volume":"9","author":"K.M. Anstreicher","year":"1998","unstructured":"Anstreicher K.M.: Towards a practical volumetric cutting plane method for convex programming. SIAM J. Optim. 9(1), 190\u2013206 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9554_CR8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/moor.24.1.193","volume":"24","author":"K.M. Anstreicher","year":"1999","unstructured":"Anstreicher K.M.: Ellipsoidal approximations of convex sets based on the volumetric barrier. Math. Oper. Res. 24(1), 193\u2013203 (1999)","journal-title":"Math. Oper. Res."},{"key":"9554_CR9","unstructured":"Anstreicher, K.M.: Improved complexity for maximum volume inscribed ellipsoids, technical report. Departemnt of Management Science, University of Iowa, Iowa City (2001)"},{"issue":"1","key":"9554_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"9554_CR11","unstructured":"Bertsimas D., Tsitsiklis J.J.: Introduction to linear optimization. Athena Scientific (1997)"},{"key":"9554_CR12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF01388911","volume":"88","author":"J. Bourgain","year":"1987","unstructured":"Bourgain J., Milman V.D.: New volume ratio properties for convex symmetric bodies in $${\\mathbb R^n}$$ . Inventiones Mathematicae 88, 319\u2013340 (1987)","journal-title":"Inventiones Mathematicae"},{"key":"9554_CR13","volume-title":"Geometric Inequalities","author":"Y.D. Burago","year":"1980","unstructured":"Burago Y.D., Zalgaller V.A.: Geometric Inequalities. Springer, Berlin (1980)"},{"key":"9554_CR14","volume-title":"An introduction to the Geometry of Numbers","author":"J.W.S. Cassels","year":"1971","unstructured":"Cassels J.W.S.: An introduction to the Geometry of Numbers. Springer, Berlin (1971)"},{"key":"9554_CR15","unstructured":"CPLEX, CPLEX User\u2019s Manual. www.ilog.com"},{"key":"9554_CR16","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Liberti, L., Nannicini, G.: Improved strategies for branching on general disjunctions. Mathematical Programming A (to appear) (2010)","DOI":"10.1007\/s10107-009-0333-2"},{"key":"9554_CR17","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/ijoc.5.2.206","volume":"5","author":"W. Cook","year":"1993","unstructured":"Cook W., Rutherford T., Scarf H.E., Shallcross D.: An implementation of the generalized basis reduction algorithm for integer programming. ORSA J Comput 5, 206\u2013215 (1993)","journal-title":"ORSA J Comput"},{"key":"9554_CR18","unstructured":"Gao, L., Zhang, Y.: Computational Experience with Lenstra\u2019s Algorithm, TR02-12, Department of Computational and Applied Mathematics, Rice University (2002)"},{"key":"9554_CR19","unstructured":"John, F.: Extremum problems with inequalities as subsidiary conditions. In: Studies and Essays, Presented to R. Courant on his 60th Birthday, pp. 187\u2013204. Wiley, New York (1948)"},{"key":"9554_CR20","unstructured":"Karamanov, M., Cornu\u00e9jols, G.: Branching on General Disjunctions. Mathematical Programming A (to appear) (2010)"},{"issue":"2","key":"9554_CR21","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1287\/moor.21.2.307","volume":"21","author":"L.G. Khachiyan","year":"1996","unstructured":"Khachiyan L.G.: Rounding of polytopes in the real number model of computation. Math. Oper. Res. 21(2), 307\u2013320 (1996)","journal-title":"Math. Oper. Res."},{"key":"9554_CR22","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF01582144","volume":"61","author":"L.G. Khachiyan","year":"1993","unstructured":"Khachiyan L.G., Todd M.J.: On the complexity of approximating the maximal volume inscribed ellipsoid for a polytope. Math. Program. 61, 137\u2013159 (1993)","journal-title":"Math. Program."},{"key":"9554_CR23","doi-asserted-by":"crossref","unstructured":"Krishnamoorthy, B., Pataki, G.:Column basis reduction, and decomposable knapsack problems. Discrete Optimization (to appear) (2008)","DOI":"10.1016\/j.disopt.2009.01.003"},{"key":"9554_CR24","doi-asserted-by":"crossref","unstructured":"Koy, H., Schnorr, C.P.: Segment LLL-reduction of lattice bases. In: Lecture Notes in Computer Science, vol. 2146, pp. 67\u201380 (2001)","DOI":"10.1007\/3-540-44670-2_7"},{"key":"9554_CR25","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra A.K., Lenstra H.W., Lov\u00e1sz L.: Factoring polynomials with rational coefficients. Math. Ann. 261, 515\u2013534 (1982)","journal-title":"Math. Ann."},{"issue":"4","key":"9554_CR26","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra","year":"1983","unstructured":"Lenstra H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"9554_CR27","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L.: An algorithmic theory of numbers, Graphs and Convexity. SIAM (1986)","DOI":"10.1137\/1.9781611970203"},{"issue":"3","key":"9554_CR28","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1287\/moor.17.3.751","volume":"17","author":"L. Lov\u00e1sz","year":"1992","unstructured":"Lov\u00e1sz L., Lov\u00e1sz L., Lov\u00e1sz L.: The generalized basis reduction algorithm. Math. Oper. Res. 17(3), 751\u2013764 (1992)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"9554_CR29","first-page":"351","volume":"5","author":"Z. Li","year":"2007","unstructured":"Li Z., Mehrotra S.: An example to demonstrate the importance of using ellipsoidal norm in lattice basis reduction for branching on hyperplane algorithms. Pacific J. Optim. 5(2), 351\u2013365 (2007)","journal-title":"Pacific J. Optim."},{"key":"9554_CR30","doi-asserted-by":"crossref","unstructured":"Mahajan, A., Ralphs, T.K.: Experiments with branching using general disjunctions. In: Chinneck, J.W., Kristjansson, B., Saltzman, M.J. (eds.) Operations Research\/Computer Science Interfaces (Chapter 6) (2009)","DOI":"10.1007\/978-0-387-88843-9_6"},{"key":"9554_CR31","unstructured":"Mahajan, A., Ralphs, T.K.: On the complexity of selecting branching disjunctions in integer programming. Technical Report, Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA 18015 (2008)"},{"key":"9554_CR32","unstructured":"Mehrotra, S., Li, Z.: Segment LLL reduction of latice bases using modular arithmetic. IE\/MS technical report, Northwestern University, Evanston, IL 60208 (2001)"},{"key":"9554_CR33","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF01585180","volume":"62","author":"S. Mehrotra","year":"1993","unstructured":"Mehrotra S., Ye Y.: Finding an interior point in the optimal face of linear programs. Math. Program. 62, 497\u2013515 (1993)","journal-title":"Math. Program."},{"key":"9554_CR34","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Algorithms in Convex Programming","author":"Y.E. Nesterov","year":"1994","unstructured":"Nesterov Y.E., Nemirovski A.S.: Interior Point Polynomial Algorithms in Convex Programming. SIAM Publications, SIAM Philadelphia, USA (1994)"},{"issue":"1","key":"9554_CR35","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1011207119557","volume":"20","author":"J. Owen","year":"2001","unstructured":"Owen J., Mehrotra S.: Experimental results on using general disjunctions in branch-and-bound for general-integer linear programs. Comp. Optim. Appl. 20(1), 159\u2013170 (2001)","journal-title":"Comp. Optim. Appl."},{"key":"9554_CR36","first-page":"369","volume-title":"Interior Point methods of Mathematical Programming","author":"P.M. Pardalos","year":"1996","unstructured":"Pardalos P.M., Ramana M.: Semidefinite programming. In: Terlaky, T. (eds) Interior Point methods of Mathematical Programming. pp. 369\u2013398. Kluwer, Dordrecht (1996)"},{"key":"9554_CR37","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/978-1-4613-3449-1_12","volume-title":"Interior Point methods of Mathematical Programming","author":"P.M. Pardalos","year":"1996","unstructured":"Pardalos P.M., Resende M.G.C.: Interior point methods for global optimization. In: Terlaky, T. (eds) Interior Point methods of Mathematical Programming, pp. 467\u2013500. Kluwer, Dordrecht (1996)"},{"key":"9554_CR38","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M., Wolkowicz, H. (eds) Topics in semidefinite and interior-point methods. Fields Institute Communications Series, vol. 18, American Mathematical Society (1998)","DOI":"10.1090\/fic\/018"},{"key":"9554_CR39","first-page":"59","volume":"40","author":"J. Renegar","year":"2001","unstructured":"Renegar J.: A mathematical view of interior-point methods in convex optimization. MPS-SIAM Ser. Optim. 40, 59\u201393 (2001)","journal-title":"MPS-SIAM Ser. Optim."},{"key":"9554_CR40","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"9554_CR41","first-page":"226","volume":"27","author":"S.P. Tarasov","year":"1988","unstructured":"Tarasov S.P., Khachiyan L.G., Erlich I.I.: The method of inscribed ellipsoids. Soviet Math. Doklady 27, 226\u2013230 (1988)","journal-title":"Soviet Math. Doklady"},{"key":"9554_CR42","first-page":"291","volume":"73","author":"P.M. Vaidya","year":"1996","unstructured":"Vaidya P.M.: A new algorithm for minimizing convex functions over convex sets. Math. Program. 73, 291\u2013341 (1996)","journal-title":"Math. Program."},{"key":"9554_CR43","unstructured":"Wang, X.: An implementation of the generalized basis reduction algorithm for convex integer programming. Ph.D. dissertation, Department of Economics, Yale University (1997)"},{"key":"9554_CR44","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581087","volume":"57","author":"Y. Ye","year":"1992","unstructured":"Ye Y.: On the convergence of interior-point algorithms for linear programming. Math. Program. 57, 325\u2013335 (1992)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9554-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9554-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9554-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:55Z","timestamp":1559278735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9554-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,15]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9554"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9554-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,15]]}}}