Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (Q958456): Difference between revisions
From MaRDI portal
Latest revision as of 21:02, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines |
scientific article |
Statements
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines (English)
0 references
4 December 2008
0 references
traveling salesman problem
0 references
deadlines
0 references
heuristics
0 references
stochastic
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references