Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972997295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120330 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes from conditional bounds: A new approach to set covering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening cuts for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facial disjunctive programs and sequences of cutting-planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3325466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194705 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5511854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank

Latest revision as of 13:22, 17 June 2024

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
    1985
    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

    Identifiers

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