Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LEMON / 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/s12532-013-0058-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044698871 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict analysis in mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer linear programming approach to the steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed vertex packing problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation of Partition Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for solving integer problems under probabilistic constraints with random technology matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network reliability design via joint probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncertain convex programs: randomized solutions and confidence levels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Scenario Approach to Robust Control Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the spanning tree polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Network Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concavity and efficient points of discrete distributions in probabilistic programming. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixing mixed-integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mixing sets arising in chance-constrained programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sample Approximation Approach for Optimization with Probabilistic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for linear programs with probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong formulations for network design problems with connectivity requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5201292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Approximations of Chance Constrained Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIP reformulations of the probabilistic set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational risk management techniques for fixed charge network flow problems with uncertain arc failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank

Latest revision as of 02:29, 9 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
scientific article

    Statements

    Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (English)
    0 references
    0 references
    0 references
    6 October 2014
    0 references
    reliable network design
    0 references
    chance constraints
    0 references
    integer programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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