Mathematical programming based heuristics for the 0--1 MIP: a survey
From MaRDI portal
Publication:2401328
DOI10.1007/s10732-017-9336-yzbMath1370.90154MaRDI QIDQ2401328
Publication date: 8 September 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-017-9336-y
90C11: Mixed integer programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
Fixed cardinality stable sets, The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- 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
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- A computational study of parametric tabu search for 0-1 mixed integer programs
- SCIP: solving constraint integer programs
- Restrict-and-relax search for 0-1 mixed-integer programs
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- A note on the pivot and complement heuristic for 0-1 programming problems
- Zero-one programming with many variables and few constraints
- General purpose heuristics for integer programming. II
- Local branching
- Solving zero-one mixed integer programming problems using tabu search
- Variable neighborhood search: basics and variants
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Lagrangean heuristics for location problems
- Future paths for integer programming and links to artificial intelligence
- Scatter search and star-paths: Beyond the genetic metaphor
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A user's guide to tabu search
- New convergent heuristics for 0-1 mixed integer programming
- Pivot and shift -- a mixed integer programming heuristic
- A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
- A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
- Repairing MIP infeasibility through local branching
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Variable neighborhood search and local branching
- Parametric tabu-search for mixed integer programs
- The feasibility pump
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
- Octane: A New Heuristic for Pure 0–1 Programs
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- Pivot and Complement–A Heuristic for 0-1 Programming
- A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- Tabu search within a pivot and complement framework
- Production Planning by Mixed Integer Programming
- An Approach to Zero-One Integer Programming
- A Note on Linear Programming and Integer Feasibility
