The depth and width of local minima in discrete solution spaces

DOI10.1016/0166-218X(93)E0134-KzbMath0820.90092OpenAlexW1976909399MaRDI QIDQ1343158

Jennifer K. Ryan

Publication date: 1 February 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0134-k

zbMATH Keywords

simulated annealingtabu searchheuristic search techniquescardinality set coveringmaximum depthmaximum width of local minima

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (4)

Metaheuristics: A bibliography ⋮ On the classification of NP-complete problems in terms of their correlation coefficient ⋮ An efficient tabu search procedure for the \(p\)-median problem ⋮ Solving zero-one mixed integer programming problems using tabu search

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A limit theorem for a class of inhomogeneous Markov processes
• The tabu search metaheuristic: How we used it
• Cooling Schedules for Optimal Annealing
• On the Convergence Rate of Annealing Processes
• Tabu Search—Part I
• Bandwidth Packing: A Tabu Search Approach

This page was built for publication: The depth and width of local minima in discrete solution spaces