{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T04:50:25Z","timestamp":1781585425326,"version":"3.54.5"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,7,11]],"date-time":"2006-07-11T00:00:00Z","timestamp":1152576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2006,7,11]],"date-time":"2006-07-11T00:00:00Z","timestamp":1152576000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10107-006-0009-0","type":"journal-article","created":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T16:29:32Z","timestamp":1152548972000},"page":"445-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Active-constraint variable ordering for faster feasibility of mixed integer linear programs"],"prefix":"10.1007","volume":"110","author":[{"given":"Jagat","family":"Patel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John W.","family":"Chinneck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,7,11]]},"reference":[{"key":"9_CR1","first-page":"224","volume":"26","author":"E. Balas","year":"1980","unstructured":"Balas E., Martin C. (1980) Pivot and Complement \u2013 a Heuristic for 0\u20131 Programming. Manage. Sci. 26, 224\u2013234","journal-title":"Manage. Sci."},{"key":"9_CR2","unstructured":"Balas E., Martin, C. Pivot and Shift \u2013 a Heuristic for Mixed Integer Programming. GSIA, Carnegie Mellon University (1986)"},{"key":"9_CR3","doi-asserted-by":"publisher","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. (2001) OCTANE: a New Heuristic for Pure 0\u20131 Programs. Oper. Res. 49, 207\u2013225","journal-title":"Oper. Res."},{"key":"9_CR4","doi-asserted-by":"publisher","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. (2004) Pivot and Shift \u2013 a Mixed Integer Programming Heuristic. Discrete Optim. 1, 3\u201312","journal-title":"Discrete Optim."},{"key":"9_CR5","unstructured":"Beale, E.M.L. Mathematical Programming in Practice. Pitmans, London (1968)"},{"key":"9_CR6","unstructured":"Beale, E.M.L., Tomlin, J.A. Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Proceedings of the fifth international conference on operational research, pp. 447\u2013454. Tavistock publication, London (1970)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01584074","volume":"1","author":"M. Benichou","year":"1971","unstructured":"Benichou M., Gauthier J.M., Girodet P., Hentges G., Ribiere G., Vincent O. (1971) Experiments in mixed-integer linear programming. Math. Prog. 1, 76\u201394","journal-title":"Math. Prog."},{"key":"9_CR8","first-page":"12","volume":"58","author":"R.E. Bixby","year":"1998","unstructured":"Bixby R.E., Ceria S., McZeal C.M., Savelsbergh M.W.P. (1998) An updated mixed integer programming library: MIPLIB 3.0. Optima 58, 12\u201315","journal-title":"Optima"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1093\/comjnl\/8.3.250","volume":"8","author":"R.J. Dakin","year":"1965","unstructured":"Dakin R.J. (1965) A tree search algorithm for mixed integer programming problems. Comput. J. 8, 250\u2013255","journal-title":"Comput. J."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10107-004-0518-7","volume":"102","author":"E. Danna","year":"2005","unstructured":"Danna E., Rothberg E., Le Pape C. (2005) Exploring relaxation induced neighborhoods to improve MIP solutions. Math. Prog. Ser. A 102, 71\u201390","journal-title":"Math. Prog. Ser. A"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan E.D., Mor\u00e9 J. (2002) Benchmarking optimization software with performance profiles. Math. Prog. Ser. A 91, 201\u2013213","journal-title":"Math. Prog. Ser. A"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1137\/0804046","volume":"4","author":"J. Eckstein","year":"1994","unstructured":"Eckstein J. (1994) Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5. SIAM J. Optim. 4, 794\u2013814","journal-title":"SIAM J. Optim."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M. Fischetti","year":"2005","unstructured":"Fischetti M., Glover F., Lodi A. (2005) The feasibility pump. Math. Prog. Ser. A 104, 91\u2013104","journal-title":"Math. Prog. Ser. A"},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/mnsc.20.5.736","volume":"20","author":"J.J.H. Forest","year":"1974","unstructured":"Forest J.J.H., Hirst J.P.H., Tomlin J.A. (1974) Practical solution of large scale mixed integer programming problems with UMPIRE. Manage. Sci. 20, 736\u2013773","journal-title":"Manage. Sci."},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/BF01593767","volume":"12","author":"J.M. Gauthier","year":"1977","unstructured":"Gauthier J.M., Ribiere G. (1977) Experiments in mixed-integer linear programming. Math. Prog. 12, 26\u201347","journal-title":"Math. Prog."},{"key":"9_CR16","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1287\/opre.16.4.741","volume":"16","author":"F. Glover","year":"1968","unstructured":"Glover F. (1968) Surrogate constraints. Oper. Res. 16, 741\u2013749","journal-title":"Oper. Res."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1023721723676","volume":"9","author":"F. Glover","year":"2003","unstructured":"Glover F. (2003) Tutorial on surrogate constraint approaches for optimization in graphs. J. Heuristics 9, 175\u2013227","journal-title":"J. Heuristics"},{"key":"9_CR18","unstructured":"Greenberg, H.J. Mathematical programming glossary. Online: http:\/\/glossary.computing.society.informs.org (2005)"},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.11.1.63","volume":"11","author":"O. Guieu","year":"1999","unstructured":"Guieu O., Chinneck J.W. (1999) Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput. 11, 63\u201377","journal-title":"INFORMS J. Comput."},{"key":"9_CR20","unstructured":"Hirst, J.P.H. Features required in Branch-and-Bound Algorithms for (0\u20131) mixed integer linear programming. unpublished manuscript (1969)"},{"key":"9_CR21","unstructured":"ILOG Corporation.: Cplex 9.0 Callable Library Reference Manual (2003)"},{"key":"9_CR22","unstructured":"ILOG Corporation.: Cplex 9.0 C++ API Reference Manual (2003)"},{"key":"9_CR23","unstructured":"ILOG Corporation.: Cplex 9.0 User\u2019s Manual (2003)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"E.L. Johnson","year":"2000","unstructured":"Johnson E.L., Nemhauser G.L., Savelsbergh M.W.P. (2000) Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J. Comput. 12, 2\u201323","journal-title":"INFORMS J. Comput."},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A.H. Land","year":"1960","unstructured":"Land A.H., Doig A.G. (1960) An automatic method for solving discrete programming problems. Econometrica 28, 497\u2013520","journal-title":"Econometrica"},{"key":"9_CR26","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J.T. Linderoth","year":"1999","unstructured":"Linderoth J.T., Savelsbergh M.W.P. (1999) A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11, 173\u2013187","journal-title":"INFORMS J. Comput."},{"key":"9_CR27","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1090\/dimacs\/035\/14","volume":"35","author":"A. Lokketangen","year":"1997","unstructured":"Lokketangen A., Glover F. (1997) Surrogate constraint analysis \u2013 new heuristics and learning schemes for satisfiability problems. DIMACS Ser. Discrete Math. Theor. Comput. Sci. 35, 537\u2013572","journal-title":"DIMACS Ser. Discrete Math. Theor. Comput. Sci."},{"key":"9_CR28","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01584658","volume":"5","author":"G. Mitra","year":"1973","unstructured":"Mitra G. (1973) Investigation of some branch-and-bound strategies for the solution of mixed integer linear programs. Math. Progr. 5, 155\u2013170","journal-title":"Math. Progr."},{"key":"9_CR29","unstructured":"MIPLIB2003. Library of mixed-integer linear programming test models at http:\/\/miplib.zib.de\/miplib2003.php (2005)"},{"key":"9_CR30","unstructured":"Mittelman, H. Benchmark for Optimization Software web-site at http:\/\/plato.la.asu.edu\/bench.html (2001)"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"Padberg M.W., Rinaldi G. (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60\u2013100","journal-title":"SIAM Rev."},{"key":"9_CR32","first-page":"450","volume":"2","author":"R.E. Small","year":"1965","unstructured":"Small R.E. (1965) Mixed integer programming by a branch and bound technique. Proc. the 3rd IFIP Congress 2: 450\u2013451","journal-title":"Proc. the 3rd IFIP Congress"},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"1070","DOI":"10.1287\/opre.19.4.1070","volume":"19","author":"J.A. Tomlin","year":"1969","unstructured":"Tomlin J.A. (1969) An improved branch-and-bound method for integer programming. Oper. Res. 19, 1070\u20131075","journal-title":"Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0009-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-006-0009-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0009-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-006-0009-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,17]],"date-time":"2022-05-17T16:58:54Z","timestamp":1652806734000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-006-0009-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,11]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["9"],"URL":"https:\/\/doi.org\/10.1007\/s10107-006-0009-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,7,11]]},"assertion":[{"value":"11 November 2003","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2006","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2006","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}