Facets of the Stochastic Network Flow Problem
From MaRDI portal
Publication:5124001
DOI10.1137/19M1286049zbMath1450.90056MaRDI QIDQ5124001
Michael O. Ball, Alexander S. Estes
Publication date: 17 September 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
- A survey of dynamic network flows
- Flows on hypergraphs
- Gainfree Leontief substitution flow problems
- Directed hypergraphs and applications
- Extreme points of Leontief substitution systems
- Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem
- Extremal problems for cycles in graphs
- An Introduction to Network Flows over Time
- Algorithms for Finding Optimal Flows in Dynamic Networks
- Polyhedral Characterization of Discrete Dynamic Programming
- A Stochastic Integer Program with Dual Network Structure and Its Application to the Ground-Holding Problem
- Solving multistage stochastic networks: An application of scenario aggregation
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
- Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
- An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
- Introduction to Stochastic Programming
- A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
- A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
- Packing rooted directed cuts in a weighted directed graph
- Reducibility among Combinatorial Problems
- Optimum branchings
This page was built for publication: Facets of the Stochastic Network Flow Problem
