Geometric partitioning and robust ad-hoc network design

DOI10.1007/s10479-015-2093-0zbMath1334.90065OpenAlexW2258030082MaRDI QIDQ271922

John Gunnar Carlsson, Xiang Li, Mehdi Behroozi

Publication date: 20 April 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-015-2093-0

zbMATH Keywords

vehicle routingnetwork designapproximation algorithmsgeometric partitioninglocation set covering

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (1)

A faster algorithm for the constrained minimum covering circle problem to expedite solving p‐center problems in an irregularly shaped area with holes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A continuous location-allocation problem with zone-dependent fixed cost
• Minimum-cost load-balancing partitions
• Designing delivery districts for the vehicle routing problem with stochastic demands
• Optimal location with equitable loads
• Covering a rectangle with six and seven circles
• Equitable subdivisions within polygonal regions
• Dividing a Territory Among Several Vehicles
• Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks

This page was built for publication: Geometric partitioning and robust ad-hoc network design