Generalized relax-and-fix heuristic
From MaRDI portal
Publication:2108128
DOI10.1016/j.cor.2022.106038OpenAlexW4297359432MaRDI QIDQ2108128
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106038
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Towards an objective feasibility pump for convex minlps
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Using and extending fix-and-relax to solve maritime inventory routing problems
- Proximity search for 0--1 mixed-integer convex programming
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Restrict-and-relax search for 0-1 mixed-integer programs
- RENS. The optimal rounding
- An optimal algorithm for the multi-item capacitated production planning problem
- On a fix-and-relax framework for a class of project scheduling problems
- A heuristic approach for big bucket multi-level production planning problems
- A feasibility pump for mixed integer nonlinear programs
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- A result on projection for the vehicle routing problem
- On practical resource allocation for production planning and scheduling with period overlapping setups
- Local branching
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- A storm of feasibility pumps for nonconvex MINLP
- A generic exact solver for vehicle routing and related problems
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Pivot and shift -- a mixed integer programming heuristic
- Measuring the impact of primal heuristics
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- The feasibility pump
- Projection results for vehicle routing
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
- Column Generation based Primal Heuristics
- Octane: A New Heuristic for Pure 0–1 Programs
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- Pivot and Complement–A Heuristic for 0-1 Programming
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Penalty Alternating Direction Methods for Mixed-Integer Optimization: A New View on Feasibility Pumps
- Production Planning by Mixed Integer Programming
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
