On the complexity of the car sequencing problem

Research output: Contribution to journalArticle

60 Citations (Scopus)

Abstract

In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a sufficient condition of membership of NP. We also provide a pseudo-polynomial algorithm for a special case.

Original languageEnglish
Pages (from-to)331-335
Number of pages5
JournalOperations Research Letters
Volume32
Issue number4
DOIs
Publication statusPublished - Jul 2004

Fingerprint

Sequencing
Computational complexity
Railroad cars
NP-complete problem
Polynomials
NP-completeness
Polynomial Algorithm
Sufficient Conditions
NP-hard
Car

Keywords

  • Analysis of algorithms
  • Computational complexity
  • Pseudo-polynomial algorithms
  • Sequencing/scheduling

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Statistics, Probability and Uncertainty
  • Discrete Mathematics and Combinatorics
  • Modelling and Simulation

Cite this

On the complexity of the car sequencing problem. / Kis, T.

In: Operations Research Letters, Vol. 32, No. 4, 07.2004, p. 331-335.

Research output: Contribution to journalArticle

@article{67774b99e9124f279a9c5f8ff53a782f,
title = "On the complexity of the car sequencing problem",
abstract = "In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a sufficient condition of membership of NP. We also provide a pseudo-polynomial algorithm for a special case.",
keywords = "Analysis of algorithms, Computational complexity, Pseudo-polynomial algorithms, Sequencing/scheduling",
author = "T. Kis",
year = "2004",
month = "7",
doi = "10.1016/j.orl.2003.09.003",
language = "English",
volume = "32",
pages = "331--335",
journal = "Operations Research Letters",
issn = "0167-6377",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - On the complexity of the car sequencing problem

AU - Kis, T.

PY - 2004/7

Y1 - 2004/7

N2 - In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a sufficient condition of membership of NP. We also provide a pseudo-polynomial algorithm for a special case.

AB - In this note we give an easier proof of the known result that the car sequencing problem is NP-hard, and point out that it is NP-hard in the strong sense. We show that a previous claim of NP-completeness is incorrect, and instead we give a sufficient condition of membership of NP. We also provide a pseudo-polynomial algorithm for a special case.

KW - Analysis of algorithms

KW - Computational complexity

KW - Pseudo-polynomial algorithms

KW - Sequencing/scheduling

UR - http://www.scopus.com/inward/record.url?scp=2042505081&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2042505081&partnerID=8YFLogxK

U2 - 10.1016/j.orl.2003.09.003

DO - 10.1016/j.orl.2003.09.003

M3 - Article

VL - 32

SP - 331

EP - 335

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 4

ER -