About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Recent

Boolean: (bicycle AND helmet) OR (head AND protection) (always group AND in parenthesis)
Title: title:(climate change)
Author: author:("bohr niels" OR "bohr n") (avoid only full first name)
Phrase: "water pump control" (does not work with wildcards)
Wildcards: wom?n pharm*

More help on how to search

Flexible matching

About search syntax

Search syntax Advanced
Close advanced
{{problem}}
By field Using AND/OR By author
This tool can help you build boolean queries suitable for doing a broad search for different synonyms or spellings of each word. Start via the drop-down below or just start typing in the search field.
{{ row.typeTitle }}: ( )

Since our index often lack the full first name of people it can be difficult to correctly search by author.

Fill in the fields and let us help you build a good query:

If you need to find everything possible, consider only searching by last name.

Use "Starting year" to ignore publications out of year range.

Author: Pacino remove
Filter results...

Interpreted as:

title:(On AND the AND Complexity AND of AND Container AND Stowage AND Planning AND Problems)

Suggestions: Include records that partially match the query

Filter results
Access
Type
Language
Year
From DTU
Advanced
Previous 1 - 2 of 2 Next
Export
10 items by relevance
1 Conference paper

On the Complexity of Container Stowage Planning Problems

Pacino, Dario; Tierney, Kevin; Jensen, Rune Møller

to polynomial. We then examine the complexity of an abstraction of the current state-of-the-art container ship stowage planning, the hatch overstow problem. We show that this problem is NP-complete, which means that even abstract formulation of container ship stowage planning is intractable.

Year: 2014

Language: English

More...
f hnabcekdompljig
2 Journal article

On the complexity of container stowage planning problems

Tierney, Kevin; Pacino, Dario; Jensen, Rune Møller

Discrete Applied Mathematics — 2014, Volume 169, pp. 225-230

that changing from uncapacitated to capacitated stacks reduces the complexity of this problem from NP-complete to polynomial. We then examine the complexity of the current state-of-the-art abstraction of container ship stowage planning, wherein containers and slots are grouped together. To do this, we define

Year: 2014

Language: English

More...
ji kdofgalhcmbp ne

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user