A hybrid primal heuristic for finding feasible solutions to mixed integer programs

DOI10.1016/j.ejor.2017.05.003zbMath1380.90193OpenAlexW2613884615MaRDI QIDQ1695014

Yufen Shao, Carlos E. Andrade, Shabbir Ahmed, Nemhauser, George I.

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

zbMATH Keywords

integer programmingfeasibilityprimal heuristics

Mathematics Subject Classification ID

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

Related Items

Application of a hybrid evolutionary algorithm to resource-constrained parallel machine scheduling with setup times, Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, Heuristics for a flowshop scheduling problem with stepwise job objective function, The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications, Structure-driven fix-and-propagate heuristics for mixed integer programming, Generalized relax-and-fix heuristic

Uses Software

• FEASPUMP
• SPOT
• MIRPLib

Cites Work

• Unnamed Item
• A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
• Using the analytic center in the feasibility pump
• Boosting the feasibility pump
• Shift-and-propagate
• Feasibility pump 2.0
• General purpose heuristics for integer programming. I
• General purpose heuristics for integer programming. II
• A genetic algorithm for the weight setting problem in OSPF routing
• A dual heuristic for mixed integer programming
• MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
• Feasibility Pump-like heuristics for mixed integer problems
• A feasibility pump heuristic for general mixed-integer problems
• Improving the feasibility pump
• Variable neighborhood search and local branching
• The feasibility pump
• Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility