Generalized relax-and-fix heuristic
From MaRDI portal
Publication:2108128
Recommendations
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- Fix and relax heuristic for a stochastic lot-sizing problem
- Restrict-and-relax search for 0-1 mixed-integer programs
- COAL: A new heuristic approach for solving the fixed charge problem - computational results
Cites work
- A feasibility pump for mixed integer nonlinear programs
- A feasibility pump heuristic for general mixed-integer problems
- A generic exact solver for vehicle routing and related problems
- A heuristic approach for big bucket multi-level production planning problems
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- A POPMUSIC matheuristic for the capacitated vehicle routing problem
- A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- A result on projection for the vehicle routing problem
- A storm of feasibility pumps for nonconvex MINLP
- An optimal algorithm for the multi-item capacitated production planning problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Column generation based primal heuristics
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- Efficient Heuristic Procedures for Integer Linear Programming with an Interior
- Exploring relaxation induced neighborhoods to improve MIP solutions
- scientific article; zbMATH DE number 3340881 (Why is no real title available?)
- Improving the feasibility pump
- Local branching
- Measuring the impact of primal heuristics
- Octane: A New Heuristic for Pure 0–1 Programs
- On a fix-and-relax framework for a class of project scheduling problems
- On practical resource allocation for production planning and scheduling with period overlapping setups
- Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
- Pivot and Complement–A Heuristic for 0-1 Programming
- Pivot and shift -- a mixed integer programming heuristic
- POPMUSIC -- partial optimization metaheuristic under special intensification conditions
- Primal Heuristics for Branch and Price: The Assets of Diving Methods
- Production Planning by Mixed Integer Programming
- Projection results for vehicle routing
- Proximity search for 0--1 mixed-integer convex programming
- Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants
- RENS. The optimal rounding
- Restrict-and-relax search for 0-1 mixed-integer programs
- Structure-driven fix-and-propagate heuristics for mixed integer programming
- Survey Paper—Time Window Constrained Routing and Scheduling Problems
- The feasibility pump
- Towards an objective feasibility pump for convex minlps
- Undercover: a primal MINLP heuristic exploring a largest sub-MIP
- Using and extending fix-and-relax to solve maritime inventory routing problems
Cited in
(5)- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- scientific article; zbMATH DE number 5877344 (Why is no real title available?)
- Restrict-And-Fix
- Multi-commodity vehicle routing problem with pickup and delivery for electric micromobility devices rebalancing and battery swapping
- Combining relax-and-fix and fix-and-optimize approaches to solve the multi-item capacitated lot-sizing problem with unrelated parallel machines
This page was built for publication: Generalized relax-and-fix heuristic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108128)
