Relocation problems are hard

A. Amihood; Edward H. Kaplan

Relocation problems are hard

A. Amihood, Edward H. Kaplan

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

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

Conference Invited Keynote
Amir, A. (Keynote speaker)
13 Jul 2009 → 19 Jul 2009
Activity: Talk or presentation › Invited talk

Cite this

@conference{8baa8f93efd240dda2faac58e863dc45,

title = "Relocation problems are hard",

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.",

author = "A. Amihood and Kaplan, {Edward H.}",

year = "2009",

language = "American English",

note = "Canadian Operations Research Society Annual ; Conference date: 13-07-2009 Through 19-07-2009",

}

TY - CONF

T1 - Relocation problems are hard

AU - Amihood, A.

AU - Kaplan, Edward H.

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

M3 - Paper

T2 - Canadian Operations Research Society Annual

Y2 - 13 July 2009 through 19 July 2009

ER -

Relocation problems are hard

Abstract

Conference

Fingerprint

Activities

Conference Invited Keynote

Cite this