{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:14:35Z","timestamp":1746159275004,"version":"3.40.4"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2014,2,1]],"date-time":"2014-02-01T00:00:00Z","timestamp":1391212800000},"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":[[2014,7]]},"DOI":"10.1007\/s10898-014-0148-4","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T20:05:40Z","timestamp":1391198740000},"page":"227-242","source":"Crossref","is-referenced-by-count":4,"title":["Lattice preconditioning for the real relaxation branch-and-bound approach for integer least squares problems"],"prefix":"10.1007","volume":"59","author":[{"given":"Miguel F.","family":"Anjos","sequence":"first","affiliation":[]},{"given":"Xiao-Wen","family":"Chang","sequence":"additional","affiliation":[]},{"given":"Wen-Yang","family":"Ku","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,1]]},"reference":[{"key":"148_CR1","doi-asserted-by":"crossref","unstructured":"Aardal, K., Eisenbrand, F.: The LLL algorithm and integer programming. In: Nguyen, P.Q., Vall\u00e9e, B. (eds.) The LLL Algorithm, Information Security and Cryptography, pp. 293\u2013314. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-02295-1_9"},{"key":"148_CR2","doi-asserted-by":"crossref","unstructured":"Aardal, K., Heymann, F.: On the structure of reduced kernel lattice bases. In: Goemans, M., Correa, J. (eds.) Integer Programming and Combinatorial Optimization, volume 7801 of Lecture Notes in Computer Science, pp. 1\u201312. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-36694-9_1"},{"key":"148_CR3","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. Discret. Appl. Math. 123, 5\u201374 (2002)","journal-title":"Discret. Appl. Math."},{"key":"148_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10107-008-0236-7","volume":"121","author":"K Aardal","year":"2010","unstructured":"Aardal, K., Wolsey, L.A.: Lattice based extended formulations for integer linear equality systems. Math. Program. 121, 337\u2013352 (2010)","journal-title":"Math. Program."},{"key":"148_CR5","doi-asserted-by":"crossref","first-page":"2201","DOI":"10.1109\/TIT.2002.800499","volume":"48","author":"E Agrell","year":"2002","unstructured":"Agrell, E., Eriksson, T., Vardy, A., Zeger, K.: Closest point search in lattices. IEEE Trans. Inf. Theory 48, 2201\u20132214 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"148_CR6","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: Proceedings of STOC, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"key":"148_CR7","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: Sampling short lattice vectors and the closest lattice vector problem. In: Proceedings of CCC, pp. 53\u201357 (2002)","DOI":"10.1109\/CCC.2002.1004339"},{"key":"148_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579403","volume":"6","author":"L Babai","year":"1986","unstructured":"Babai, L.: On L\u00f3vasz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica 6, 1\u201313 (1986)","journal-title":"Combinatorica"},{"key":"148_CR9","doi-asserted-by":"crossref","unstructured":"Bremmer, M.R.: Lattice Basis Reduction, an Introduction to the LLL Algorithm and Its Applications. CRC Press, Boca Raton (2012)","DOI":"10.1201\/b11066"},{"key":"148_CR10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/s10107-011-0475-x","volume":"135","author":"C Buchheim","year":"2012","unstructured":"Buchheim, C., Caprara, A., Lodi, A.: An effective branch-and-bound algorithm for convex quadratic integer programming. Math. Program. 135, 369\u2013395 (2012)","journal-title":"Math. Program."},{"key":"148_CR11","doi-asserted-by":"crossref","first-page":"1071","DOI":"10.1137\/060660680","volume":"31","author":"X-W Chang","year":"2009","unstructured":"Chang, X.-W., Golub, G.H.: Solving ellipsoid-constrained integer least squares problems. SIAM J. Matrix Anal. Appl. 31, 1071\u20131089 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"148_CR12","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1016\/j.apnum.2007.01.008","volume":"57","author":"X-W Chang","year":"2007","unstructured":"Chang, X.-W., Paige, C.C.: Euclidean distances and least squares problems for a given set of vectors. Appl. Numer. Math. 57, 1240\u20131244 (2007)","journal-title":"Appl. Numer. Math."},{"key":"148_CR13","doi-asserted-by":"crossref","first-page":"4915","DOI":"10.1109\/TIT.2013.2253596","volume":"59","author":"X-W Chang","year":"2013","unstructured":"Chang, X.-W., Wen, J., Xie, X.: Effects of the LLL reduction on the success probability of the Babai point and on the complexity of sphere decoding. IEEE Trans. Inf. Theory 59, 4915\u20134926 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"148_CR14","unstructured":"Chang, X.W., Xie, X., Zhou, T.: MILES: MATLAB package for solving Mixed Integer LEast Squares problems, Version 2.0, October 2011. http:\/\/www.cs.mcgill.ca\/~chang\/software.php"},{"key":"148_CR15","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"148_CR16","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F.: Integer programming and algorithmic geometry of numbers. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 505\u2013559. Springer, Berlin (2010)","DOI":"10.1007\/978-3-540-68279-0_14"},{"key":"148_CR17","first-page":"194","volume":"162","author":"U Fincke","year":"1983","unstructured":"Fincke, U., Pohst, M.: A procedure for determining algebraic integers of given norm. Proc. RUROCAL 162, 194\u2013202 (1983)","journal-title":"Proc. RUROCAL"},{"key":"148_CR18","doi-asserted-by":"crossref","unstructured":"Hanrot, G., Pujol, X., Stehle, D.: Algorithms for the shortest and closest lattice vector problems. In: Proceedings of the IWCC, pp. 159\u2013190 (2011)","DOI":"10.1007\/978-3-642-20901-7_10"},{"key":"148_CR19","doi-asserted-by":"crossref","first-page":"2938","DOI":"10.1109\/78.726808","volume":"46","author":"A Hassibi","year":"1998","unstructured":"Hassibi, A., Boyd, S.: Integer parameter estimation in linear models with applications to GPS. IEEE Trans. Signal Process. 46, 2938\u20132952 (1998)","journal-title":"IEEE Trans. Signal Process."},{"key":"148_CR20","unstructured":"IBM, ILOG CPLEX Optimization Studio: http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimization-studio\/"},{"key":"148_CR21","doi-asserted-by":"crossref","unstructured":"Kannan, R.: Improved algorithms for integer programming and related lattice problems. In: Proceedings of the STOC, pp. 99\u2013108 (1983)","DOI":"10.1145\/800061.808749"},{"key":"148_CR22","doi-asserted-by":"crossref","unstructured":"Kisialiou, M., Luo, Z.Q.: Performance analysis of quasi-maximumlikelihood detector based on semi-definite programming. In: Proceedings of the IEEE ICASSP, pp. 433\u2013436 (2005)","DOI":"10.1109\/ICASSP.2005.1415739"},{"key":"148_CR23","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1016\/j.disopt.2009.01.003","volume":"6","author":"B Krishnamoorthy","year":"2009","unstructured":"Krishnamoorthy, B., Pataki, G.: Column basis reduction and decomposable knapsack problems. Discret. Optim. 6, 242\u2013270 (2009)","journal-title":"Discret. Optim."},{"key":"148_CR24","unstructured":"Ku, W.Y.: Lattice Preconditioning for the Real Relaxation Based Branch and Bound Method for Integer Least Squares Problems. MSc Thesis, School of Computer Science, McGill University (2011)"},{"key":"148_CR25","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen 261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"148_CR26","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"HW Lenstra Jr","year":"1983","unstructured":"Lenstra Jr, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"148_CR27","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1007\/s10898-010-9554-4","volume":"49","author":"S Mehrotra","year":"2011","unstructured":"Mehrotra, S., Li, Z.: Branching on hyperplane methods for mixed integer linear and convex programming using adjoint lattices. J. Glob. Optim. 49, 623\u2013649 (2011)","journal-title":"J. Glob. Optim."},{"key":"148_CR28","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: Proceedings of SODA, pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"key":"148_CR29","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/100811970","volume":"42","author":"D Micciancio","year":"2013","unstructured":"Micciancio, D., Voulgaris, P.: A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations. SIAM J. Comput. 42, 1364\u20131391 (2013)","journal-title":"SIAM J. Comput."},{"key":"148_CR30","doi-asserted-by":"crossref","unstructured":"Pataki, G., Tural, M., Wong, E.B.: Basis reduction and the complexity of branch-and-bound. In: Proceedings of SODA, pp. 1254\u20131261 (2010)","DOI":"10.1137\/1.9781611973075.100"},{"key":"148_CR31","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"CP Schnorr","year":"1994","unstructured":"Schnorr, C.P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66, 181\u2013199 (1994)","journal-title":"Math. Program."},{"key":"148_CR32","doi-asserted-by":"crossref","unstructured":"Schnorr, C.P.: Progress on lll and lattice reduction. In: Nguyen, P.Q., Vall\u00e9e, B. (eds.) The LLL Algorithm, Information Security and Cryptography, pp. 145\u2013178. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-02295-1_4"},{"key":"148_CR33","doi-asserted-by":"crossref","first-page":"1442","DOI":"10.1109\/49.942507","volume":"19","author":"P Tan","year":"2001","unstructured":"Tan, P., Rasmussen, L.K.: The application of semidefinite programming for detection in CDMA. IEEE J. Sel. Areas Commun. 19, 1442\u20131449 (2001)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"148_CR34","doi-asserted-by":"crossref","unstructured":"Teunissen, P.J.G., Kleusberg, A.: GPS for Geodesy. Springer, Berlin (1998)","DOI":"10.1007\/978-3-642-72011-6"},{"key":"148_CR35","unstructured":"van Emde Boas, P.: Another NP-Complete Partition Problem and the Complexity of Computing Short Vectors in a Lattice. Technical Report Rep. 81\u201304, Mathematics Institute, Amsterdam, The Netherlands (1981)"},{"key":"148_CR36","unstructured":"Xie, X., Chang, X.W., Al Borno, M.: Partial LLL reduction. In: Proceedings of IEEE GLOBECOM, 5 pp (2011)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0148-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0148-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0148-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T18:42:01Z","timestamp":1746124921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0148-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,1]]},"references-count":36,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["148"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0148-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2014,2,1]]}}}