Fetching the paper…
Reading the bibliography…
We consider the time-dependent traveling salesman problem (TDTSP), a generalization of the asymmetric traveling salesman problem (ATSP) to incorporate time-dependent cost functions.
Worst-case analysis of a new heuristic for the travelling salesman problem
N. Christofides · 1976
Earlier work this paper cites.
Lineare charakterisierungen von travelling salesman problemen
M. Grötschel and M. W. Padberg · 1977
Earlier work this paper cites.
An analysis of several heuristics for the traveling salesman problem
D. J. Rosenkrantz, R. E. Stearns, and I. Philip M. Lewis · 1977
Earlier work this paper cites.
The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling
J.-C. Picard and M. Queyranne · 1978
Earlier work this paper cites.
The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling
J.-C. Picard and M. Queyranne · 1978
Earlier work this paper cites.
The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph
E. Balas · 1989
Earlier work this paper cites.
Fastest paths in time-dependent networks for intelligent vehicle-highway systems application∗
D. E. Kaufman and R. L. Smith · 1993
Earlier work this paper cites.
A classification of formulations for the (time-dependent) traveling salesman problem
L. Gouveia and S. Voß · 1995
Earlier work this paper cites.
Vehicle scheduling in public transit and lagrangean pricing
A. Löbel · 1998
Earlier work this paper cites.
A polyhedral study of the asymmetric traveling salesman problem with time windows
N. Ascheuer, M. Fischetti, and M. Grötschel · 2000
Earlier work this paper cites.
Dijkstra’s algorithm on-line: an empirical case study from public railroad transport
F. Schulz, D. Wagner, and K. Weihe · 2000
Cited alongside, same era.
Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
N. Ascheuer, M. Fischetti, and M. Grötschel · 2001
Cited alongside, same era.
The vehicle routing problem
P. Toth and D. Vigo · 2002
Cited alongside, same era.
Branching rules revisited
T. Achterberg, T. Koch, and A. Martin · 2005
Cited alongside, same era.
Selected topics in column generation
M. E. Lübbecke and J. Desrosiers · 2005
Cited alongside, same era.
The traveling salesman problem and its variations
G. Gutin and A. P. Punnen · 2006
Cited alongside, same era.
SCIP: solving constraint integer programs
T. Achterberg · 2009
Later among the works it cites.
Time-dependent route planning
D. Delling and D. Wagner · 2009
Later among the works it cites.
From ranknet to lambdarank to lambdamart: An overview
C. J. Burges · 2010
Later among the works it cites.
Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
A. Pessoa, E. Uchoa, M. P. de Aragão, and R. Rodrigues · 2010
Later among the works it cites.
The traveling salesman problem: a computational study
D. L. Applegate, R. E. Bixby, V. Chvatal, and W. J. Cook · 2011
Later among the works it cites.
Learning to rank for information retrieval and natural language processing
H. Li · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The shortest-path problem with resource constraints and k-cycle elimination for k≥ 3
S. Irnich and D. Villeneuve · 2006
Cited alongside, same era.
Training linear svms in linear time
T. Joachims · 2006
Cited alongside, same era.
Quickest flows over time
L. Fleischer and M. Skutella · 2007
Cited alongside, same era.
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
L.-P. Bigras, M. Gamache, and G. Savard · 2008
Cited alongside, same era.
Combinatorial optimization: Theory and algorithms
B. Korte and J. Vygen · 2012
Later among the works it cites.
The time dependent traveling salesman problem: polyhedra and algorithm
H. Abeledo, R. Fukasawa, A. Pessoa, and E. Uchoa · 2013
Later among the works it cites.
Quickrank: A C++
G. Capannini, D. Dato, C. Lucchese, M. Mori, F. M. Nardini, S. Orlando, R. Perego, and N. Tonellotto · 2015
Later among the works it cites.
Learning to branch in mixed integer programming
E. B. Khalil, P. Le Bodic, L. Song, G. L. Nemhauser, and B. N. Dilkina · 2016
Later among the works it cites.