The maximum collection problem with time-dependent rewards

DOI<749::AID-NAV10>3.0.CO;2-J 10.1002/(SICI)1520-6750(199608)43:5<749::AID-NAV10>3.0.CO;2-JzbMath0864.90041OpenAlexW2025661907MaRDI QIDQ5687647

Erhan Erkut, Jian-Jun Zhang

Publication date: 16 December 1996

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199608)43:5<749::aid-nav10>3.0.co;2-j

zbMATH Keywords

routingbranch-and-bound optimal algorithmpenalty-based greedy heuristic algorithmsum of the rewards

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (12)

A matheuristic approach to the orienteering problem with service time dependent profits ⋮ Time dependent orienteering problem with time windows and service time dependent profits ⋮ UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections ⋮ Heuristics for the traveling repairman problem with profits ⋮ Heuristics for the time dependent team orienteering problem: application to tourist route planning ⋮ Models and hybrid methods for the onshore wells maintenance problem ⋮ Team Orienteering with Time-Varying Profit ⋮ An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits ⋮ Analysis of the selective traveling salesman problem with time-dependent profits ⋮ Hybrid evolutionary search for the traveling repairman problem with profits ⋮ An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem ⋮ Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times

This page was built for publication: The maximum collection problem with time-dependent rewards