{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,26]],"date-time":"2026-07-26T06:02:12Z","timestamp":1785045732448,"version":"3.55.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2004,5,21]],"date-time":"2004-05-21T00:00:00Z","timestamp":1085097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2005,1]]},"DOI":"10.1007\/s10107-004-0518-7","type":"journal-article","created":{"date-parts":[[2004,5,20]],"date-time":"2004-05-20T12:15:43Z","timestamp":1085055343000},"page":"71-90","source":"Crossref","is-referenced-by-count":399,"title":["Exploring relaxation induced neighborhoods to improve MIP solutions"],"prefix":"10.1007","volume":"102","author":[{"given":"Emilie","family":"Danna","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Edward","family":"Rothberg","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claude Le","family":"Pape","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2004,5,21]]},"reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/ijoc.6.1.82","volume":"6","author":"Aboudi","year":"1","unstructured":"Aboudi, R., J\u00f6rnsten, K.: Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic. ORSA J. Comput. 6 (1), 82?93 (1994)","journal-title":"ORSA J. Comput."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"Adams","year":"3","unstructured":"Adams, J., Balas, E., Zawack, D.: The Shifting Bottleneck Procedure for Job-Shop Scheduling. Manage. Sci. 34 (3), 391?401 (1988)","journal-title":"Manage. Sci."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1287\/inte.21.1.62","volume":"21","author":"Anbil","year":"1991","unstructured":"Anbil, R., Gelman, E., Patty, B., Tanga, R.: Recent advances in crew-pairing optimization at American Airlines. Interfaces 21, 62?74 (1991)","journal-title":"Interfaces"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"Applegate","year":"2","unstructured":"Applegate, D., Cook, W.: A Computational Study of the Job-Shop Scheduling Problem. ORSA J. Comput. 3 (2), 149?156 (1991)","journal-title":"ORSA J. Comput."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.49.2.207.13535","volume":"49","author":"Balas","year":"2","unstructured":"Balas, E., Ceria, S., Dawande, M., Margot, F., Pataki, G.: OCTANE: A New Heuristic for Pure 0-1 Programs. Oper. Res. 49 (2), 207?225 (2001)","journal-title":"Oper. Res."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/mnsc.26.1.86","volume":"26","author":"Balas","year":"1","unstructured":"Balas, E., Martin, C.: Pivot and Complement ? A Heuristic for 0-1 Programming. Manage. Sci. 26 (1), 86?96 (1980)","journal-title":"Manage. Sci."},{"key":"CR7","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Incorporating Efficient Operations Research Algorithms in Constraint-Based Scheduling. In: Proceedings of the First International Joint Workshop on Artificial Intelligence and Operations Research, 1995"},{"key":"CR8","unstructured":"Bixby, R.E., Ceria, S., McZeal, C.M., Savelsbergh, M.W.P.: An updated mixed integer programming library: MIPLIB 3.0 Optima 58, 12?15 (1998)"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"Bixby, R.E., Fenelon, M., Gu, Z., Rothberg, E., Wunderling, R.: MIP: Theory and practice ? closing the gap. Kluwer Academic Publishers, 2000, pp. 19?49","DOI":"10.1007\/978-0-387-35514-6_2"},{"key":"CR10","unstructured":"Caseau, Y., Laburthe, F.: Disjunctive Scheduling with Task Intervals. Technical report, \u00c9cole Normale Sup\u00e9rieure, 1995"},{"key":"CR11","unstructured":"Caseau, Y., Laburthe, F.: SaLSA Specification language for search algorithms. Technical report, \u00c9cole Normale Sup\u00e9rieure, LIENS-97-11, 1997"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Chabrier, A., Danna, E., Le Pape, C., Perron, L.: Solving a Network Design Problem. To appear in Annals of Operations Research, Special Issue following CP-AI-OR?2002, 2004","DOI":"10.1023\/B:ANOR.0000032577.81139.84"},{"key":"CR13","unstructured":"Danna, E.: Int\u00e9gration des techniques de recherche locale \u00e0 la programmation lin\u00e9aire en nombres entiers (in French). PhD thesis, Universit\u00e9 d?Avignon, 2004"},{"key":"CR14","unstructured":"Danna, E., Le Pape, C.: Accelerating branch-and-price with local search: A case study on the vehicle routing problem with time windows. Technical Report, ILOG, 03-006, 2003"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"Danna, E., Le Pape, C.: Two generic schemes for efficient and robust cooperative algorithms. Constraint and integer programming, Michela Milano (ed.), Kluwer Academic Publishers, 2003, pp. 33?57","DOI":"10.1007\/978-1-4419-8917-8_2"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1287\/opre.27.6.1069","volume":"27","author":"Faaland","year":"6","unstructured":"Faaland, B.H., Hillier, F.S.: Interior path methods for heuristic integer programming procedures. Oper. Res. 27 (6), 1069?1087 (1979)","journal-title":"Oper. Res."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local Branching. Math. Program. Ser. B 98, 23?47 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"CR18","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, 1997","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"CR19","first-page":"653","volume":"29","author":"Glover","year":"3","unstructured":"Glover, F., Laguna, M., Mart\u00ed, F.: Fundamentals of Scatter Search and Path Relinking. Control and Cybernetics 29 (3), 653?684 (2000)","journal-title":"Control and Cybernetics"},{"key":"CR20","doi-asserted-by":"crossref","unstructured":"Glover, F., L\u00f8kketangen, A., Woodruff, D.L.: Scatter Search to Generate Diverse MIP Solutions. In: M. Laguna, J.L. Gonz\u00e1lez-Velarde, (eds.), OR Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, Kluwer Academic Publishers, 2000, pp. 299?317","DOI":"10.1007\/978-1-4615-4567-5_17"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1287\/opre.17.4.600","volume":"17","author":"Hillier","year":"4","unstructured":"Hillier, F.S.: Efficient heuristic procedures for integer linear programming with an interior. Oper. Res. 17 (4), 600?637 (1969)","journal-title":"Oper. Res."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0120691","volume":"2","author":"Ibaraki","year":"1974","unstructured":"Ibaraki, T., Ohashi, T., Mine, H.: A heuristic algorithm for mixed-integer programming problems. Math. Program. Study 2, 115?136 (1974)","journal-title":"Math. Program. Study"},{"key":"CR23","unstructured":"Junker, U., Nuijten, W.: Preference-based Search for Minimizing Changes in Rescheduling Problems. In: IJCAI-99 Workshop on scheduling and planning meet real-time: Monitoring in a dynamic and uncertain world, 1999, pp. 39?45"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0004-3702(02)00221-7","volume":"139","author":"Jussien","year":"2002","unstructured":"Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139, 21?45 (2002)","journal-title":"Artificial Intelligence"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1009613717770","volume":"5","author":"Pape","year":"3","unstructured":"Le Pape, C., Baptiste, P.: Heuristic Control of a Constraint-Based Algorithm for the Preemptive Job-Shop Scheduling Problem. J. Heuristics 5 (3), 305?325 (1999)","journal-title":"J. Heuristics"},{"key":"CR26","first-page":"741","volume":"29","author":"L\u00f8kketangen","year":"3","unstructured":"L\u00f8kketangen, A., Woodruff, D.L.: Integrating Pivot Based Search with Branch and Bound for Binary MIP?s. Control and Cybernetics, Special issue on Tabu Search 29 (3), 741?760 (2001)","journal-title":"Control and Cybernetics, Special issue on Tabu Search"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling. Artificial Intelligence 58, 161?205 (1992)","journal-title":"Artificial Intelligence"},{"key":"CR28","doi-asserted-by":"crossref","unstructured":"Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, 1996","DOI":"10.7551\/mitpress\/3927.001.0001"},{"key":"CR29","unstructured":"Nediak, M., Eckstein, J.: Pivot, cut and dive: A Heuristic for 0-1 Mixed Integer Programming. Technical Report, Rutgers Center for Operations Research, RRR 53-2001, 2001"},{"key":"CR30","unstructured":"Palpant, M., Artigues, C., Michelon, P.: A heuristic for solving the frequency assignment problem. In: XI Latin-Iberian American Congress of Operations Research (CLAIO), 2002"},{"key":"CR31","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP?98), 1998, pp. 417?431","DOI":"10.1007\/3-540-49481-2_30"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF03037165","volume":"9","author":"Hentenryck","year":"3","unstructured":"Van Hentenryck, P., Le Provost, T.: Incremental Search in Constraint Logic Programming. New Generation Comput. 9 (3), 257?275 (1991)","journal-title":"New Generation Comput."},{"key":"CR33","doi-asserted-by":"crossref","unstructured":"Van Laarhoven, P.J.M., Aarts, E.H.L.: Simulated Annealing: Theory and Practice. Kluwer Academic Publishers, 1987","DOI":"10.1007\/978-94-015-7744-1"},{"key":"CR34","unstructured":"Van Vyve, M.: A solution approach of production planning problems based on compact formulations for single-item lot-sizing models. PhD thesis, Universit\u00e9 catholique de Louvain-la-Neuve, 2003"},{"key":"CR35","unstructured":"V\u00e1squez, M., Whitley, L.D.: A comparison of Genetic Algorithms for the Dynamic Job Shop Scheduling Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000), 2000, pp. 1011?1018"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0518-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-004-0518-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-004-0518-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T22:29:44Z","timestamp":1734388184000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-004-0518-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5,21]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,1]]}},"alternative-id":["518"],"URL":"https:\/\/doi.org\/10.1007\/s10107-004-0518-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,5,21]]}}}