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: Jepsen remove
Filter results...

Interpreted as:

title:(A AND branch-and-cut AND algorithm AND for AND the AND elementary AND shortest AND path AND problem AND with AND resource AND constraints)

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

A branch-and-cut algorithm for the elementary shortest path problem with resource constraints

Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

The elementary shortest path with resource constraints have commonly been solved with dynamic programming algorithms. Assuming an undirected graph, we present a compact formulation of this problem and a branch-and-cut algorithm to solve it. Two types of resources are discussed: a capacity

Year: 2010

Language: English

More...
io jbgnfkl emcd hap
2 Conference paper

A Branch-and-Cut Algorithm for Elementary Shortest Path Problem with Resource Constraints

Jepsen, Mads Kehlet; Petersen, Bjørn; Spoorendonk, Simon

The elementary shortest path with resource constraints are commonly solved with dynamic programming algorithms. We present a branch-and-cut algorithm for the undirected version. Two types of resources are discussed: A capacity and a fixed charge resource. The former is the subproblem

Year: 2010

Language: English

More...
nmepkdlhiac b ojf g

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

Log in as DTU user