General purpose heuristics for integer programming. II

DOI10.1023/A:1009631530787MaRDI QIDQ1372914zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• General purpose heuristics for integer programming. I
• A generalized Wedelin heuristic for integer programming
• Approximability of Integer Programming with Generalised Constraints
• Integer programming as a framework for optimization and approximability
• A computational study of an objective hyperplane search heuristic for the general integer linear programming problem
• scientific article; zbMATH DE number 1996459
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• A two-phase optimization procedure for integer programming problems
• A heuristic algorithm for solving integer linear programming problem and unveiling the applications
• An integer programming column generation principle for heuristic search methods

Cited in

(22)

• Variable neighborhood search and local branching
• Mathematical programming based heuristics for the 0--1 MIP: a survey
• Feasibility pump 2.0
• Adaptive kernel search: a heuristic for solving mixed integer linear programs
• A hybrid primal heuristic for finding feasible solutions to mixed integer programs
• A generalized Wedelin heuristic for integer programming
• The feasibility pump
• Boosting the feasibility pump
• Feasibility Pump-like heuristics for mixed integer problems
• Large-scale mixed integer programming: Benders-type heuristics
• Heuristics of the branch-cut-and-price-framework SCIP
• Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
• On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
• A computational study of parametric tabu search for 0-1 mixed integer programs
• Shift-and-propagate
• RENS. The optimal rounding
• Mixed integer programming: A historical perspective with Xpress-MP
• An interior point cutting plane heuristic for mixed integer programming
• Repairing MIP infeasibility through local branching

This page was built for publication: General purpose heuristics for integer programming. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372914)