Approximable 1-Turn Routing Problems in All-Optical Mesh Networks.
Jérôme PalaysiOlivier CogisGuillaume BaganPublished in: Algorithmic Oper. Res. (2009)
Keyphrases
- routing problem
- vehicle routing problem
- routing algorithm
- vehicle routing problem with time windows
- resource constraints
- depth first search
- vehicle routing
- variable neighborhood search
- traveling salesman problem
- global optimization
- travel time
- cutting plane algorithm
- shortest path
- sensor placement
- information retrieval
- cellular automata
- constraint satisfaction problems
- wireless sensor networks
- search algorithm