Optimal placement of UV-based communications relay nodes

DOI10.1007/s10898-010-9526-8zbMath1205.90202OpenAlexW2039285499MaRDI QIDQ604957

Kaj Holmberg, Patrick Doherty, Per-Magnus Olsson, Oleg P. Burdakov

Publication date: 12 November 2010

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9526-8

zbMATH Keywords

global optimizationPareto solutionhop-restricted shortest pathslabel correcting algorithmsunmanned vehicles

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18)

Related Items

Optimally-informative path planning for dynamic Bayesian classification ⋮ A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management ⋮ Lower bound sets for biobjective shortest path problems

Uses Software

• VisiLibity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New formulations and solution procedures for the hop constrained network design problem.
• Shortest paths algorithms: Theory and experimental evaluation
• On a routing problem
• Three-Dimensional Circuit Layouts
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
• Visibility Algorithms in the Plane
• Planning Algorithms