Fast bounding procedures for large instances of the simple plant location problem
From MaRDI portal
Publication:1762067
DOI10.1016/j.cor.2011.06.014zbMath1251.90243OpenAlexW2150589502WikidataQ57702160 ScholiaQ57702160MaRDI QIDQ1762067
Adam N. Letchford, Sebastian J. Miller
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/45838/1/10.pdf
Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
Optimal algorithms for some inverse uncapacitated facility location problems on networks, Matheuristics: survey and synthesis, On a class of subadditive duals for the uncapacitated facility location problem, An exact cooperative method for the uncapacitated facility location problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, An improved Lagrangian relaxation and dual ascent approach to facility location problems, An aggressive reduction scheme for the simple plant location problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on duality gap in the simple plant location problem
- A projection method for the uncapacitated facility location problem
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- An algorithm for solving large capacitated warehouse location problems
- On the exact solution of large-scale simple plant location problems
- Solving the simple plant location problem using a data correcting approach
- Branch and peg algorithms for the simple plant location problem.
- Lagrangean heuristics for location problems
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- The simple plant location problem: Survey and synthesis
- Solving the uncapacitated facility location problem using tabu search
- Solving the simple plant location problem by genetic algorithm
- Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
- Approximation Algorithms for Metric Facility Location Problems
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Probabilistic Analysis of a Relaxation for the k-Median Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- An implementation of the simplex method for linear programming problems with variable upper bounds
- A Dual-Based Procedure for Dynamic Facility Location
- An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
