Cited in
(28)- A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses
- Integration of progressive hedging and dual decomposition in stochastic integer programs
- The state-of-the-art in conic optimization software
- Mixing convex-optimization bounds for maximum-entropy sampling
- Dynamic graph generation for the shortest path problem in time expanded networks
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs
- Global solution of non-convex quadratically constrained quadratic programs
- Exact solution methods for the \(k\)-item quadratic knapsack problem
- Minimizing value-at-risk in single-machine scheduling
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework
- Improved exact approaches for row layout problems with departments of equal length
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
- DSP
- SLPTESTSET
- SBmethod
- SIPLIB
- On parallelizing dual decomposition in stochastic integer programming
- EIQP IIQP
- MIQCR-CB
- ddsip
- IQCP/MIQCP
- BBCPOP
- RowLayout
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Using a conic bundle method to accelerate both phases of a quadratic convex reformulation
- Solving \(k\)-way graph partitioning problems to optimality: the impact of semidefinite relaxations and the bundle method
- Lagrangian decompositions for the two-level FTTx network design problem
- Towards solving very large scale train timetabling problems by Lagrangian relaxation
This page was built for software: ConicBundle
