SICOpt: Solution approach for nonlinear integer stochastic programming problems
From MaRDI portal
Publication:1039361
DOI10.1007/s10957-009-9555-yzbMath1175.90301OpenAlexW2031204717WikidataQ62635465 ScholiaQ62635465MaRDI QIDQ1039361
Patrizia Beraldi, Domenico Conforti, Antonio Violi
Publication date: 27 November 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-009-9555-y
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Stochastic programming (90C15) Interior-point methods (90C51)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The stochastic trim-loss problem
- Warm start of the primal-dual method applied in the cutting-plane scheme
- An improved branch and bound algorithm for mixed integer nonlinear programs
- A globally convergent primal-dual interior point algorithm for convex programming
- A scalable parallel interior point algorithm for stochastic linear programming and robust optimization
- Decomposition methods in stochastic programming
- Solving stochastic linear programs with restricted recourse using interior point methods
- Efficient solution of two-stage stochastic linear programs using interior point methods
- An implementation of Karmarkar's algorithm for linear programming
- Rolling-horizon and fix-and-relax heuristics for the parallel machine lot-sizing and scheduling problem with sequence-dependent set-up costs
- Convexity and decomposition of mean-risk stochastic programs
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse
- Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
- Formulating Two-Stage Stochastic Programs for Interior Point Methods
- On the Implementation of a Primal-Dual Interior Point Method
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- A modified Schur-complement method for handling dense columns in interior-point methods for linear programming
- LOQO:an interior point code for quadratic programming
This page was built for publication: SICOpt: Solution approach for nonlinear integer stochastic programming problems