Generalized orienteering problem with resource dependent rewards

DOI10.1002/nav.21534zbMath1410.90030OpenAlexW2129084883MaRDI QIDQ4629173

Jesse Pietz, Johannes O. Royset

Publication date: 26 March 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.21534

zbMATH Keywords

route planningmixed-integer nonlinear programmingorienteering problemmilitary operations researchsearch and surveillance

Mathematics Subject Classification ID

Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (9)

A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Time dependent orienteering problem with time windows and service time dependent profits ⋮ Orienteering problem: a survey of recent variants, solution approaches and applications ⋮ Selective generalized travelling salesman problem ⋮ Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem ⋮ Team Orienteering with Time-Varying Profit ⋮ Variable neighborhood search to solve the generalized orienteering problem ⋮ Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment ⋮ Minisum and maximin aerial surveillance over disjoint rectangles

This page was built for publication: Generalized orienteering problem with resource dependent rewards