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

zbMATH Keywords

integer programmingprimal heuristicsfeasibility

Mathematics Subject Classification ID

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

Recommendations

• A feasibility pump heuristic for general mixed-integer problems
• Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
• Feasibility pump 2.0
• Improving the feasibility pump
• The feasibility pump

Cites work

• scientific article; zbMATH DE number 5829047 (Why is no real title available?)
• A dual heuristic for mixed integer programming
• A feasibility pump heuristic for general mixed-integer problems
• A genetic algorithm for the weight setting problem in OSPF routing
• A pool-based pattern generation algorithm for logical analysis of data with automatic fine-tuning
• Boosting the feasibility pump
• Feasibility Pump-like heuristics for mixed integer problems
• Feasibility pump 2.0
• General purpose heuristics for integer programming. I
• General purpose heuristics for integer programming. II
• Improving the feasibility pump
• MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
• Shift-and-propagate
• The feasibility pump
• Using the analytic center in the feasibility pump
• Variable neighborhood search and local branching
• Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility

Cited in

(12)

• Structure-driven fix-and-propagate heuristics for mixed integer programming
• Finding feasible solutions to hard mixed-integer programming problems using hybrid heuristics
• FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• 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
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
• Generalized relax-and-fix heuristic
• A feasibility pump heuristic for general mixed-integer problems
• Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints
• Heuristics for a flowshop scheduling problem with stepwise job objective function
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs

Describes a project that uses

Uses Software

• FEASPUMP
• SPOT
• MIRPLib

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)