Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility

DOI10.1016/j.endm.2010.05.096zbMath1237.90161OpenAlexW1983494303MaRDI QIDQ2883646

Saïd Hanafi, Nenad Mladenović, Jasmina Lazić

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.096

zbMATH Keywords

constructive heuristicsfeasibility pumpvariable neighbourhood search\(0-1\) mixed integer programming\texttt{CPLEX 11.1}

Mathematics Subject Classification ID

Mixed integer programming (90C11) Boolean programming (90C09)

Related Items (9)

Three ideas for a feasibility pump for nonconvex MINLP ⋮ Mathematical programming based heuristics for the 0--1 MIP: a survey ⋮ Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps ⋮ A hybrid primal heuristic for finding feasible solutions to mixed integer programs ⋮ Variable neighborhood search: the power of change and simplicity ⋮ Variable neighborhood search: basics and variants ⋮ Boosting the feasibility pump ⋮ On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs ⋮ Ten years of feasibility pump, and counting

Uses Software

• CPLEX
• FEASPUMP

Cites Work

• Local branching
• Variable neighborhood decomposition search
• Repairing MIP infeasibility through local branching
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• Variable neighborhood search and local branching
• The feasibility pump
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• Handbook of metaheuristics

This page was built for publication: Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility