Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
From MaRDI portal
Publication:2883646
Recommendations
Cites work
- A feasibility pump heuristic for general mixed-integer problems
- Handbook of metaheuristics
- Improving the feasibility pump
- Local branching
- Repairing MIP infeasibility through local branching
- The feasibility pump
- Variable neighborhood decomposition search
- Variable neighborhood search and local branching
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
Cited in
(16)- Mathematical programming based heuristics for the 0--1 MIP: a survey
- A new class of functions for measuring solution integrality in the feasibility pump approach
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- Three ideas for a feasibility pump for nonconvex MINLP
- Boosting the feasibility pump
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Variable neighborhood search: the power of change and simplicity
- Matheuristics approaches for the satellite constellation design problem
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- A New Approach to the Feasibility Pump in Mixed Integer Programming
- On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
- Variable neighborhood search: basics and variants
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Ten years of feasibility pump, and counting
This page was built for publication: Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883646)