Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274)

From MaRDI portal
Revision as of 14:22, 17 June 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
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
scientific article

    Statements

    Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (English)
    0 references
    0 references
    0 references
    1985
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convexification of discrete optimization problems
    0 references
    approximations to the convex hull of the feasible set
    0 references
    disjunctive programming
    0 references
    unions of polyhedra
    0 references
    relaxations
    0 references
    critical path problems
    0 references
    network synthesis
    0 references
    fixed charge network flow problems
    0 references
    machine sequencing
    0 references
    0 references