Discrete center problems

DOI10.1007/978-1-4419-7572-0_5MaRDI QIDQ5506720zbMATH OpenOpenAlexFDO

Authors B. Tansel

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

Mathematics Subject Classification ID

Continuous location (90B85)

Recommendations

• Continuous center problems
• scientific article; zbMATH DE number 821272
• Location problems
• scientific article; zbMATH DE number 1803756
• An Analysis of Network Location Problems with Distance Constraints

Cites work

• A new formulation and resolution method for the p-center problem
• A polynomial time algorithm for finding the absolute center of a network
• 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 algorithm for finding the absolute center of a network
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Convex Location Problems on Tree Networks
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• Finding kth paths and p-centers by generating and searching good data structures
• Finite Dominating Sets for Network Location Problems
• Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data Structures
• Letter to the Editor—A Note on a Graph Theoretic Game of Hakimi's
• Linear-Time Algorithms for Linear Programming in R^3 and Related Problems
• Locating an absolute center on graphs that are almost trees
• New Results on the Complexity of p-Centre Problems
• Note—A Simple Edge Elimination Criterion in a Search for the Center of a Graph
• Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Solving nonlinear multiple-facility network location problems
• Solving Nonlinear Single-Facility Network Location Problems
• The 1-Center Problem: Exploiting Block Structure
• The m-Center Problem
• The m-Center Problem: Minimax Facility Location
• The Centers and Medians of a Graph
• The Location of Emergency Service Facilities
• The Optimum Location of Multi-centres on a Graph

Cited in

(12)

• A correction to the definition of local center
• An algebraic model for the center problem
• The multi-period \(p\)-center problem with time-dependent travel times
• scientific article; zbMATH DE number 1588326 (Why is no real title available?)
• scientific article; zbMATH DE number 4209906 (Why is no real title available?)
• Double bound method for solving the p-center location problem
• Continuous center problems
• The exam location problem: mathematical formulations and variants
• The multifacility center problems with random demand weights
• Cyclicity versus center problem
• Fighting terrorism: how to position rapid response teams?
• Balanced beneficiaries center of the graph

This page was built for publication: Discrete center problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506720)