Preprocessing in Stochastic Programming: The Case of Linear Programs
From MaRDI portal
Recommendations
Cited in
(21)- Competing output-sensitive frame algorithms
- Clustering-based preconditioning for stochastic programs
- A stochastic optimization approach for robot scheduling
- A new procedure for identifying the frame of the convex hull of a finite collection of points in multidimensional space
- Geometry of optimal value functions with applications to redundancy in linear programming
- A comprehensive input format for stochastic linear programs
- Parallelizable preprocessing method for multistage stochastic programming problems
- scientific article; zbMATH DE number 4029263 (Why is no real title available?)
- Designing a majorization scheme for the recourse function in two-stage stochastic linear programming
- scientific article; zbMATH DE number 1187207 (Why is no real title available?)
- Computation of efficient solutions of discretely distributed stochastic optimization problems
- Consistency, redundancy, and implied equalities in linear systems
- scientific article; zbMATH DE number 958363 (Why is no real title available?)
- On the formulation of stochastic linear programs using algebraic modelling languages
- Preprocessing in Stochastic Programming: The Case of Capacitated Networks
- On a new collection of stochastic linear programming test problems
- SLP-IOR: An interactive model management system for stochastic linear programs
- Finding and identifying optimal inventory levels for systems with common components
- An algorithm to find the lineality space of the positive hull of a set of vectors
- Preprocessing in Stochastic Programming: The Case of Uncapacitated Networks
- Feasibility in capacitated networks: The effect of individual arcs and nodes
This page was built for publication: Preprocessing in Stochastic Programming: The Case of Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3993667)