The generalized close enough traveling salesman problem (Q6113445): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation algorithms for the Geometric Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A novel discretization scheme for the close enough traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for The Close-Enough Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for TSP with neighborhoods in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Covering Tour Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vehicle routing problem with drones: Extended models and connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Meter Reading: Heuristic Solution of the Close Enough Traveling Salesman Problem over a Street Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Steiner zone variable neighborhood search heuristic for the close-enough traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods / rank
 
Normal rank

Latest revision as of 17:03, 1 August 2024

scientific article; zbMATH DE number 7709897
Language Label Description Also known as
English
The generalized close enough traveling salesman problem
scientific article; zbMATH DE number 7709897

    Statements

    The generalized close enough traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2023
    0 references
    0 references
    metaheuristics
    0 references
    close enough traveling salesman problem
    0 references
    genetic algorithms
    0 references
    conic programming
    0 references