ConicBundle
From MaRDI portal
Software:17258
No author found.
Related Items (18)
Algorithmic innovations and software for the dual decomposition method applied to stochastic mixed-integer programs ⋮ Improved exact approaches for row layout problems with departments of equal length ⋮ 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 ⋮ Dynamic graph generation for the shortest path problem in time expanded networks ⋮ On parallelizing dual decomposition in stochastic integer programming ⋮ Global solution of non-convex quadratically constrained quadratic programs ⋮ Minimizing value-at-risk in single-machine scheduling ⋮ Integration of progressive hedging and dual decomposition in stochastic integer programs ⋮ Implementing the branch-and-cut approach for a general purpose Benders' decomposition framework ⋮ The State-of-the-Art in Conic Optimization Software ⋮ Mixing convex-optimization bounds for maximum-entropy sampling ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ Lagrangian decompositions for the two-level FTTx network design problem ⋮ A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses ⋮ Exact Solution Methods for the k-Item Quadratic Knapsack Problem ⋮ Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation ⋮ Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method
This page was built for software: ConicBundle
