Pages that link to "Item:Q5687647"
From MaRDI portal
The following pages link to The maximum collection problem with time-dependent rewards (Q5687647):
Displaying 16 items.
- Heuristics for the traveling repairman problem with profits (Q336352) (← links)
- Heuristics for the time dependent team orienteering problem: application to tourist route planning (Q337623) (← links)
- Models and hybrid methods for the onshore wells maintenance problem (Q339625) (← links)
- An optimal solution procedure for the multiple tour maximum collection problem using column generation (Q1305144) (← links)
- A heuristic for the multiple tour maximum collection problem (Q1317095) (← links)
- A matheuristic approach to the orienteering problem with service time dependent profits (Q1622800) (← links)
- Time dependent orienteering problem with time windows and service time dependent profits (Q2147060) (← links)
- UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections (Q2147172) (← links)
- Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
- An improvement heuristic based on variable neighborhood search for a dynamic orienteering problem (Q2233517) (← links)
- Agile Earth observation satellite scheduling: an orienteering problem with time-dependent profits and travel times (Q2273657) (← links)
- An exact algorithm for Agile Earth Observation Satellite scheduling with time-dependent profits (Q2664286) (← links)
- Analysis of the selective traveling salesman problem with time-dependent profits (Q2701177) (← links)
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM (Q3818144) (← links)
- Team Orienteering with Time-Varying Profit (Q5084650) (← links)
- Arrival and service time dependencies in the single- and multi-visit selective traveling salesman problem (Q6568425) (← links)
