Urban freight transportation: Challenges, failures and successes

Autor: Kant, Goos, Quak, H., Peeters, Rene, Woensel van, T., Zijm, H., Klumpp, M., Clausen, U., Ten Hompel, M.

Publikováno v: Logistics and Supply Chain Innovation ISBN: 9783319222875
Logistics and Supply Chain Innovation: Bridging the Gap between Theory and Practice, 3, 127-139
Logistics and Supply Chain Innovation: Bridging the Gap between Theory and Practice, 127-139
STARTPAGE=127;ENDPAGE=139;TITLE=Logistics and Supply Chain Innovation: Bridging the Gap between Theory and Practice
Zijm, H.Klumpp, M.Clausen, U.Hompel, M. ten, Logistics and Supply Chain Innovation. Bridging the gap between theory and practice, 127-139
Logistics and Supply Chain Innovation : Bridging the Gap between Theory and Practice

In this paper, we present the challenges, failures and successes on urban freight transportation. We first identify the various involved stakeholders with their interests. Then we evaluate a large number of urban freight transport initiatives and ide

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e63a355dda9af435fa8122b17944550e
https://pure.buas.nl/en/publications/a3ed4c7d-eb9c-4a63-9118-58b66756e9ce

Strongly Regular Graphs that are Locally a Disjoint Union of Hexagons

Autor: Peeters, René

Publikováno v: In European Journal of Combinatorics July 1997 18(5):579-588

Spectral characterizations of complex unit gain graphs

Autor: Wissing, Pepijn

While eigenvalues of graphs are well studied, spectral analysis of complex unit gain graphs is still in its infancy. This thesis considers gain graphs whose gain groups are gradually less and less restricted, with the ultimate goal of classifying gai

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::08ad8e8593f29685e1d820176e085b5e
https://research.tilburguniversity.edu/en/publications/776f871a-a052-406a-8a6f-6291ef1fac19

Solving set partitioning problems using lagrangian relaxation

Autor: van Krieken, M.G.C.

This thesis focuses on the set partitioning problem. Given a collection of subsets of a certain root set and costs associated to these subsets, the set partitioning problem is the problem of finding a minimum cost partition of the root set. Many real

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::ce412797e7908954c96a57ef74eee1fd
https://research.tilburguniversity.edu/en/publications/1447ef00-4019-48a6-8b7b-906a33201b24