The following pages link to ConicBundle (Q17258):
Displayed 18 items.
- Minimizing value-at-risk in single-machine scheduling (Q513548) (← links)
- Lagrangian decompositions for the two-level FTTx network design problem (Q743641) (← links)
- Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs (Q1621689) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- Integration of progressive hedging and dual decomposition in stochastic integer programs (Q1785365) (← links)
- Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework (Q2029367) (← links)
- Mixing convex-optimization bounds for maximum-entropy sampling (Q2044968) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- Dynamic graph generation for the shortest path problem in time expanded networks (Q2436645) (← links)
- On parallelizing dual decomposition in stochastic integer programming (Q2450615) (← links)
- The State-of-the-Art in Conic Optimization Software (Q2802542) (← links)
- Exact Solution Methods for the k-Item Quadratic Knapsack Problem (Q2835673) (← links)
- Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation (Q2917354) (← links)
- A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses (Q3392109) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method (Q5265177) (← links)
- Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation (Q5364279) (← links)