Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane
Year of publication: |
16 October 2018
|
---|---|
Authors: | Cambazard, Hadrien ; Catusse, Nicolas |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 270.2018, 2 (16.10.), p. 419-429
|
Subject: | Traveling salesman | Rectilinear traveling salesman problem | Rectilinear Steiner tree problem | Fixed-parameter algorithm | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm |
-
Optimal deterministic algorithms for some variants of online quota traveling salesman problem
Wei, Yu, (2014)
-
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria, (2014)
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
- More ...
-
Exact algorithms for the order picking problem
Pansart, Lucie, (2018)
-
An efficient and general approach for the joint order batching and picker routing problem
Briant, Olivier, (2020)
-
Teaching OR : automatic evaluation for linear programming modelling
Cambazard, Hadrien, (2022)
- More ...