Pages that link to "Item:Q3100693"
From MaRDI portal
The following pages link to Online traveling salesman problems with service flexibility (Q3100693):
Displaying 14 items.
- The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
- Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
- A stochastic algorithm for online bipartite resource allocation problems (Q342502) (← links)
- Online traveling salesman problem with deadlines and service flexibility (Q498429) (← links)
- From theory to practice: maximizing revenues for on-line dial-a-ride (Q1702834) (← links)
- Two short notes on the on-line travelling salesman: handling times and lookahead. (Q1853561) (← links)
- Online traveling salesman problem with time cost and non-zealous server (Q2082223) (← links)
- New multi-objective optimization model for tourism systems with fuzzy data and new algorithm for solving this model (Q2085506) (← links)
- The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
- Competitive algorithms for the on-line traveling salesman (Q5057434) (← links)
- A simulated annealing algorithm for the restricted stochastic traveling salesman problem with exponentially distributed arc lengths (Q5855701) (← links)
- Algorithms for the on-line travelling salesman (Q5943663) (← links)
- New multi-objective optimization model for tourism systems with fuzzy data and new approach developed epsilon constraint method (Q6059888) (← links)
- An improved algorithm for open online dial-a-ride (Q6176557) (← links)