Formulations for the orienteering problem with additional constraints
type: Item
instance of: scholarly article
title: Formulations for the orienteering problem with additional constraints
zbMATH Open document ID: 1381.90020
author: Pamela J. Palomo-Martínez
author: M. Angélica Salazar-Aguilar
author: Víctor M. Albornoz
published in: Annals of Operations Research
publication date: 2017-12-15T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6819033
zbMATH Keywords: orienteering problem
zbMATH Keywords: subtour elimination constraints
zbMATH Keywords: exclusionary constraints
zbMATH Keywords: selective traveling salesman problem
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10479-017-2408-4
OpenAlex ID: W2584814407
cites work: Optimal solutions for routing problems with profits
cites work: A New Formulation for the Travelling Salesman Problem
cites work: An exact algorithm for team orienteering problems
cites work: A heuristic for the multiple tour maximum collection problem
cites work: The team orienteering problem
cites work: Classification, models and exact algorithms for multi-compartment delivery problems
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
cites work: The attractive traveling salesman problem
cites work: Solving the Orienteering Problem through Branch-and-Cut
cites work: Q4205235
cites work: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
cites work: The orienteering problem: a survey
cites work: Q4540081
cites work: The orienteering problem
cites work: Orienteering problem: a survey of recent variants, solution approaches and applications
cites work: Routing problems with loading constraints
cites work: The Orienteering Problem with Time Windows
cites work: AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
cites work: The selective travelling salesman problem
cites work: Integer Programming Formulation of Traveling Salesman Problems
cites work: Q2956989
cites work: A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints
cites work: The multi-district team orienteering problem
cites work: A TABU search heuristic for the team orienteering problem
cites work: Heuristics for the multi-period orienteering problem with multiple time windows
cites work: Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
cites work: Iterated local search for the team orienteering problem with time windows
DOI: 10.1007/S10479-017-2408-4
description: scientific article; zbMATH DE number 6819033