A hybrid primal heuristic for finding feasible solutions to mixed integer programs
DOI10.1016/J.EJOR.2017.05.003zbMATH Open1380.90193OpenAlexW2613884615MaRDI QIDQ1695014FDOQ1695014
Authors: Carlos E. Andrade, S. Ahmed, Yufen Shao, G. L. Nemhauser 
Publication date: 6 February 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.05.003
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11)
Cites Work
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- Feasibility pump 2.0
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Title not available (Why is that?)
- Using the analytic center in the feasibility pump
- A genetic algorithm for the weight setting problem in OSPF routing
- Variable neighborhood search and local branching
- A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
- Boosting the feasibility pump
- General purpose heuristics for integer programming. I
- General purpose heuristics for integer programming. II
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
- Shift-and-propagate
- A dual heuristic for mixed integer programming
- Feasibility Pump-like heuristics for mixed integer problems
Cited In (12)
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Generalized relax-and-fix heuristic
- Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
- An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
- A feasibility pump heuristic for general mixed-integer problems
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times
- Biased random-key genetic algorithm for the job sequencing and tool switching problem with non-identical parallel machines
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
Uses Software
This page was built for publication: A hybrid primal heuristic for finding feasible solutions to mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1695014)
