The orienteering problem: a survey (Q617509)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

The orienteering problem: a survey (English)

0 references

Pieter Vansteenwegen

0 references

Wouter Souffriau

0 references

Dirk D. L. van Oudheusden

0 references

European Journal of Operational Research

0 references

publication date

21 January 2011

0 references

full work available at URL

https://lirias.kuleuven.be/handle/123456789/265656

0 references

zbMATH Keywords

combinatorial optimisation

0 references

orienteering problem

0 references

survey

0 references

MaRDI profile type

MaRDI publication profile

0 references

Solving the prize-collecting rural postman problem

0 references

The capacitated team orienteering and profitable tour problems

0 references

The undirected capacitated arc routing problem with profits

0 references

On approximating a geometric prize-collecting traveling salesman problem with time windows

0 references

An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits

0 references

An exact algorithm for team orienteering problems

0 references

A heuristic for the multiple tour maximum collection problem

0 references

An optimal solution procedure for the multiple tour maximum collection problem using column generation

0 references

The team orienteering problem

0 references

A fast and effective heuristic for the orienteering problem

0 references

A tabu search heuristic for periodic and multi-depot vehicle routing problems

0 references

Solving the Orienteering Problem through Branch-and-Cut

0 references

Approximation algorithms for time-dependent orienteering.

0 references

A tabu search heuristic for the undirected selective travelling salesman problem

0 references

0 references

The orienteering problem

0 references

0 references

The Orienteering Problem with Time Windows

0 references

AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM

0 references

Algorithms to solve the orienteering problem: A comparison

0 references

The selective travelling salesman problem

0 references

Locating a cycle in a transportation or a telecommunications network

0 references

Strong linear programming relaxations for the orienteering problem

0 references

Computer Solutions of the Traveling Salesman Problem

0 references

Integer Programming Formulation of Traveling Salesman Problems

0 references

0 references

Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem

0 references

An Optimal Algorithm for the Orienteering Tour Problem

0 references

Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming

0 references

New dynamic programming algorithms for the resource constrained elementary shortest path problem

0 references

Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints

0 references

A path relinking approach for the team orienteering problem

0 references

A TABU search heuristic for the team orienteering problem

0 references

The generalized fixed-charge network design problem

0 references

Heuristics for the multi-period orienteering problem with multiple time windows

0 references

Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings

0 references

A guided local search metaheuristic for the team orienteering problem

0 references

Iterated local search for the team orienteering problem with time windows

0 references

Using artificial neural networks to solve the orienteering problem

0 references

Using a Genetic Algorithm to Solve the Generalized Orienteering Problem

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2010.03.045

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:617509

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q617509&oldid=35210418"