On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
From MaRDI portal
Publication:2064299
DOI10.1016/j.dam.2020.05.010zbMath1483.90086OpenAlexW3034720276MaRDI QIDQ2064299
Fred Glover, Raca Todosijević, Saïd Hanafi
Publication date: 5 January 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.05.010
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A scatter search algorithm for the distributed permutation flowshop scheduling problem
- Scatter search with path relinking for the flexible job shop scheduling problem
- Mixed network design using hybrid scatter search
- Scatter search for an uncapacitated \(p\)-hub median problem
- Improved convergent heuristics for the 0-1 multidimensional knapsack problem
- Attraction probabilities in variable neighborhood search
- A note on the pivot and complement heuristic for 0-1 programming problems
- An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
- General purpose heuristics for integer programming. II
- Local branching
- Tabu search and finite convergence
- Solving zero-one mixed integer programming problems using tabu search
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Scatter search and star-paths: Beyond the genetic metaphor
- Generalized intersection cuts and a new cut generating paradigm
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- New convergent heuristics for 0-1 mixed integer programming
- Pivot and shift -- a mixed integer programming heuristic
- A feasibility pump heuristic for general mixed-integer problems
- Improving the feasibility pump
- Variable neighborhood search and local branching
- Principles of scatter search
- The feasibility pump
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
- Variable Neighbourhood Pump Heuristic for 0-1 Mixed Integer Programming Feasibility
- Octane: A New Heuristic for Pure 0–1 Programs
- Pivot and Complement–A Heuristic for 0-1 Programming
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Hypercylindrically Deduced Cuts in Zero-One Integer Programs
- Cut search methods in integer programming
- Handbook of metaheuristics
- On the convergence of tabu search
