scientific article; zbMATH DE number 1486639

zbMath0970.90107MaRDI QIDQ4494938

Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki

Publication date: 20 August 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexitytraveling salesman problemNP-completedeadlinehandling time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (3)

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times ⋮ Linear time approximation schemes for vehicle scheduling problems ⋮ 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.

This page was built for publication: