B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-005-3967-3 / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-005-3967-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089185195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A finite branch-and-bound algorithm for two-stage stochastic integer programs / 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: Telecommunication network capacity design for uncertain demand / 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: Introduction to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual decomposition in stochastic integer programming / 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: Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4363169 / 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: Q3738922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Optimal Allocation of Indivisibles Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method for stochastic global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A disjunctive cutting plane procedure for general mixed-integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-005-3967-3 / rank
 
Normal rank

Latest revision as of 03:58, 10 December 2024

scientific article
Language Label Description Also known as
English
B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty
scientific article

    Statements

    B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2006
    0 references
    stochastic integer programming
    0 references
    integer L-shaped decomposition
    0 references
    branch and bound
    0 references
    network design
    0 references

    Identifiers

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