Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics

MaRDI QIDQ3416573zbMATH OpenFDO

Authors Philipp Christophel, Uwe H. Suhl, Leena Suhl

Publication date 22 January 2007

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A hybrid primal heuristic for finding feasible solutions to mixed integer programs
• A feasibility pump heuristic for general mixed-integer problems
• Feasibility pump 2.0
• Feasibility Pump-like heuristics for mixed integer problems
• Heuristics for convex mixed integer nonlinear programs

Cited in

(7)

• Adaptive kernel search: a heuristic for solving mixed integer linear programs
• A hybrid primal heuristic for finding feasible solutions to mixed integer programs
• Structure-driven fix-and-propagate heuristics for mixed integer programming
• A feasibility pump heuristic for general mixed-integer problems
• Exploiting Solving Phases for Mixed-Integer Programs
• Improving the performance of MIP and MINLP solvers by integrated heuristics
• Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems

Describes a project that uses

Uses Software

• MIPLIB2003
• MOPS

This page was built for publication: Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics

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