Facility location with tree topology and radial distance constraints

DOI10.1155/2019/9723718zbMath1432.90074OpenAlexW2991586717MaRDI QIDQ2280295

Ali Dehghan Firoozabadi, Pablo Adasme

Publication date: 18 December 2019

Published in: Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2019/9723718

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

Degree-constrained \(k\)-minimum spanning tree problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Hierarchical survivable network design problems
• Allocation strategies in hub networks
• The \(p\)-median problem: a survey of metaheuristic approaches
• A note on the problem of reporting maximal cliques
• A study on two geometric location problems
• Unit disk graphs
• Models for multi-path covering problems
• Guided local search and its application to the traveling salesman problem
• The simple plant location problem: Survey and synthesis
• A note on greedy algorithms for the maximum weighted independent set problem
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Indirect covering tree problems on spanning tree networks
• Solving Large p-Median Problems with a Radius Formulation
• An Analysis of Network Location Problems with Distance Constraints
• A survey of simulated annealing as a tool for single and multiobjective optimization
• Cooling Schedules for Optimal Annealing
• A Canonical Representation of Simple Plant Location Problems and Its Applications
• The Covering Tour Problem
• Small Maximal Independent Sets and Faster Exact Graph Coloring
• The ring/κ‐rings network design problem: Model and branch‐and‐cut algorithm
• Spanning Trees—Short or Small
• The Fermat Point of a Triangle
• Majorization and distances in trees
• Covering Many or Few Points with Unit Disks
• Independence and Coloring Problems on Intersection Graphs of Disks