Sökning: "TSP with neighborhoods"
Hittade 1 avhandling innehållade orden TSP with neighborhoods.
1. Geometric Decompositions and Networks - Approximation Bounds and Algorithms
Sammanfattning : In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. LÄS MER
Resultatsidor:
1