A hierarchy of relaxations for linear generalized disjunctive programming (Q421708): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential convexification in reverse convex and disjunctive programming / 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: Convex programming for disjunctive convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of nonlinear mixed-integer and disjunctive programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convex disjunctive programming: Nonlinear convex hull relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the guillotine strip cutting/packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132247 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representability in mixed integer programming. I: Characterization results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based decision support. Mixed integer model formulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling with integer variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut method for 0-1 mixed convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347628 / rank
 
Normal rank

Latest revision as of 05:52, 5 July 2024

scientific article
Language Label Description Also known as
English
A hierarchy of relaxations for linear generalized disjunctive programming
scientific article

    Statements

    A hierarchy of relaxations for linear generalized disjunctive programming (English)
    0 references
    0 references
    0 references
    14 May 2012
    0 references
    integer programming
    0 references
    disjunctive programming
    0 references
    hull relaxation
    0 references

    Identifiers