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: Clausen remove ISSN: 09266003 remove
Filter results...

Interpreted as:

journal:(Computational AND Optimization AND and AND Applications) AND title:(On AND the AND Applicability AND of AND Lower AND Bounds AND for AND Solving AND Rectilinear)

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 Journal article

On the Applicability of Lower Bounds for Solving Rectilinear

Clausen, Jens; Karisch, Stefan E.; Perregaard, M.; Rendl, F.

Computational Optimization and Applications — 1998, Volume 10, Issue 2, pp. 127-147

The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient

Year: 1998

Language: English

More...
em hg ij lfakbpodcn
2 Journal article

On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel

Clausen, Jens; Karisch, Stefan E.; Perregaard, Michael; Rendl, Franz

Computational Optimization and Applications — 1998, Volume 10, Issue 2, pp. 127-147

The quadratic assignment problem (QAP) belongs to the hard core of NP-hard optimization problems. After almost forty years of research only relatively small instances can be solved to optimality. The reason is that the quality of the lower bounds available for exact methods is not sufficient

Year: 1998

Language: English

More...
lgpeinjm hdb okacf

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

Log in as DTU user