Facets of the stochastic network flow problem

DOI10.1137/19M1286049MaRDI QIDQ5124001zbMATH OpenFDO

Authors Alexander S. Estes, Michael O. Ball

Publication date 17 September 2020

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/19M1286049

zbMATH Keywords

directed hypergraphsF-graphsfacet-defining inequalitiesnetwork flowstochastic integer programming

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 147499
• Minimum cost flows with minimum quantities
• A class of chance constrained network optimization problems
• The minimum cover flow problem in networks
• Flows on hypergraphs

Cites work

• A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
• A Stochastic Integer Program with Dual Network Structure and Its Application to the Ground-Holding Problem
• A Successive Linear Approximation Procedure for Stochastic, Dynamic Vehicle Allocation Problems
• A survey of dynamic network flows
• Algorithms for finding optimal flows in dynamic networks
• An Algorithm for Multistage Dynamic Networks with Random Arc Capacities, with an Application to Dynamic Fleet Management
• An arc-exchange decomposition method for multistage dynamic networks with random arc capacities
• An introduction to network flows over time
• Directed hypergraphs and applications
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem
• Extremal problems for cycles in graphs
• Extreme points of Leontief substitution systems
• Flows on hypergraphs
• Gainfree Leontief substitution flow problems
• Introduction to Stochastic Programming
• Optimum branchings
• Packing rooted directed cuts in a weighted directed graph
• Polyhedral Characterization of Discrete Dynamic Programming
• Reducibility among combinatorial problems
• Restricted Recourse Strategies for Dynamic Networks with Random Arc Capacities
• Solving multistage stochastic networks: An application of scenario aggregation

Cited in

(7)

• Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope
• scientific article; zbMATH DE number 3904300 (Why is no real title available?)
• scientific article; zbMATH DE number 3976729 (Why is no real title available?)
• scientific article; zbMATH DE number 1837663 (Why is no real title available?)
• Optimal Flows in Stochastic Dynamic Networks with Congestion
• On the expected value of stochastic linear programs and (dynamic) network flow problems
• Last fifty years of integer linear programming: a focus on recent practical advances

This page was built for publication: Facets of the stochastic network flow problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124001)