General purpose heuristics for integer programming. II

DOI10.1023/A:1009631530787zbMath0898.90094OpenAlexW1973471744MaRDI QIDQ1372914

Fred Glover, Manuel Laguna

Publication date: 8 November 1998

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009631530787

zbMATH Keywords

integer programmingscatter searchbranch-and-cut methodsstar-paths

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items

Mathematical programming based heuristics for the 0--1 MIP: a survey, Adaptive kernel search: a heuristic for solving mixed integer linear programs, A hybrid primal heuristic for finding feasible solutions to mixed integer programs, An interior point cutting plane heuristic for mixed integer programming, Feasibility Pump-like heuristics for mixed integer problems, Repairing MIP infeasibility through local branching, Boosting the feasibility pump, A feasibility pump heuristic for general mixed-integer problems, Improving the feasibility pump, Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs, Shift-and-propagate, Mixed integer programming: A historical perspective with Xpress-MP, Variable neighborhood search and local branching, A computational study of parametric tabu search for 0-1 mixed integer programs, RENS. The optimal rounding, On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs, Feasibility pump 2.0, The feasibility pump