A comparative study of decomposition algorithms for stochastic combinatorial optimization (Q1001189): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965736643 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. / 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: Disjunctive Programming / 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: Q4851830 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schumann, a modeling framework for supply chain management under uncertainty / 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: Computational solution of capacity planning models under uncertainty / 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 million-variable ``march'' for stochastic combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452916 / 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: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sample average approximation method applied to stochastic routing problems: a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location models for immobile servers with stochastic demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program / rank
 
Normal rank

Latest revision as of 02:19, 29 June 2024

scientific article
Language Label Description Also known as
English
A comparative study of decomposition algorithms for stochastic combinatorial optimization
scientific article

    Statements

    A comparative study of decomposition algorithms for stochastic combinatorial optimization (English)
    0 references
    0 references
    0 references
    13 February 2009
    0 references
    0 references
    Stochastic mixed-integer programming
    0 references
    Disjunctive decomposition
    0 references
    Stochastic server location
    0 references
    Strategic supply chain planning
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references