A Lagrangian-based heuristic for large-scale set covering problems (Q1290617)

From MaRDI portal
Revision as of 03:06, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Lagrangian-based heuristic for large-scale set covering problems
scientific article

    Statements

    A Lagrangian-based heuristic for large-scale set covering problems (English)
    0 references
    0 references
    0 references
    0 references
    5 September 1999
    0 references
    primal-dual Lagrangian
    0 references
    subgradient algorithms
    0 references
    0-1 programming
    0 references
    approximate solutions
    0 references
    railways
    0 references
    Italian railways
    0 references
    Lagrangian-based heuristic
    0 references
    large-scale set-covering problems
    0 references
    crew-scheduling
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references