An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
From MaRDI portal
Recommendations
- A novel discretization scheme for the close enough traveling salesman problem
- A branch-and-bound algorithm for the close-enough traveling salesman problem
- The generalized close enough traveling salesman problem
- The close enough traveling salesman problem: a discussion of several heuristics
- Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- On a linear-programming, combinatorial approach to the traveling-salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- A new integer programming formulation of the graphical traveling salesman problem
- On the approximability of the traveling salesman problem
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
- Advances in meter Reading: heuristic solution of the close enough traveling salesman problem over a street network
- Approximation algorithms for lawn mowing and milling
- Approximation algorithms for the Geometric Covering Salesman Problem
- Approximation algorithms for TSP with neighborhoods in the plane
- Exact algorithms for a selective vehicle routing problem where the longest route is minimized
- scientific article; zbMATH DE number 1769325 (Why is no real title available?)
- Optimal Covering Tours with Turn Costs
- The bi-objective covering tour problem
- The close enough traveling salesman problem: a discussion of several heuristics
- The Covering Salesman Problem
- The Covering Tour Problem
- The polygon exploration problem
- The prize collecting traveling salesman problem
Cited in
(21)- A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem
- A novel discretization scheme for the close enough traveling salesman problem
- A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
- On the distance-constrained close enough arc routing problem
- Spatial coverage in routing and path planning problems
- A fresh look at the traveling salesman problem with a center
- 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
- The profitable close-enough arc routing problem
- Solving TSP through the integration of OR and CP techniques
- A branch-and-bound algorithm for the close-enough traveling salesman problem
- An Intuitionistic Fuzzy Approach to the Travelling Salesman Problem
- The close enough traveling salesman problem: a discussion of several heuristics
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem
- 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
- A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations
- On solving close enough orienteering problems with overlapped neighborhoods
- Energy management for electric vehicles in facility logistics: a survey from an operational research perspective
This page was built for publication: An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940530)
