Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (Q934793): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-007-9245-y / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1998209152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic capacity acquisition and assignment under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming / 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: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: L-shaped decomposition of two-stage stochastic programs with integer recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach to mixed 0-1 stochastic integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: The million-variable ``march'' for stochastic combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of decomposition algorithms for stochastic combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondifferentiable reverse convex programs and facetial convexity cuts via a disjunctive characterization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization with disjunctive constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-007-9245-Y / rank
 
Normal rank

Latest revision as of 08:48, 10 December 2024

scientific article
Language Label Description Also known as
English
Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs
scientific article

    Statements

    Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs (English)
    0 references
    0 references
    0 references
    30 July 2008
    0 references
    Stochastic programming
    0 references
    Integer programming
    0 references
    Disjunctive programming
    0 references
    Lift-and-project cuts
    0 references
    0 references

    Identifiers