On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs

DOI10.1016/J.DAM.2020.05.010MaRDI QIDQ2064299zbMATH OpenOpenAlexFDO

Authors Raca Todosijević, Saïd Hanafi, Fred Glover

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

zbMATH Keywords

convergencedirectional roundingmetaheuristicsscatter searchstar path

Mathematics Subject Classification ID

Boolean programming (90C09) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scatter search and star-paths: Beyond the genetic metaphor
• New variable neighborhood search based 0-1 MIP heuristics
• New convergent heuristics for 0-1 mixed integer programming
• Scatter Search and Path Relinking: Advances and Applications
• Fundamentals of scatter search and path relinking

Cites work

• A feasibility pump heuristic for general mixed-integer problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
• A note on the pivot and complement heuristic for 0-1 programming problems
• A scatter search algorithm for the distributed permutation flowshop scheduling problem
• An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
• Attraction probabilities in variable neighborhood search
• Cut search methods in integer programming
• Experimental testing of advanced scatter search designs for global optimization of multimodal functions
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Fundamentals of scatter search and path relinking
• General purpose heuristics for integer programming. II
• Generalized intersection cuts and a new cut generating paradigm
• Handbook of metaheuristics
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
• Hypercylindrically Deduced Cuts in Zero-One Integer Programs
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• Improving the feasibility pump
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Local branching
• Mixed network design using hybrid scatter search
• New convergent heuristics for 0-1 mixed integer programming
• Octane: A New Heuristic for Pure 0–1 Programs
• On the convergence of tabu search
• Pivot and Complement–A Heuristic for 0-1 Programming
• Pivot and shift -- a mixed integer programming heuristic
• Principles of scatter search
• Scatter search and star-paths: Beyond the genetic metaphor
• Scatter search for an uncapacitated \(p\)-hub median problem
• Scatter search with path relinking for the flexible job shop scheduling problem
• Scatter search. Methodology and implementation in C. With CD-ROM.
• Solving zero-one mixed integer programming problems using tabu search
• Tabu search and finite convergence
• The feasibility pump
• Variable neighborhood search and local branching
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility

Cited in

(1)

• Scatter search and star-paths: Beyond the genetic metaphor

Describes a project that uses

Uses Software

• FEASPUMP
• Scatter Search
• Octane

This page was built for publication: On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2064299)