Target-based distributionally robust minimum spanning tree problem
From MaRDI portal
Cites work
- A Benders decomposition approach for the robust spanning tree problem with interval data
- A branch and bound algorithm for the robust spanning tree problem with interval data
- A polynomial solvable minimum risk spanning tree problem with interval data
- A randomly weighted minimum arborescence with a random cost constraint
- A stronger lower bound on parametric minimum spanning trees
- Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning
- Bounding Distributions for the Weight of a Minimum Spanning Tree in Stochastic Networks
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems
- Chance-constrained programming models and approximations for general stochastic bottleneck spanning tree problems
- Confidence regional method of stochastic spanning tree problem
- Distributionally robust discrete optimization with entropic Value-at-Risk
- Emergence of Scaling in Random Networks
- Frameworks and results in distributionally robust optimization
- Goal-driven optimization
- scientific article; zbMATH DE number 2042286 (Why is no real title available?)
- scientific article; zbMATH DE number 795222 (Why is no real title available?)
- scientific article; zbMATH DE number 1444281 (Why is no real title available?)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction
- Interval elimination method for stochastic spanning tree problem
- Managing underperformance risk in project portfolio selection
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
- Minimum spanning trees in networks with varying edge weights
- On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph
- On the complexity of the robust spanning tree problem with interval data
- Recoverable robust spanning tree problem under interval uncertainty representations
- Robust CARA optimization
- Robust discrete optimization and network flows
- Robust discrete spanning tree problem: local search algorithms
- Routing optimization under uncertainty
- Routing optimization with time windows under uncertainty
- Smoothed analysis of algorithms
- Some remarks on the value-at-risk and the conditional value-at-risk
- Stochastic bottleneck spanning tree problem
- Stochastic finance. An introduction in discrete time
- Stochastic spanning tree problem
- The Inventory Routing Problem Under Uncertainty
- The robust minimum spanning tree problem: compact and convex uncertainty
- The robust spanning tree problem with interval data
- Theory and applications of robust optimization
This page was built for publication: Target-based distributionally robust minimum spanning tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233808)
