Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing (Q1379745)

From MaRDI portal
Revision as of 16:26, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing
scientific article

    Statements

    Learning to recognize (un)promising simulated annealing runs: Efficient search procedures for job shop scheduling and vehicle routing (English)
    0 references
    0 references
    0 references
    0 references
    20 September 1998
    0 references
    simulated annealing
    0 references
    near-optimal solutions
    0 references
    vehicle routing
    0 references
    time windows
    0 references

    Identifiers