Pages that link to "Item:Q3981512"

The following pages link to On the Existence of a Feasible Flow in a Stochastic Transportation Network (Q3981512):

Displaying 17 items.

• On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
• Uncertain minimum cost flow problem (Q894387) (← links)
• Robust network optimization under polyhedral demand uncertainty is \(NP\)-hard (Q968181) (← links)
• The facets of the polyhedral set determined by the Gale-Hoffman inequalities (Q1321672) (← links)
• Improved bounds on the probability of the union of events some of whose intersections are empty (Q1785461) (← links)
• Feasibility in uncapacitated networks: The effect of individual arcs and nodes (Q1918428) (← links)
• Best second order bounds for two-terminal network reliability with dependent edge failures (Q1961463) (← links)
• The value of shape constraints in discrete moment problems: a review and extension (Q2095900) (← links)
• Probabilistic constrained optimization on flow networks (Q2147905) (← links)
• Convexity and starshapedness of feasible sets in stationary flow networks (Q2197223) (← links)
• New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions (Q2357784) (← links)
• Single commodity stochastic network design under probabilistic constraint with discrete random variables (Q2797468) (← links)
• Note on independence of arcs in antiparallel for network flow problems (Q3688062) (← links)
• Probabilistic Analysis of the Capacitated Transportation Problem (Q3799791) (← links)
• Bounding a Probability Measure Over a Polymatroid with an Application to Transportation Problems (Q4294733) (← links)
• The probability of the existence of a feasible flow in a stochastic transportation network (Q4632944) (← links)
• The Discrete Moment Problem with Nonconvex Shape Constraints (Q4994156) (← links)