On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
type: Item
instance of: scholarly article
title: On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs
zbMATH Open document ID: 1483.90086
author: Raca Todosijević
author: Saïd Hanafi
author: Fred Glover
published in: Discrete Applied Mathematics
publication date: 2022-01-05T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7452369
zbMATH Keywords: metaheuristics
zbMATH Keywords: convergence
zbMATH Keywords: scatter search
zbMATH Keywords: star path
zbMATH Keywords: directional rounding
describes a project that uses: FEASPUMP
describes a project that uses: Scatter Search
describes a project that uses: Octane
MaRDI profile type: Publication
full work available at URL: j.dam.2020.05.010
OpenAlex ID: W3034720276
cites work: A note on the pivot and complement heuristic for 0-1 programming problems
cites work: Improving the feasibility pump
cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: Octane: A New Heuristic for Pure 0–1 Programs
cites work: Generalized intersection cuts and a new cut generating paradigm
cites work: Pivot and Complement–A Heuristic for 0-1 Programming
cites work: Pivot and shift -- a mixed integer programming heuristic
cites work: A feasibility pump heuristic for general mixed-integer problems
cites work: Attraction probabilities in variable neighborhood search
cites work: Exploring relaxation induced neighborhoods to improve MIP solutions
cites work: Q3844775
cites work: The feasibility pump
cites work: Local branching
cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
cites work: Cut search methods in integer programming
cites work: Scatter search and star-paths: Beyond the genetic metaphor
cites work: Tabu search and finite convergence
cites work: General purpose heuristics for integer programming. II
cites work: Fundamentals of scatter search and path relinking
cites work: Scatter search with path relinking for the flexible job shop scheduling problem
cites work: On the convergence of tabu search
cites work: Variable neighbourhood pump heuristic for 0-1 mixed integer programming feasibility
cites work: Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem
cites work: Variable neighborhood search and local branching
cites work: Mixed network design using hybrid scatter search
cites work: Scatter search. Methodology and implementation in C. With CD-ROM.
cites work: Experimental testing of advanced scatter search designs for global optimization of multimodal functions
cites work: An analytical expression and an algorithm for the volume of a convex polyhedron in \(R^ n\).
cites work: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
cites work: Solving zero-one mixed integer programming problems using tabu search
cites work: Scatter search for an uncapacitated \(p\)-hub median problem
cites work: Principles of scatter search
cites work: A scatter search algorithm for the distributed permutation flowshop scheduling problem
cites work: Handbook of metaheuristics
cites work: Q5342287
cites work: New convergent heuristics for 0-1 mixed integer programming
cites work: Q4943600
cites work: Hypercylindrically Deduced Cuts in Zero-One Integer Programs
DOI: 10.1016/J.DAM.2020.05.010
description: scientific article; zbMATH DE number 7452369