Pages that link to "Item:Q2029262"
From MaRDI portal
The following pages link to A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262):
Displaying 5 items.
- The time-dependent capacitated profitable tour problem with time windows and precedence constraints (Q1681438) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- Branch-and-check approaches for the tourist trip design problem with rich constraints (Q2669676) (← links)
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801) (← links)