On the Existence of a Feasible Flow in a Stochastic Transportation Network

DOI10.1287/OPRE.39.1.119zbMath0747.90041DBLPjournals/ior/PrekopaB91OpenAlexW1993504313WikidataQ59561047 ScholiaQ59561047MaRDI QIDQ3981512

Endre Boros, Prékopa, András

Publication date: 26 June 1992

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8f47290391c4dd98d7cfc48e849bac9c5e9dff01

zbMATH Keywords

lower and upper boundsredundant inequalitiestransportation network analysis

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic network models in operations research (90B15)

Related Items (11)

New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions ⋮ On the relationship between the discrete and continuous bounding moment problems and their numerical solutions ⋮ Feasibility in uncapacitated networks: The effect of individual arcs and nodes ⋮ Uncertain minimum cost flow problem ⋮ Best second order bounds for two-terminal network reliability with dependent edge failures ⋮ Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard ⋮ Improved bounds on the probability of the union of events some of whose intersections are empty ⋮ Single Commodity Stochastic Network Design Under Probabilistic Constraint with Discrete Random Variables ⋮ The Discrete Moment Problem with Nonconvex Shape Constraints ⋮ The value of shape constraints in discrete moment problems: a review and extension ⋮ The facets of the polyhedral set determined by the Gale-Hoffman inequalities

This page was built for publication: On the Existence of a Feasible Flow in a Stochastic Transportation Network