Weak flow cover inequalities for the capacitated facility location problem
- 1 March 2021
- journal article
- research article
- Published by Elsevier in European Journal of Operational Research
- Vol. 289 (2) , 485-494
Abstract
No abstract availableKeywords
Funding Information
- Ministero dell’Istruzione, dell’Università e della Ricerca (20153TXRX9, 2015B5F27W)
This publication has 14 references indexed in Scilit:
- Benders decomposition without separability: A computational study for capacitated facility location problemsEuropean Journal of Operational Research, 2016
- A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location ProblemINFORMS Journal on Computing, 2012
- Kernel search for the capacitated facility location problemJournal of Heuristics, 2012
- Xpress–Mosel2011
- A cutting plane algorithm for the capacitated facility location problemComputational Optimization and Applications, 2007
- Reformulation of capacitated facility location problems:How redundant information can helpAnnals of Operations Research, 1998
- Capacitated facility location: Separation algorithms and computational experienceMathematical Programming, 1998
- Capacitated Facility Location: Valid Inequalities and FacetsMathematics of Operations Research, 1995
- A comparison of heuristics and relaxations for the capacitated plant location problemEuropean Journal of Operational Research, 1991
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and FacetsMathematics of Operations Research, 1983