Jump to content

Berth allocation problem

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Bender235 (talk | contribs) at 07:34, 4 May 2011 (created a stub). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

The berth allocation problem is an NP-complete problem in operations research, regarding allocating berth space for vessels in container terminals.

See also

Further reading

  • Guan, Yongpei; Cheung, Raymond K. (2004). "The berth allocation problem: models and solution methods". OR Spectrum. 26 (1): 75–92. doi:10.1007/s00291-003-0140-8.
Stub icon

This business-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Berth_allocation_problem&oldid=427369171"