On the depth of combinatorial optimization problems
type: Item
instance of: scholarly article
title: On the depth of combinatorial optimization problems
zbMATH Open document ID: 0778.68042
DOI: 10.1016/0166-218X(93)90003-7
published in: Discrete Applied Mathematics
publication date: 1994-01-09T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 94C10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 205581
zbMATH Keywords: hill climbing
zbMATH Keywords: depth
zbMATH Keywords: Simulated Annealing
author: Walter Kern
MaRDI profile type: Publication
cites work: The shortest path and the shortest road through n points
cites work: Two-Processor Scheduling with Start-Times and Deadlines
cites work: Cooling Schedules for Optimal Annealing
cites work: Q5732992
cites work: How easy is local search?
cites work: Q3707785
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q3340896
cites work: Matching theory
cites work: Convergence of an annealing algorithm
cites work: On the Complexity of Local Search for the Traveling Salesman Problem
full work available at URL: 0166-218x(93)90003-7
OpenAlex ID: W2027960705
description: scientific article; zbMATH DE number 205581