Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937)

From MaRDI portal
Revision as of 14:28, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems
scientific article

    Statements

    Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (English)
    0 references
    0 references
    28 July 2015
    0 references
    0 references
    metaheuristics
    0 references
    greedy algorithms
    0 references
    knapsack/covering problems
    0 references
    surrogate constraints
    0 references
    multi-start/strategic oscillation
    0 references
    tabu search
    0 references
    0 references
    0 references
    0 references
    0 references