scientific article; zbMATH DE number 15374

MaRDI QIDQ3972019zbMATH OpenFDO

Authors Göran Schild

Publication date 25 June 1992

zbMATH Keywords

NP-hardtime travelling

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• The complexity of the travelling repairman problem
• A traveller's problem
• Time-dependent travelling salesman problem.
• Special cases of traveling salesman and repairman problems with time windows
• Traveling salesman problems in temporal graphs

Cited in

(2)

• Physical obstacles to time-travel
• A traveller's problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972019)