Generalized orienteering problem with resource dependent rewards
From MaRDI portal
Recommendations
- The orienteering problem: a survey
- The orienteering problem with variable profits
- Solving the Orienteering Problem through Branch-and-Cut
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
- The effective application of a new approach to the generalized orienteering problem
Cited in
(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
- Hybrid dynamic programming with bounding algorithm for the multi-profit orienteering problem
- Orienteering problem: a survey of recent variants, solution approaches and applications
- Controlling a Fleet of Unmanned Aerial Vehicles to Collect Uncertain Information in a Threat Environment
- Selective generalized travelling salesman problem
- Team Orienteering with Time-Varying Profit
- Minisum and maximin aerial surveillance over disjoint rectangles
- Variable neighborhood search to solve the generalized orienteering problem
- Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem
- A unifying framework for selective routing problems
- Branch-price-and-cut algorithms for the team orienteering problem with interval-varying profits
This page was built for publication: Generalized orienteering problem with resource dependent rewards
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4629173)