The volume algorithm: producing primal solutions with a subgradient method

Francisco Barahona; Ranga Anbil

doi:10.1007/s101070050002

journal article May 01, 2000

The volume algorithm: producing primal solutions with a subgradient method

Francisco Barahona Ranga Anbil

Mathematical Programming Vol. 87 No. 3 pp. 385-399 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/s101070050002

Topics

No keywords indexed for this article. Browse by subject →

Cited By

212

Extreme-scale EV charging infrastructure planning for last-mile delivery using high-performance parallel computing

Waquar Kaleem, Taner Cokyasar · 2026

Transportation Research Part B: Met...

Matheuristics: using mathematics for heuristic design

Marco Antonio Boschetti, Vittorio Maniezzo · 2022

4OR

A Lagrangian bound for many-to-many assignment problems

Igor Litvinchev, Socorro Rangel · 2008

Journal of Combinatorial Optimizati...

Lagrangian relaxation based algorithm for trigeneration planning with storages

Aiying Rong, Risto Lahdelma · 2008

European Journal of Operational Res...

Benders decomposition, Lagrangean relaxation and metaheuristic design

Marco Boschetti, Vittorio Maniezzo · 2007

Journal of Heuristics

The omnipresence of Lagrange

Claude Lemaréchal · 2007

Annals of Operations Research

About Lagrangian Methods in Integer Optimization

Antonio Frangioni · 2005

Annals of Operations Research

Selected Topics in Column Generation

Marco E. Lübbecke, Jacques Desrosiers · 2005

Operations Research

Lagrangean relaxation

Monique Guignard · 2003

Top

Metrics

212

Citations

0

References

Details

Published: May 01, 2000
Vol/Issue: 87(3)
Pages: 385-399
License: View

Authors

Cite This Article

Francisco Barahona, Ranga Anbil (2000). The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming, 87(3), 385-399. https://doi.org/10.1007/s101070050002

The volume algorithm: producing primal solutions with a subgradient method

You May Also Like