scientific article
From MaRDI portal
Publication:3447238
zbMath1113.90133MaRDI QIDQ3447238
Jeffrey W. Heath, Carter C. Price, Damon Gulczynski
Publication date: 28 June 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (19)
A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem ⋮ A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance ⋮ Data-driven optimization and statistical modeling to improve meter reading for utility companies ⋮ A novel discretization scheme for the close enough traveling salesman problem ⋮ An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem ⋮ The profitable close-enough arc routing problem ⋮ A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ A multi‐vehicle covering tour problem with speed optimization ⋮ Arc routing problems: A review of the past, present, and future ⋮ Results for the close-enough traveling salesman problem with a branch-and-bound algorithm ⋮ The generalized close enough traveling salesman problem ⋮ An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem ⋮ Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network ⋮ A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands ⋮ On the distance-constrained close enough arc routing problem ⋮ Using tornado-related weather data to route unmanned aerial vehicles to locate damage and victims ⋮ Spatial coverage in routing and path planning problems ⋮ The min-max close-enough arc routing problem
This page was built for publication:
