The orienteering problem: a survey (Q617509): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dirk D. L. van Oudheusden / rank
Normal rank
 
Property / author
 
Property / author: Dirk D. L. van Oudheusden / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2113873983 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the prize-collecting rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated team orienteering and profitable tour problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The undirected capacitated arc routing problem with profits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating a geometric prize-collecting traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits / 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: A heuristic for the multiple tour maximum collection problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal solution procedure for the multiple tour maximum collection problem using column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The team orienteering 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: A tabu search heuristic for periodic and multi-depot vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the Orienteering Problem through Branch-and-Cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for time-dependent orienteering. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the undirected selective travelling salesman problem / 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: Q3795496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orienteering Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM / 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: The selective travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a cycle in a transportation or a telecommunications network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong linear programming relaxations for the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / 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: Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Orienteering Tour Problem / 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: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / 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 generalized fixed-charge network design 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: Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings / 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: Using artificial neural networks to solve the orienteering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Genetic Algorithm to Solve the Generalized Orienteering Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 16:14, 3 July 2024

scientific article
Language Label Description Also known as
English
The orienteering problem: a survey
scientific article

    Statements

    The orienteering problem: a survey (English)
    0 references
    21 January 2011
    0 references
    combinatorial optimisation
    0 references
    orienteering problem
    0 references
    survey
    0 references
    0 references
    0 references
    0 references

    Identifiers