Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem

Publisher Website

1 January 1977

book chapter
Published by Elsevier

p. 79-97
https://doi.org/10.1016/s0167-5060(08)70728-3

Abstract

No abstract available

Keywords

LOWER BOUND

This publication has 8 references indexed in Scilit:

On the Set-Covering Problem: II. An Algorithm for Set Partitioning
Operations Research, 1975
Technical Note—Location Theory: A Selective Bibliography
Operations Research, 1974
Lagrangean relaxation for integer programming
Published by Springer Nature ,1974
On the Set-Covering Problem
Operations Research, 1972
An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
Management Science, 1972
The Set-Partitioning Problem: Set Covering with Equality Constraints
Operations Research, 1969
Algorithms for the Simple Plant-Location Problem with Some Side Conditions
Operations Research, 1969
A Branch-Bound Algorithm for Plant Location
Operations Research, 1966