The volume algorithm revisited: relation with bundle methods
From MaRDI portal
Recommendations
- A class of volume-preserving numerical algorithms
- A practical volume algorithm
- Volume as a measure of approximation for the Jacobi-Perron algorithm
- An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- Algorithmic aspects of alternating sum of volumes. II: Nonconvergence and its remedy
- Volume-preserving schemes and applications
- Exact volume computation for polytopes: A practical study
- A cubic algorithm for computing Gaussian volume
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
Cited in
(33)- Two ``well-known properties of subgradient optimization
- Adjustment of O-D trip matrices from observed volumes: an algorithmic approach based on conjugate directions.
- The volume algorithm: Producing primal solutions with a subgradient method
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem
- Large-scale unit commitment under uncertainty: an updated literature survey
- Lagrangean relaxation. (With comments and rejoinder).
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Volume computation for sparse Boolean quadric relaxations
- Primal convergence from dual subgradient methods for convex optimization
- Large-scale unit commitment under uncertainty
- Dynamic bundle methods
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches
- Comparison of bundle and classical column generation
- New approaches for optimizing over the semimetric polytope
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
- A stabilized structured Dantzig-Wolfe decomposition method
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
- Essentials of numerical nonsmooth optimization
- The omnipresence of Lagrange
- Essentials of numerical nonsmooth optimization
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem
- Polyhedral results and stronger Lagrangean bounds for stable spanning trees
- Lagrangian heuristic for a class of the generalized assignment problems
- On embedding the volume algorithm in a variable target value method.
- Hub-and-spoke network design and fleet deployment for string planning of liner shipping
- Algorithmic aspects of alternating sum of volumes. I: Data structure and difference operation
- About Lagrangian methods in integer optimization
- A Lagrangian bound for many-to-many assignment problems
- The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation
This page was built for publication: The volume algorithm revisited: relation with bundle methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1396813)