Discrete Center Problems
From MaRDI portal
Publication:5506720
DOI10.1007/978-1-4419-7572-0_5zbMath1387.90122OpenAlexW125310370MaRDI QIDQ5506720
Publication date: 16 December 2016
Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/50846
Related Items (4)
Double bound method for solving the \(p\)-center location problem ⋮ The multi-period \(p\)-center problem with time-dependent travel times ⋮ The exam location problem: mathematical formulations and variants ⋮ The multifacility center problems with random demand weights
Cites Work
- An algorithm for finding the absolute center of a network
- Locating an absolute center on graphs that are almost trees
- A unified limited column generation approach for facility location problems on trees
- A New Formulation and Resolution Method for the p-Center Problem
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- New Results on the Complexity of p-Centre Problems
- Algorithms for finding P-centers on a weighted tree (for relatively small P)
- Solving Nonlinear Single-Facility Network Location Problems
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
- The 1-Center Problem: Exploiting Block Structure
- Solving nonlinear multiple-facility network location problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Note—A Simple Edge Elimination Criterion in a Search for the Center of a Graph
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
- Finite Dominating Sets for Network Location Problems
- A polynomial time algorithm for finding the absolute center of a network
- Convex Location Problems on Tree Networks
- The m-Center Problem: Minimax Facility Location
- The Centers and Medians of a Graph
- Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
- Finding kth paths and p-centers by generating and searching good data structures
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Letter to the Editor—A Note on a Graph Theoretic Game of Hakimi's
- The m-Center Problem
- The Optimum Location of Multi-centres on a Graph
- The Location of Emergency Service Facilities
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Discrete Center Problems
