Výsledky vyhledávání - "Phillipson, F"

Evaluating the Q-score of Quantum Annealers

Publikováno v: Proceedings-2022 IEEE International Conference on Quantum Software, QSW 2022, 9-16
STARTPAGE=9;ENDPAGE=16;TITLE=Proceedings-2022 IEEE International Conference on Quantum Software, QSW 2022

We report the Atos Q-score for D-Wave's quantum devices, classical algorithms and hybrid quantum-classical solver. Computing the Q-score entails solving the Max-Cut problem for increasingly large graphs. This work presents the first computation of th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6744666c67fca6b630816ee6962b122
https://doi.org/10.1109/qsw55613.2022.00017

Zobrazit plný text záznamu

A Hybrid Solution Method for the Multi-Service Location Set Covering Problem

Autor: Chiscop, I., Nauta, J.C., Veerman, B., Phillipson,F.

Publikováno v: Computational Science – ICCS 2020
International Conference on Computational Sciences (ICCS)

The Multi-Service Location Set Covering Problem is an extension of the well-known Set Covering Problem. It arises in practical applications where a set of physical locations need to be equipped with services to satisfy demand within a certain area, w

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pmc_dedup___::88cfef93ca9672d957cc586b03da764b
http://europepmc.org/articles/PMC7304718

Zobrazit plný text záznamu

A Multi Service Capacitated Facility Location Problem with Stochastic Demand

Autor: Kim, L. J., Phillipson, F., Wezeman, R. S., Phillipson, Frank, Eichler, Gerald, Erfurth, Christian, Fahrnberger, Günter

Publikováno v: Innovations for Community Services: 22nd International Conference, I4CS 2022, Delft, The Netherlands, June 13–15, 2022, Proceedings, 199-214
STARTPAGE=199;ENDPAGE=214;TITLE=Innovations for Community Services
Innovations for Community Services ISBN: 9783031066672

This paper considers the problem of identifying optimal locations for wireless service installations in smart cities. The problem is modelled as a facility location problem with multiple service types, known as the Multi Service Facility Location Pro

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b8fc04e4994852d61a801548933a331
https://cris.maastrichtuniversity.nl/en/publications/241f8e8c-b235-4d7a-a8c7-dab779edbdb1

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Dynamic assignment vehicle routing problem with time windows

Autor: Los, Kim J, Phillipson, F, van Kempen, Elisah A., Quak, Hans, Stelwagen, Uilke, Lalla-Ruiz, E, Mes, M, Voß, S

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030597467
ICCL
Computational Logistics-11th International Conference, ICCL 2020, Proceedings: 11th International Conference, ICCL 2020, 12433, 135-150

Offering time windows to receivers of last-mile delivery is becoming a distinguishing factor. However, we see that in practice carriers have to create routes for their vehicles based on destination information, that is just being revealed when a parc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c3f833aae77843d19db74ddffe8eda4d
https://doi.org/10.1007/978-3-030-59747-4_9

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání