A cost function property for plant location problems

DOI10.1007/BF01585521MaRDI QIDQ4044368zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alan Frieze

Publication date 1974

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01585521

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites work

• Comments on the note of Frieze

Cited in

(14)

• Maximization of submodular functions: theory and enumeration algorithms
• The simple plant location problem: Survey and synthesis
• Almost-smooth histograms and sliding-window graph algorithms
• Hub location as the minimization of a supermodular set function
• Multi-level facility location as the maximization of a submodular set function
• Comments on the note of Frieze
• Fast approximate energy minimization with label costs
• An analysis of approximations for maximizing submodular set functions—I
• The multi-level uncapacitated facility location problem is not submodular
• The multi-level uncapacitated facility location problem is not submodular
• Interview with Alan Frieze
• A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
• The linking set problem: a polynomial special case of the multiple-choice knapsack problem

This page was built for publication: A cost function property for plant location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044368)