On the depth of combinatorial optimization problems (Q1801676): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q170461
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Walter Kern / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: The shortest path and the shortest road through <i>n</i> points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Processor Scheduling with Start-Times and Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cooling Schedules for Optimal Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of an annealing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Local Search for the Traveling Salesman Problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(93)90003-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027960705 / rank
 
Normal rank

Latest revision as of 10:08, 30 July 2024

scientific article
Language Label Description Also known as
English
On the depth of combinatorial optimization problems
scientific article

    Statements

    On the depth of combinatorial optimization problems (English)
    0 references
    9 January 1994
    0 references
    hill climbing
    0 references
    depth
    0 references
    Simulated Annealing
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references