The following pages link to (Q4503935):
Displaying 14 items.
- Optimal deterministic algorithms for some variants of online quota traveling salesman problem (Q296870) (← links)
- The online prize-collecting traveling salesman problem (Q963439) (← links)
- A new formulation for the traveling deliveryman problem (Q1003469) (← links)
- Approximation and complexity of multi-target graph search and the Canadian traveler problem (Q1637225) (← links)
- A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment (Q1652330) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Online routing and searching on graphs with blocked edges (Q2165266) (← links)
- Competitive search in a network (Q2184175) (← links)
- A search theory model of patch-to-patch forager movement with application to pollinator-mediated gene flow (Q2211571) (← links)
- The risk-averse traveling repairman problem with profits (Q2317622) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND (Q6070871) (← links)
