Pages that link to "Item:Q2514741"
From MaRDI portal
The following pages link to Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741):
Displaying 7 items.
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- Hybrid optimization methods for time-dependent sequencing problems (Q1751901) (← links)
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints (Q2029262) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Models and algorithms for the traveling salesman problem with time-dependent service times (Q2294625) (← links)
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery (Q2672110) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
