On the depth of combinatorial optimization problems

DOI10.1016/0166-218X(93)90003-7MaRDI QIDQ1801676zbMATH OpenOpenAlexFDO

Authors Walter Kern

Publication date 9 January 1994

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

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

zbMATH Keywords

depthSimulated Annealinghill climbing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A note on the depth function of combinatorial optimization problems
• scientific article; zbMATH DE number 18531
• scientific article; zbMATH DE number 4085427
• scientific article; zbMATH DE number 4079162
• The depth and width of local minima in discrete solution spaces

Cites work

• scientific article; zbMATH DE number 3873377 (Why is no real title available?)
• scientific article; zbMATH DE number 3932819 (Why is no real title available?)
• scientific article; zbMATH DE number 3196612 (Why is no real title available?)
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Convergence of an annealing algorithm
• Cooling Schedules for Optimal Annealing
• How easy is local search?
• Matching theory
• On the Complexity of Local Search for the Traveling Salesman Problem
• The shortest path and the shortest road through n points
• Two-Processor Scheduling with Start-Times and Deadlines

Cited in

(9)

• Simulated annealing: An introduction
• An efficient local search method for random 3-satisfiability
• The depth and width of local minima in discrete solution spaces
• On the classification of NP-complete problems in terms of their correlation coefficient
• A note on the depth function of combinatorial optimization problems
• The Complexity of Combinatorial Optimization Problems on d‐Dimensional Boxes
• Landscapes on spaces of trees
• On Combinatorial Depth Measures
• Metaheuristics: A bibliography

This page was built for publication: On the depth of combinatorial optimization problems

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