A Canonical Representation of Simple Plant Location Problems and Its Applications

DOI10.1137/0601030zbMath0501.90032OpenAlexW2054252896MaRDI QIDQ3967331

Laurence A. Wolsey, Cornuéjols, Gérard, Nemhauser, George I.

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0601030

zbMATH Keywords

polynomial algorithmplant locationrepresentations of set functions

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items (19)

Public service system design with fuzzy parameters of perceived utility ⋮ Double bound method for solving the \(p\)-center location problem ⋮ Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ Discrete facility location in machine learning ⋮ Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem ⋮ Dynamically second-preferred \(p\)-center problem ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Alternative formulations for the obnoxious \(p\)-median problem ⋮ A tighter formulation of the \(p\)-median problem ⋮ Facility location with tree topology and radial distance constraints ⋮ An improved Lagrangian relaxation and dual ascent approach to facility location problems ⋮ An aggressive reduction scheme for the simple plant location problem ⋮ A flexible model and efficient solution strategies for discrete location problems ⋮ A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem ⋮ The simple plant location problem: Survey and synthesis ⋮ An analysis of the greedy algorithm for the submodular set covering problem

Cites Work

• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Canonical Representation of Simple Plant Location Problems and Its Applications