ConicBundle

swMATH5118MaRDI QIDQ17258FDOQ17258

Author name not available (Why is that?)

Cited In (18)

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

This page was built for software: ConicBundle