A Canonical Representation of Simple Plant Location Problems and Its Applications

Publisher Website

1 September 1980

journal article
Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods

Vol. 1 (3) , 261-272
https://doi.org/10.1137/0601030

Abstract

No abstract available

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 7 references indexed in Scilit:

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
Operations Research, 1980
An analysis of approximations for maximizing submodular set functions—I
Mathematical Programming, 1978
Best Algorithms for Approximating the Maximum of a Submodular Set Function
Mathematics of Operations Research, 1978
An analysis of approximations for maximizing submodular set functions—II
Published by Springer Nature ,1978
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Management Science, 1977
Algorithms for Exploiting the Structure of the Simple Plant Location Problem
Published by Elsevier ,1977
Implicit representation of variable upper bounds in linear programming
Published by Springer Nature ,1975