Solving Large Batches of Linear Programs
From MaRDI portal
Publication:5138265
DOI10.1287/IJOC.2018.0838OpenAlexW2938267440MaRDI QIDQ5138265FDOQ5138265
Curry Stewart, Lee Ilbin, Serban Nicoleta
Publication date: 3 December 2020
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0838
Cites Work
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A simulation-based approach to two-stage stochastic programming with recourse
- Accelerating the regularized decomposition method for two stage stochastic linear problems
- Global Sensitivity Analysis
- Linear parametric programming—A brief survey
- Rim Multiparametric Linear Programming
- Multiparametric Linear Programming
- Parametric Objective Function (Part 2)—Generalization
- Computation in Discrete Stochastic Programs with Recourse
- Title not available (Why is that?)
- Multiparametric demand transportation problem
- Spatial accessibility of pediatric primary healthcare: measurement and inference
Cited In (7)
- Quantifying outcome functions of linear programs: an approach based on interval-valued right-hand sides
- Title not available (Why is that?)
- Using massively parallel computations for absolutely precise solution of the linear programming problems
- Vector Space Decomposition for Solving Large-Scale Linear Programs
- Global sensitivity analysis via a statistical tolerance approach
- Title not available (Why is that?)
- Solving tall dense linear programs in nearly linear time
Uses Software
This page was built for publication: Solving Large Batches of Linear Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138265)
