A new model for path planning with interval data
Year of publication: |
2009
|
---|---|
Authors: | Chen, Xujin ; Hu, Jie ; Hu, Xiaodong |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 6, p. 1893-1899
|
Subject: | Rundreiseproblem | Travelling salesman problem | Zeit | Time | Entscheidung unter Unsicherheit | Decision under uncertainty | Algorithmus | Algorithm |
-
Baltz, Andreas, (2015)
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
Tabu search for solving the black-and-white travelling salesman problem
Li, Haitao, (2016)
- More ...
-
A polynomial solvable minimum risk spanning tree problem with interval data
Chen, Xujin, (2009)
-
A polynomial solvable minimum risk spanning tree problem with interval data
Chen, Xujin, (2009)
-
A polynomial solvable minimum risk spanning tree problem with interval data
Chen, Xujin, (2009)
- More ...