Pages that link to "Item:Q2940530"

The following pages link to An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530):

Displaying 14 items.

• A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem (Q1628059) (← links)
• A novel discretization scheme for the close enough traveling salesman problem (Q1652067) (← links)
• A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods (Q1681325) (← links)
• On the distance-constrained close enough arc routing problem (Q2029943) (← links)
• Spatial coverage in routing and path planning problems (Q2083923) (← links)
• A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance (Q2147130) (← links)
• Data-driven optimization and statistical modeling to improve meter reading for utility companies (Q2147136) (← links)
• The profitable close-enough arc routing problem (Q2669779) (← links)
• A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
• An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem (Q5148188) (← links)
• A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
• Results for the close-enough traveling salesman problem with a branch-and-bound algorithm (Q6097759) (← links)
• The generalized close enough traveling salesman problem (Q6113445) (← links)