Fast bounding procedures for large instances of the Simple Plant Location Problem (original) (raw)
Related papers
On the exact solution of large-scale simple plant location problems
NTIS, SPRINGFIELD, VA(USA), 1987, 32, 1987
Branch and peg algorithms for the simple plant location problem
2003
An aggressive reduction scheme for the simple plant location problem
European Journal of Operational Research, 2014
A strengthened formulation for the simple plant location problem with order
Operations Research Letters, 2007
Solving the uncapacited plant location problem on trees
Discrete Applied Mathematics, 1994
A separation algorithm for the simple plant location problem
Operations Research Letters, 2021
A note on duality gap in the simple plant location problem
European Journal of Operational Research, 2006
A fast algorithm for generalized network location problems
Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing states of the art and practice - SAC '93, 1993
Location Science, 1996
Bounds for the single source modular capacitated plant location problem
Computers & Operations Research, 2006
Comparing performances of several algorithms for solving the simple plant location problem
Improved approximation guarantees for lower-bounded facility location problem
2010
ACM-SIAM Symposium on Discrete Algorithms, 2002
Journal of the ACM, 1984
The k-centrum multi-facility location problem
Discrete Applied Mathematics, 2001
Equivalent instances of the simple plant location problem
2000
An 0.828-approximation algorithm for the uncapacitated facility location problem
Discrete Applied Mathematics, 1999
Approximation algorithms for hard capacitated k-facility location problems
European Journal of Operational Research, 2015
Approximation algorithms for the capacitated k-facility location problems
Pieter van Den Berg, Shanfei Li, Dion Gijswijt
2013
The single facility location problem with minimum distance constraints
Location Science, 1997
Boolean and Graph Theoretic Formulation of the Simple Plant Location Problem
1987
Improved Approximation Guarantees for Lower-Bounded Facility Location
Approximation and Online Algorithms, 2013
Improved local search for universal facility location
Journal of Combinatorial Optimization, 2014
Operations Research Letters, 1985
A heuristic method for large-scale multi-facility location problems
Computers & Operations Research, 2004
Solving the simple plant location problem using a data correcting approach
2003
The heuristic concentration-integer and its application to a class of location problems
Michelle Mizumori, Vladimir Marianov
Computers & Operations Research, 2009
ArXiv, 2021
Discrete Applied Mathematics, 1998
Lower and upper bounds for a two-level hierarchical location problem in computer networks
Computers & Operations Research, 2008
A practical heuristic for maximum coverage in large-scale continuous location problem
2021
A branch-and-cut algorithm for the plant-cycle location problem
Journal of the Operational Research Society, 2004