Path Planning in 0/1/∞ Weighted Regions with Applications
From MaRDI portal
Publication:4025920
DOI10.1287/ijoc.2.3.253zbMath0755.90084MaRDI QIDQ4025920
Alex C.-C. Meng, Joseph S. B. Mitchell, Simeon C. Ntafos, Laxmi P. Gewali
Publication date: 18 February 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2.3.253
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
Related Items
GUARDING ART GALLERIES BY GUARDING WITNESSES, Maximum thick paths in static and dynamic environments, On approximating shortest paths in weighted triangular tessellations, Routing multi-class traffic flows in the plane, Link distance and shortest path problems in the plane, A survey of geodesic paths on 3D surfaces, Guarding galleries and terrains, Region-restricted clustering for geographic data mining, Optimum watchman routes, Optimum placement of guards, On approximating shortest paths in weighted triangular tessellations, Quickest path queries on transportation network, CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER, Modeling Optimal Beam Treatment with Weighted Regions for Bio-medical Applications, Link Distance and Shortest Path Problems in the Plane
