Double bound method for solving the p-center location problem
From MaRDI portal
(Redirected from Publication:336682)
Double bound method for solving the \(p\)-center location problem
Double bound method for solving the \(p\)-center location problem
Recommendations
Cites work
- scientific article; zbMATH DE number 3847184 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- A new formulation and resolution method for the \(p\)-center problem
- A unified limited column generation approach for facility location problems on trees
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Clustering to minimize the maximum intercluster distance
- Convex Location Problems on Tree Networks
- Discrete center problems
- Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
- Enhancements to two exact algorithms for solving the vertex P-center problem
- Finite Dominating Sets for Network Location Problems
- New Results on the Complexity of p-Centre Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- TSPLIB—A Traveling Salesman Problem Library
- The m-Center Problem
- The m-Center Problem: Minimax Facility Location
- The Location of Emergency Service Facilities
- The Optimum Location of Multi-centres on a Graph
Cited in
(22)- A new formulation and resolution method for the \(p\)-center problem
- GRASP and VNS for solving the \(p\)-next center problem
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- A scalable exact algorithm for the vertex \(p\)-center problem
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- The stratified \(p\)-center problem
- A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
- Fighting terrorism: how to position rapid response teams?
- The complete vertex \(p\)-center problem
- The probabilistic \(p\)-center problem: planning service for potential customers
- Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem
- Exact solution approaches for the discrete α‐neighbor p‐center problem
- Capacitated p-center problem with failure foresight
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
- The multi-period \(p\)-center problem with time-dependent travel times
- Formulations and valid inequalities for the capacitated dispersion problem
- A comparative study of different formulations for the capacitated discrete ordered median problem
- A new bounding method for single facility location models
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context
- Facility location problems on graphs with non-convex neighborhoods
This page was built for publication: Double bound method for solving the \(p\)-center location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336682)
