The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A memetic algorithm for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for team orienteering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and effective heuristic for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4540081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orienteering Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms to solve the orienteering problem: A comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridized evolutionary local search algorithm for the team orienteering problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2956989 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path relinking approach for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A TABU search heuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Granular Tabu Search and Its Application to the Vehicle-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the multi-period orienteering problem with multiple time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided local search metaheuristic for the team orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search for the team orienteering problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The orienteering problem: a survey / rank
 
Normal rank

Latest revision as of 01:27, 6 July 2024

scientific article
Language Label Description Also known as
English
The team orienteering problem with time windows: an LP-based granular variable neighborhood search
scientific article

    Statements

    The team orienteering problem with time windows: an LP-based granular variable neighborhood search (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    0 references
    team orienteering problem
    0 references
    time windows
    0 references
    variable neighborhood search
    0 references
    LP-based granularity
    0 references
    0 references
    0 references
    0 references
    0 references