Fast bounding procedures for large instances of the simple plant location problem
type: Item
instance of: scholarly article
title: Fast bounding procedures for large instances of the simple plant location problem
zbMATH Open document ID: 1251.90243
author: Adam N. Letchford
author: Sebastian J. Miller
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
full work available at URL: 10.pdf
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C06
zbMATH DE Number: 6107529
zbMATH Keywords: combinatorial optimisation
zbMATH Keywords: facility location
zbMATH Keywords: dual ascent
Wikidata QID: Q57702160
describes a project that uses: heapsort
describes a project that uses: OR-Library
MaRDI profile type: Publication
OpenAlex ID: W2150589502
cites work: Probabilistic Analysis of a Relaxation for the k-Median Problem
cites work: An algorithm for solving large capacitated warehouse location problems
cites work: Lagrangean heuristics for location problems
cites work: Q4139967
cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
cites work: A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
cites work: A projection method for the uncapacitated facility location problem
cites work: Q3351135
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: Branch and peg algorithms for the simple plant location problem.
cites work: Solving the simple plant location problem using a data correcting approach
cites work: Q5650510
cites work: Primal-dual variable neighborhood search for the simple plant-location problem
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: On the exact solution of large-scale simple plant location problems
cites work: The simple plant location problem: Survey and synthesis
cites work: Solving the simple plant location problem by genetic algorithm
cites work: Q4398373
cites work: Approximation Algorithms for Metric Facility Location Problems
cites work: A note on duality gap in the simple plant location problem
cites work: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
cites work: Solving the uncapacitated facility location problem using tabu search
cites work: Q4471292
cites work: An implementation of the simplex method for linear programming problems with variable upper bounds
cites work: A Dual-Based Procedure for Dynamic Facility Location
DBLP publication ID: journals/cor/LetchfordM12
DOI: 10.1016/J.COR.2011.06.014
description: scientific article; zbMATH DE number 6107529