Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
U. Blasum
Information about the author U. Blasum will soon be added to the site.
Found
1 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Scheduling trams in the morning
1999
In this note, we prove NP -completeness of the following problem: given a set of trams...
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers
