Activities per year
Abstract
We show that General Relocation is NP-Complete. However, specific Relocation subprobiems, such as relocation feasibility or Johnson's scheduling problem are shown to be of almost linear complexity.
| Original language | American English |
|---|---|
| State | Published - 2009 |
| Event | Canadian Operations Research Society Annual - Toronto, Canada Duration: 13 Jul 2009 → 19 Jul 2009 |
Conference
| Conference | Canadian Operations Research Society Annual |
|---|---|
| Country/Territory | Canada |
| City | Toronto |
| Period | 13/07/09 → 19/07/09 |
Fingerprint
Dive into the research topics of 'Relocation problems are hard'. Together they form a unique fingerprint.Activities
- 1 Invited talk
-
Conference Invited Keynote
Amir, A. (Keynote speaker)
13 Jul 2009 → 19 Jul 2009Activity: Talk or presentation › Invited talk
Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver