A separation algorithm for the simple plant location problem
From MaRDI portal
Publication:2060615
DOI10.1016/j.orl.2021.06.011OpenAlexW3169649710MaRDI QIDQ2060615
Adam N. Letchford, Laura Galli
Publication date: 13 December 2021
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2021.06.011
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact cooperative method for the uncapacitated facility location problem
- On the exact solution of large-scale simple plant location problems
- Capacitated facility location: Separation algorithms and computational experience
- Neighborhood search heuristics for the uncapacitated facility location problem
- New valid inequalities and facets for the simple plant location problem
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- The simple plant location problem: Survey and synthesis
- On the facets of the simple plant location packing polytope
- An aggressive reduction scheme for the simple plant location problem
- Solving the simple plant location problem by genetic algorithm
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Probabilistic Analysis of a Relaxation for the k-Median Problem
- Fractional vertices, cuts and facets of the simple plant location problem
- Some facets of the simple plant location polytope
- Integer Programming: Methods, Uses, Computations
- Uncapacitated and Capacitated Facility Location Problems
- Combinatorial optimization. Theory and algorithms.
