Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (Q2815438): 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: W2127350048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthening cuts for mixed integer programs / 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: Partitioning procedures for solving mixed-variables programming problems / 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: A converse for disjunctive constraints / 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: A Cutting-Plane Game for Facial Disjunctive Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic integer programming: general models and algorithms / 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: Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse / 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: Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continuity Properties of Expectation Functions in Stochastic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic programming with integer variables / 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: On the convergence of cutting plane algorithms for a class of nonconvex mathematical programs / 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: Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Cut Generation Methods for Decomposition-Based Branch and Cut for Two-Stage Stochastic Mixed-Integer Programs / rank
 
Normal rank

Latest revision as of 06:39, 12 July 2024

scientific article
Language Label Description Also known as
English
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints
scientific article

    Statements

    Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints (English)
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    0 references
    stochastic integer programming
    0 references
    disjunctive decomposition
    0 references
    generalized upper bound constraints
    0 references
    stochastic scheduling
    0 references
    0 references
    0 references
    0 references