A dual heuristic for mixed integer programming

DOI10.1016/j.orl.2015.05.007zbMath1408.90200OpenAlexW393185116MaRDI QIDQ1785392

Yaxian Li, Nemhauser, George I., Özlem Ergun

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2015.05.007

zbMATH Keywords

branch-and-boundknapsackrelaxationsdual heuristic

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem ⋮ A hybrid primal heuristic for finding feasible solutions to mixed integer programs

Uses Software

• FEASPUMP

Cites Work

• Unnamed Item
• A genetic algorithm for the multidimensional knapsack problem
• Local branching
• Using diversification, communication and parallelism to solve mixed-integer linear programs
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
• The feasibility pump

This page was built for publication: A dual heuristic for mixed integer programming