A Canonical Representation of Simple Plant Location Problems and Its Applications
From MaRDI portal
Cites work
- An analysis of approximations for maximizing submodular set functions—I
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 3561083 (Why is no real title available?)
- scientific article; zbMATH DE number 3566547 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 3311772 (Why is no real title available?)
- Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
Cited in
(21)- A flexible model and efficient solution strategies for discrete location problems
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- The simple plant location problem: Survey and synthesis
- An analysis of the greedy algorithm for the submodular set covering problem
- Design and analysis of hybrid metaheuristics for the reliability \(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
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem
- An aggressive reduction scheme for the simple plant location problem
- Public service system design with fuzzy parameters of perceived utility
- Double bound method for solving the p-center location 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
- Mixed integer linear programming formulation for K-means clustering problem
- Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the \(\mathrm{p}\)-median 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)
