Pages that link to "Item:Q515543"
From MaRDI portal
The following pages link to Infinite linear programming and online searching with turn cost (Q515543):
Displaying 9 items.
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Competitive search in a network (Q2184175) (← links)
- Online failure diagnosis in interdependent networks (Q2226505) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- (Q5090453) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Impact of knowledge on the cost of treasure hunt in trees (Q6087562) (← links)
- Weighted online search (Q6133641) (← links)
- Online search with a hint (Q6186319) (← links)
