{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T13:04:39Z","timestamp":1751634279790},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,9,12]],"date-time":"2014-09-12T00:00:00Z","timestamp":1410480000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10589-014-9693-5","type":"journal-article","created":{"date-parts":[[2014,9,11]],"date-time":"2014-09-11T09:18:57Z","timestamp":1410427137000},"page":"559-585","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs"],"prefix":"10.1007","volume":"60","author":[{"given":"Kuo-Ling","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,12]]},"reference":[{"key":"9693_CR1","unstructured":"Abhishek, K., Leyffer, S., Linderoth, J.: Feasibility Pump Heuristics for Mixed Integer Nonlinear Programs. Unpublished working paper (2008)"},{"issue":"1","key":"9693_CR2","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. Discret. Optim. 4(1), 77\u201386 (2007)","journal-title":"Discret. Optim."},{"key":"9693_CR3","unstructured":"AMPL: A modeling language for mathematical programming. www.ampl.com"},{"issue":"3","key":"9693_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1023\/A:1018369223322","volume":"10","author":"E Andersen","year":"1998","unstructured":"Andersen, E., Ye, Y.: A computational study of the homogeneous algorithm for large-scale convex optimization. Comput. Optim. Appl. 10(3), 243\u2013269 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"9693_CR5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s101070050027","volume":"84","author":"E Andersen","year":"1999","unstructured":"Andersen, E., Ye, Y.: On a homogeneous algorithm for the monotone complementarity problem. Math. Program. 84, 375\u2013399 (1999)","journal-title":"Math. Program."},{"issue":"5","key":"9693_CR6","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.orl.2011.07.005","volume":"39","author":"D Baena","year":"2011","unstructured":"Baena, D., Castro, J.: Using the analytic center in the feasibility pump. Oper. Res. Lett. 39(5), 310\u2013317 (2011)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9693_CR7","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 new heuristic for pure 0\u20131 programs. Oper. Res. 49(2), 207\u2013225 (2001)","journal-title":"Oper. Res."},{"key":"9693_CR8","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."},{"issue":"1","key":"9693_CR9","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 feasibility pump heuristic for general mixed-integer problems. Discret. Optim. 4(1), 63\u201376 (2007)","journal-title":"Discret. Optim."},{"issue":"4","key":"9693_CR10","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/1008731.1008733","volume":"51","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Vempala, S.: Solving convex programs by random walks. J. ACM 51(4), 540\u2013556 (2004)","journal-title":"J. ACM"},{"issue":"2","key":"9693_CR11","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10589-010-9350-6","volume":"51","author":"P Bonami","year":"2012","unstructured":"Bonami, P., Gon\u00e7alves, J.: Heuristics for convex mixed integer nonlinear programs. Comput. Optim. Appl. 51(2), 729\u2013747 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"9693_CR12","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Kilin\u00e7, M., Linderoth, J.: Algorithms and software for convex MINLP. Discret. Optim. 5, 186\u2013204 (2008)","journal-title":"Discret. Optim."},{"key":"9693_CR13","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/s10107-008-0212-2","volume":"119","author":"P Bonami","year":"2009","unstructured":"Bonami, P., Cornu\u00e9jols, G., Lodi, A., Margot, F.: A feasibility pump for mixed integer nonlinear programs. Math. Program. 119, 331\u2013352 (2009)","journal-title":"Math. Program."},{"key":"9693_CR14","unstructured":"CMU-IBM open source MINLP project. http:\/\/egon.cheme.cmu.edu\/ibm\/page.htm"},{"key":"9693_CR15","unstructured":"COIN-OR Ipopt. http:\/\/www.coin-or.org\/ipopt\/"},{"key":"9693_CR16","doi-asserted-by":"crossref","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. Lecture Notes in Computer Science, vol. 6049, pp. 350\u2013360 (2010)","DOI":"10.1007\/978-3-642-13193-6_30"},{"issue":"2","key":"9693_CR17","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-012-0608-x","volume":"136","author":"C D\u2019Ambrosio","year":"2012","unstructured":"D\u2019Ambrosio, C., Frangioni, A., Liberti, L., Lodi, A.: A storm of feasibility pumps for nonconvex minlp. Math. Program. 136(2), 375\u2013402 (2012)","journal-title":"Math. Program."},{"issue":"1","key":"9693_CR18","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.: Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Program. 102(1), 71\u201390 (2005)","journal-title":"Math. Program."},{"key":"9693_CR19","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":"9693_CR20","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":"9693_CR21","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 2.0. Math. Program. Comput. 1, 201\u2013222 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"9693_CR22","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."},{"key":"9693_CR23","unstructured":"Hans D. Mittelmann\u2019s MIQP test problems. http:\/\/plato.asu.edu\/ftp\/miqp.html"},{"key":"9693_CR24","unstructured":"Huang, K.-L., Mehrotra, S.: An empirical evaluation of walk-and-round heuristics for mixed integer linear programs. Comput. Optim. Appl. 55(3), 545\u2013570 (2013)"},{"key":"9693_CR25","unstructured":"Huang, K.-L., Mehrotra, S.: Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method. http:\/\/www.optimization-online.org\/DB_HTML\/2012\/04\/3431.html (2012)"},{"key":"9693_CR26","unstructured":"IBM Cplex optimizer. http:\/\/www.ibm.com\/"},{"key":"9693_CR27","doi-asserted-by":"crossref","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)","DOI":"10.1145\/1536414.1536491"},{"key":"9693_CR28","doi-asserted-by":"crossref","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)","DOI":"10.1145\/258533.258665"},{"issue":"3","key":"9693_CR29","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":"9693_CR30","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":"4","key":"9693_CR31","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":"9693_CR32","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":"9693_CR33","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/j.cor.2013.09.008","volume":"43","author":"J Naoum-Sawaya","year":"2014","unstructured":"Naoum-Sawaya, J.: Recursive central rounding heuristic for mixed integer programs. Comput. Oper. Res. 43, 191\u2013200 (2014)","journal-title":"Comput. Oper. Res."},{"key":"9693_CR34","unstructured":"Narayanan, H.: Randomized Interior Point Methods for Sampling and Optimization. http:\/\/arxiv.org\/abs\/arXiv:0911.3950 (2009)"},{"issue":"6","key":"9693_CR35","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1287\/opre.32.6.1296","volume":"32","author":"R Smith","year":"1984","unstructured":"Smith, R.: Efficient Monte Carlo procedures for generating points uniformly distributed over bounded regions. Oper. Res. 32(6), 1296\u20131308 (1984)","journal-title":"Oper. Res."},{"key":"9693_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."},{"key":"9693_CR37","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)"},{"issue":"2","key":"9693_CR38","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01096737","volume":"3","author":"Z Zabinsky","year":"1993","unstructured":"Zabinsky, Z., Smith, R., McDonald, J., Romeijn, H., Kaufman, D.: Improving hit-and-run for global optimization. J. Glob. Optim. 3(2), 171\u2013192 (1993)","journal-title":"J. Glob. Optim."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9693-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9693-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9693-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T18:22:33Z","timestamp":1565806953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9693-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,12]]},"references-count":38,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9693"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9693-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,12]]}}}