Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems

DOI10.1287/ijoc.2014.0627zbMath1329.90154OpenAlexW1972775205MaRDI QIDQ3466775

Jue Wang, Siqian Shen, Murat Kurt

Publication date: 25 January 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2014.0627

zbMATH Keywords

chance-constrained programmingNP-completespecial ordered setsbisection algorithmstochastic bottleneck spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Stochastic programming (90C15)

Related Items

Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• A branch and bound method for stochastic global optimization
• Monte Carlo bounding techniques for determinig solution quality in stochastic programs
• Bounds for probabilistic integer programming problems
• Chance constrained bottleneck spanning tree problem
• Models and solution techniques for production planning problems with increasing byproducts
• On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Stochastic bottleneck spanning tree problem
• Practical Solution of Large Mixed Integer Programming Problems with Umpire
• Global optimization using special ordered sets
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems