A Canonical Representation of Simple Plant Location Problems and Its Applications
From MaRDI portal
Publication:3967331
DOI10.1137/0601030zbMATH Open0501.90032OpenAlexW2054252896MaRDI QIDQ3967331FDOQ3967331
Laurence A. Wolsey, Gérard Cornuéjols, G. L. Nemhauser
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
Cites Work
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Title not available (Why is that?)
- An analysis of approximations for maximizing submodular set functions—I
- Title not available (Why is that?)
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (20)
- Facility location with tree topology and radial distance constraints
- Alternative formulations for the obnoxious \(p\)-median problem
- Discrete facility location in machine learning
- Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem
- Public service system design with fuzzy parameters of perceived utility
- An analysis of the greedy algorithm for the submodular set covering problem
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions
- Double bound method for solving the \(p\)-center location problem
- A tighter formulation of the \(p\)-median problem
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- An efficient Benders decomposition for the \(p\)-median problem
- Formulations and valid inequalities for the capacitated dispersion problem
- A flexible model and efficient solution strategies for discrete location problems
- Complexity evaluation of benchmark instances for the \(p\)-median problem
- The simple plant location problem: Survey and synthesis
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- Dynamically second-preferred \(p\)-center problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Mixed integer linear programming formulation for K-means clustering problem
- An aggressive reduction scheme for the simple plant location problem
This page was built for publication: A Canonical Representation of Simple Plant Location Problems and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967331)
