66
Views
13
CrossRef citations to date
0
Altmetric
General Paper

Car sequencing is NP-hard: a short proof

&
Pages 1503-1504 | Received 01 Jan 2011, Accepted 01 Nov 2011, Published online: 21 Dec 2017

References

  • GareyMRJohnsonDSComputers and Intractability: A Guide to the Theory of NP-Completeness1979
  • KisTOn the complexity of the car sequencing problemOperations Research Letters200432433133510.1016/j.orl.2003.09.003
  • SolnonCCungVDNguyenAArtiguesCThe car sequencing problem: Overview of state-of-the-art methods and industrial case-study of the ROADEF’2005 challenge problemEuropean Journal of Operational Research2008191391292710.1016/j.ejor.2007.04.033
  • WelshDGaleAThe complexity of counting problemsAspects of Complexity2001115154

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.