Preprocessing in Stochastic Programming: The Case of Capacitated Networks
From MaRDI portal
Publication:4835448
DOI10.1287/IJOC.7.1.44zbMATH Open0822.90106OpenAlexW4234599141MaRDI QIDQ4835448FDOQ4835448
Authors: Stein W. Wallace, Roger J.-B. Wets
Publication date: 1 June 1995
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.7.1.44
Recommendations
- Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
- Preprocessing in Stochastic Programming: The Case of Linear Programs
- Solving stochastic programs with network recourse
- Generalized networks: the theory of preprocessing and an empirical analysis
- Parallelizable preprocessing method for multistage stochastic programming problems
Cited In (5)
- Solving stochastic programs with network recourse
- Consistency, redundancy, and implied equalities in linear systems
- Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
- Preprocessing in Stochastic Programming: The Case of Linear Programs
- Feasibility in capacitated networks: The effect of individual arcs and nodes
This page was built for publication: Preprocessing in Stochastic Programming: The Case of Capacitated Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835448)