On the complexity of container stowage planning problems (Q2449077): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59406971, #quickstatements; #temporary_batch_1711439739529 |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Container ship stowage problem complexity and connection to the coloring of circle graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Interval scheduling on identical machines / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4656642 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of colouring circle graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Container stowage planning: a methodology for generating computerised solutions / rank | |||
Normal rank |
Revision as of 11:25, 8 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the complexity of container stowage planning problems |
scientific article |
Statements
On the complexity of container stowage planning problems (English)
0 references
6 May 2014
0 references
container stowage
0 references
overstowage
0 references
computational complexity
0 references
liner shipping
0 references
0 references