A cost function property for plant location problems
From MaRDI portal
Publication:4044368
DOI10.1007/BF01585521zbMath0292.90039OpenAlexW2068118021WikidataQ92383765 ScholiaQ92383765MaRDI QIDQ4044368
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585521
Related Items
The linking set problem: a polynomial special case of the multiple-choice knapsack problem, Multi-level facility location as the maximization of a submodular set function, Hub Location as the Minimization of a Supermodular Set Function, Fast approximate energy minimization with label costs, Comments on the note of Frieze, The multi-level uncapacitated facility location problem is not submodular, An analysis of approximations for maximizing submodular set functions—I, A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints, Maximization of submodular functions: theory and enumeration algorithms, The multi-level uncapacitated facility location problem is not submodular, The simple plant location problem: Survey and synthesis, Almost-smooth histograms and sliding-window graph algorithms, A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
Cites Work
