Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems

DOI10.1016/j.ejor.2017.08.012zbMath1374.90395OpenAlexW2748782786MaRDI QIDQ1681305

Markus Sinnl, Eduardo Álvarez-Miranda, Martin Luipersbeck

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.08.012

zbMATH Keywords

integer programmingcombinatorial optimizationbranch-and-cutorienteering problemgeneralized traveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Uses Software

• TSPLIB
• OGDF
• Concorde
• OpenStreetMap

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The clustered orienteering problem
• Orienteering problem: a survey of recent variants, solution approaches and applications
• Time constrained maximal covering salesman problem with weighted demands and partial coverage
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• The orienteering problem: a survey
• A note on the prize collecting traveling salesman problem
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem
• The team orienteering problem
• Local branching
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem
• Integer Programming Formulation of Traveling Salesman Problems
• Some applications of the generalized vehicle routing problem
• The orienteering problem
• The prize collecting traveling salesman problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
• Some Applications of the Generalized Travelling Salesman Problem
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• Solving the Orienteering Problem through Branch-and-Cut
• On implementing push-relabel method for the maximum flow problem
• Exact Algorithms for the Clustered Vehicle Routing Problem
• On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem

This page was built for publication: Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems