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
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.

More...

Journal article

A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem

By Jepsen, Mads Kehlet1; Spoorendonk, Simon1,2; Røpke, Stefan3,4

From

Department of Management Engineering, Technical University of Denmark1

Management Science, Department of Management Engineering, Technical University of Denmark2

Logistics & ITS, Department of Transport, Technical University of Denmark3

Department of Transport, Technical University of Denmark4

This paper presents an exact method for solving the symmetric two-echelon capacitated vehicle routing problem, a transportation problem concerned with the distribution of goods from a depot to a set of customers through a set of satellite locations. The presented method is based on an edge flow model that is a relaxation and provides a valid lower bound.

A specialized branching scheme is employed to obtain feasible solutions. Out of a test set of 93 instances the algorithm is able to solve 47 to optimality surpassing previous exact algorithms.

Language: English
Year: 2013
Pages: 23-37
ISSN: 15265447 and 00411655
Types: Journal article
DOI: 10.1287/trsc.1110.0399
ORCIDs: Røpke, Stefan
Keywords

Branch-and-cut Two-echelon systems Vehicle routing

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

Log in as DTU user

Access

Analysis