On improvements to the analytic center cutting plane method
From MaRDI portal
Publication:1273420
DOI10.1023/A:1018318117350zbMath0912.90230OpenAlexW1544036702MaRDI QIDQ1273420
Olivier du Merle, Jean-Philippe Vial, Jean-Louis Goffin
Publication date: 7 December 1998
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018318117350
Related Items
Lagrangean relaxation. (With comments and rejoinder)., Accelerating column generation for variable sized bin-packing problems, A decomposition method for solving multicommodity network equilibria, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, A column generation approach to capacitated \(p\)-median problems, Large-scale unit commitment under uncertainty: an updated literature survey, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, A branch-and-price approach to \(p\)-median location problems, Bundle-based relaxation methods for multicommodity capacitated fixed charge network design, An effective line search for the subgradient method, New approaches for optimizing over the semimetric polytope, Large-scale unit commitment under uncertainty, About Lagrangian methods in integer optimization
Uses Software
