{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T20:28:00Z","timestamp":1723235280676},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,16]],"date-time":"2013-02-16T00:00:00Z","timestamp":1360972800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10589-013-9540-0","type":"journal-article","created":{"date-parts":[[2013,2,15]],"date-time":"2013-02-15T16:15:19Z","timestamp":1360944919000},"page":"545-570","source":"Crossref","is-referenced-by-count":9,"title":["An empirical evaluation of walk-and-round heuristics for mixed integer linear programs"],"prefix":"10.1007","volume":"55","author":[{"given":"Kuo-Ling","family":"Huang","sequence":"first","affiliation":[]},{"given":"Sanjay","family":"Mehrotra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,16]]},"reference":[{"key":"9540_CR1","unstructured":"COIN-OR: Computational infrastructure for operations research. http:\/\/www.coin-or.org\/"},{"key":"9540_CR2","unstructured":"COR@L: Computational optimization research at lehigh http:\/\/coral.ie.lehigh.edu\/mip-instances\/"},{"key":"9540_CR3","unstructured":"IBM ILog Cplex optimizer: http:\/\/www.ibm.com\/"},{"key":"9540_CR4","unstructured":"MIPLIB2003: Mixed integer library (2003). http:\/\/miplib.zib.de\/"},{"issue":"1","key":"9540_CR5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T. Achterberg","year":"2007","unstructured":"Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. 4(1), 77\u201386 (2007)","journal-title":"Discrete Optim."},{"key":"9540_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-1-4613-3449-1_6","volume-title":"Implementation of Interior Point Methods for Large Scale Linear Programming","author":"E.D. Andersen","year":"1996","unstructured":"Andersen, E.D., Gondzio, J., M\u00e9sz\u00e1ros, C., Xu, X.: Implementation of Interior Point Methods for Large Scale Linear Programming, pp. 189\u2013252. Kluwer Academic, Dordrecht (1996). Chap.\u00a06"},{"key":"9540_CR7","unstructured":"Baena, D., Castro, J.: Using the analytic center in the feasibility pump. (2010). http:\/\/www.optimization-online.org\/DB_HTML\/2010\/11\/2793.html"},{"issue":"2","key":"9540_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.49.2.207.13535","volume":"49","author":"E. Balas","year":"2001","unstructured":"Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: Octane: a\u00a0new heuristic for pure 0\u20131 programs. Oper. Res. 49(2), 207\u2013225 (2001)","journal-title":"Oper. Res."},{"issue":"1","key":"9540_CR9","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"E. Balas","year":"1980","unstructured":"Balas, E., Martin, C.H.: Pivot and complement\u2014a heuristic for 0\u20131 programming. Manag. Sci. 26(1), 86\u201396 (1980)","journal-title":"Manag. Sci."},{"key":"9540_CR10","unstructured":"Balas, E., Martin, C.H.: Pivot and shift\u2013a heuristic for mixed integer programming. Tech. rep., GSIA, Carnegie Mellon University (August 1986)"},{"issue":"1","key":"9540_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.disopt.2004.03.001","volume":"1","author":"E. Balas","year":"2004","unstructured":"Balas, E., Schmieta, S., Wallace, C.: Pivot and shift\u2014a mixed integer programming heuristic. Discrete Optim. 1(1), 3\u201312 (2004)","journal-title":"Discrete Optim."},{"key":"9540_CR12","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/opre.1080.0600","volume":"57","author":"S. Baumert","year":"2009","unstructured":"Baumert, S., Ghate, A., Kiatsupaibul, S., Shen, Y., Smith, R.L., Zabinsky, Z.B.: Discrete hit-and-run for sampling points from arbitrary distributions over subsets of integer hyper-rectangles. Oper. Res. 57, 727\u2013739 (2009)","journal-title":"Oper. Res."},{"key":"9540_CR13","doi-asserted-by":"crossref","first-page":"885","DOI":"10.2307\/3214721","volume":"29","author":"C.J.P. Belisle","year":"1992","unstructured":"Belisle, C.J.P.: Convergence theorems for a class of simulated annealing algorithms on\u00a0\u211d d . J.\u00a0Appl. Probab. 29, 885\u2013895 (1992)","journal-title":"J.\u00a0Appl. Probab."},{"issue":"1","key":"9540_CR14","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L. Bertacco","year":"2007","unstructured":"Bertacco, L., Fischetti, M., Lodi, A.: A\u00a0feasibility pump heuristic for general mixed-integer problems. Discrete Optim. 4(1), 63\u201376 (2007)","journal-title":"Discrete Optim."},{"issue":"4","key":"9540_CR15","first-page":"540","volume":"51","author":"D. Bertsimas","year":"2004","unstructured":"Bertsimas, D., Vempala, S.: Solving convex programs by random walks. J.\u00a0ACM 51(4), 540\u2013556 (2004)","journal-title":"J.\u00a0ACM"},{"issue":"1","key":"9540_CR16","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna, E., Rothberg, E., Pape, C.L.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1), 71\u201390 (2005)","journal-title":"Math. Program."},{"key":"9540_CR17","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E. Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"issue":"1","key":"9540_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M. Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005)","journal-title":"Math. Program."},{"issue":"1","key":"9540_CR19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1), 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"9540_CR20","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s12532-009-0007-3","volume":"1","author":"M. Fischetti","year":"2009","unstructured":"Fischetti, M., Salvagnin, D.: Feasibility pump\u00a02.0. Math. Program. Comput. 1, 201\u2013222 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"9540_CR21","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01585158","volume":"62","author":"R. Fourer","year":"1993","unstructured":"Fourer, R., Mehrotra, S.: Solving symmetrical indefinite systems in an interior-point method for linear-programming. Math. Program. 62(1), 15\u201339 (1993)","journal-title":"Math. Program."},{"key":"9540_CR22","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00249643","volume":"6","author":"J. Gondzio","year":"1996","unstructured":"Gondzio, J.: Multiple centrality corrections in a primal-dual method for linear programming. Comput. Optim. Appl. 6, 137\u2013156 (1996)","journal-title":"Comput. Optim. Appl."},{"key":"9540_CR23","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1145\/1536414.1536491","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"R. Kannan","year":"2009","unstructured":"Kannan, R., Narayanan, H.: Random walks on polytopes and an affine interior point method for linear programming. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 561\u2013570 (2009)"},{"key":"9540_CR24","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1145\/258533.258665","volume-title":"Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing","author":"R. Kannan","year":"1997","unstructured":"Kannan, R., Vempala, S.: Sampling lattice points. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 696\u2013700 (1997)"},{"key":"9540_CR25","series-title":"The Art of Computer Programming","volume-title":"Seminumerical Algorithms","author":"D.E. Knuth","year":"1969","unstructured":"Knuth, D.E.: Seminumerical Algorithms. The Art of Computer Programming, vol.\u00a02. Addison-Wesley, Reading (1969)"},{"issue":"3","key":"9540_CR26","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s101070050099","volume":"86","author":"L. Lov\u00e1sz","year":"1999","unstructured":"Lov\u00e1sz, L.: Hit-and-run mixes fast. Math. Program. 86(3), 443\u2013461 (1999)","journal-title":"Math. Program."},{"issue":"4","key":"9540_CR27","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1137\/S009753970544727X","volume":"35","author":"L. Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L., Vempala, S.: Hit-and-run from a corner. SIAM J. Comput. 35(4), 985\u20131005 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9540_CR28","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.jcss.2005.08.004","volume":"72","author":"L. Lov\u00e1sz","year":"2006","unstructured":"Lov\u00e1sz, L., Vempala, S.: Simulated annealing in convex bodies and an O \u2217(n 4) volume algorithm. J.\u00a0Comput. Syst. Sci. 72(2), 392\u2013417 (2006)","journal-title":"J.\u00a0Comput. Syst. Sci."},{"issue":"4","key":"9540_CR29","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"Mehrotra, S.: On the implementation of a primal-dual interior point method. SIAM J. Optim. 2(4), 575\u2013601 (1992)","journal-title":"SIAM J. Optim."},{"issue":"4\u20135","key":"9540_CR30","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1080\/10556788.2011.634911","volume":"27","author":"S. Mehrotra","year":"2012","unstructured":"Mehrotra, S., Huang, K.-L.: Computational experience with a modified potential reduction algorithm for linear programming. Optim. Methods Softw. 27(4\u20135), 865\u2013891 (2012)","journal-title":"Optim. Methods Softw."},{"key":"9540_CR31","unstructured":"Narayanan, H.: Randomized interior point methods for sampling and optimization (2009). http:\/\/arxiv.org\/abs\/arXiv:0911.3950"},{"key":"9540_CR32","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718812","volume-title":"A\u00a0Mathematical View of Interior-Point Methods in Convex Optimization","author":"J. Renegar","year":"2001","unstructured":"Renegar, J.: A\u00a0Mathematical View of Interior-Point Methods in Convex Optimization. SIAM, Philadelphia (2001)"},{"issue":"4","key":"9540_CR33","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/ijoc.1060.0189","volume":"19","author":"E. Rothberg","year":"2007","unstructured":"Rothberg, E.: An evolutionary algorithm for polishing mixed integer programming solutions. INFORMS J. Comput. 19(4), 534\u2013541 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"9540_CR34","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1287\/opre.32.6.1296","volume":"32","author":"R.L. Smith","year":"1984","unstructured":"Smith, R.L.: Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32(6), 1296\u20131308 (1984)","journal-title":"Oper. Res."},{"issue":"1","key":"9540_CR35","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1287\/moor.6.1.19","volume":"6","author":"F.J. Solis","year":"1981","unstructured":"Solis, F.J., Wets, R.J.B.: Minimization by random search techniques. Math. Oper. Res. 6(1), 19\u201330 (1981)","journal-title":"Math. Oper. Res."},{"key":"9540_CR36","first-page":"573","volume":"52","author":"S. Vempala","year":"2005","unstructured":"Vempala, S.: Geometric random walks: a survey. Comb. Comput. Geom. 52, 573\u2013612 (2005)","journal-title":"Comb. Comput. Geom."},{"issue":"1","key":"9540_CR37","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02206815","volume":"62","author":"X. Xu","year":"1996","unstructured":"Xu, X., Hung, P., Ye, Y.: A\u00a0simplified homogeneous and self-dual linear programming algorithm and its implementation. Ann. Oper. Res. 62(1), 151\u2013171 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9540_CR38","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032701","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y. Ye","year":"1997","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis. Wiley, New York (1997)"},{"key":"9540_CR39","unstructured":"Zabinsky, Z.B.: Random search algorithms. Tech. rep., Department of Industrial and Systems Engineering, University of Washington, Seattle, WA (2009)"},{"issue":"2","key":"9540_CR40","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01096737","volume":"3","author":"Z.B. Zabinsky","year":"1993","unstructured":"Zabinsky, Z.B., Smith, R.L., McDonald, J.F., Romeijn, H.E., Kaufman, D.E.: Improving hit-and-run for global optimization. J.\u00a0Glob. Optim. 3(2), 171\u2013192 (1993)","journal-title":"J.\u00a0Glob. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9540-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9540-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9540-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:34Z","timestamp":1559241454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9540-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,16]]},"references-count":40,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9540"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9540-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,16]]}}}