Mathematical programming based heuristics for the 0--1 MIP: a survey
From MaRDI portal
Recommendations
- New convergent heuristics for 0-1 mixed integer programming
- Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
- New variable neighborhood search based 0-1 MIP heuristics
- scientific article; zbMATH DE number 549930
- Probabilistic approach to assessment of heuristics in 0?1 linear programming
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 2209664 (Why is no real title available?)
- A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- 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
- A Note on Linear Programming and Integer Feasibility
- A computational study of parametric tabu search for 0-1 mixed integer programs
- A feasibility pump heuristic for general mixed-integer problems
- A note on the pivot and complement heuristic for 0-1 programming problems
- A relax-and-fix with fix-and-optimize heuristic applied to multi-level lot-sizing problems
- A user's guide to tabu search
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An Approach to Zero-One Integer Programming
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Future paths for integer programming and links to artificial intelligence
- General purpose heuristics for integer programming. II
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Improving the feasibility pump
- Lagrangean heuristics for location problems
- Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
- Local branching
- Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows
- New convergent heuristics for 0-1 mixed integer programming
- Octane: A New Heuristic for Pure 0–1 Programs
- Parametric tabu-search for mixed integer programs
- Pivot and Complement–A Heuristic for 0-1 Programming
- Pivot and shift -- a mixed integer programming heuristic
- Production Planning by Mixed Integer Programming
- Proximity search for 0--1 mixed-integer convex programming
- Repairing MIP infeasibility through local branching
- Restrict-and-relax search for 0-1 mixed-integer programs
- SCIP: solving constraint integer programs
- Scatter search and star-paths: Beyond the genetic metaphor
- Solving zero-one mixed integer programming problems using tabu search
- Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic
- Tabu Thresholding: Improved Search by Nonmonotonic Trajectories
- Tabu search within a pivot and complement framework
- The feasibility pump
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- Variable neighborhood search and local branching
- Variable neighborhood search: basics and variants
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
- Zero-one programming with many variables and few constraints
- bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems
Cited in
(13)- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope
- Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
- One-shot learning for MIPs with SOS1 constraints
- Fixed cardinality stable sets
- scientific article; zbMATH DE number 4072722 (Why is no real title available?)
- Octane: A New Heuristic for Pure 0–1 Programs
- A heuristic with tie breaking for certain 0–1 integer programming models
- A heuristic 0-1 integer programming method
- The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem
- Fractional decomposition tree algorithm: a tool for studying the integrality gap of integer programs
- New convergent heuristics for 0-1 mixed integer programming
- New variable neighborhood search based 0-1 MIP heuristics
- Probabilistic approach to assessment of heuristics in 0?1 linear programming
This page was built for publication: Mathematical programming based heuristics for the 0--1 MIP: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401328)
