Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
type: Item
instance of: scholarly article
title: Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
zbMATH Open document ID: 1330.90057
author: Yongjia Song
author: James Luedtke
published in: Mathematical Programming Computation
publication date: 2014-10-06T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6351712
zbMATH Keywords: reliable network design
zbMATH Keywords: chance constraints
zbMATH Keywords: integer programming
describes a project that uses: SCIP
describes a project that uses: CPLEX
describes a project that uses: OR-Library
describes a project that uses: LEMON
MaRDI profile type: Publication
full work available at URL: s12532-013-0058-3
OpenAlex ID: W2044698871
cites work: Conflict analysis in mixed integer programming
cites work: Q3056948
cites work: Mathematical programming algorithms for two-path routing problems with reliability considerations
cites work: Embedding \(\{0, \frac{1}{2}\}\)-cuts in a branch-and-cut framework: a computational study
cites work: An integer linear programming approach to the steiner problem in graphs
cites work: The mixed vertex packing problem.
cites work: Separation of partition inequalities
cites work: An exact approach for solving integer problems under probabilistic constraints with random technology matrix
cites work: Network reliability design via joint probabilistic constraints
cites work: The Probabilistic Set-Covering Problem
cites work: Uncertain convex programs: randomized solutions and confidence levels
cites work: The Scenario Approach to Robust Control Design
cites work: A sampling-and-discarding approach to chance-constrained optimization: feasibility and Optimality
cites work: Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
cites work: On the spanning tree polyhedron
cites work: Stochastic network interdiction
cites work: Concavity and efficient points of discrete distributions in probabilistic programming.
cites work: Cutting plane versus compact formulations for uncertain (integer) linear programs
cites work: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements
cites work: Mixing mixed-integer inequalities
cites work: A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
cites work: On mixing sets arising in chance-constrained programming
cites work: An Integer Programming and Decomposition Approach to General Chance-Constrained Mathematical Programs
cites work: A Sample Approximation Approach for Optimization with Probabilistic Constraints
cites work: An integer programming approach for linear programs with probabilistic constraints
cites work: Strong formulations for network design problems with connectivity requirements
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Q4040221
cites work: Q5201292
cites work: Convex Approximations of Chance Constrained Programs
cites work: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution
cites work: Probabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
cites work: MIP reformulations of the probabilistic set covering problem
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Computational risk management techniques for fixed charge network flow problems with uncertain arc failures
cites work: IIS branch-and-cut for joint chance-constrained stochastic programs and application to optimal vaccine allocation
cites work: On the Problem of Decomposing a Graph into n Connected Factors
DOI: 10.1007/S12532-013-0058-3
description: scientific article; zbMATH DE number 6351712