Heuristic analysis, linear programming and branch and bound (Q3885519)

From MaRDI portal
Revision as of 08:08, 20 October 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
Heuristic analysis, linear programming and branch and bound
scientific article

    Statements

    Heuristic analysis, linear programming and branch and bound (English)
    0 references
    0 references
    1980
    0 references
    heuristic algorithms
    0 references
    cutting stock
    0 references
    travelling salesman
    0 references
    enumeration schemes
    0 references
    branch and bound algorithms
    0 references
    worst case behaviour
    0 references
    multidimensional knapsack problem
    0 references
    uncapacitated K-location problem
    0 references
    Benders' algorithm
    0 references
    bin packing
    0 references
    duality gaps
    0 references
    dynamic programming
    0 references
    longest Hamiltonian tour
    0 references
    matching heuristic
    0 references
    Eulerian tours
    0 references

    Identifiers

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