Zobrazeno 1 - 10
of 203
pro vyhledávání: '"Kalcsics, Jörg"'
Publikováno v:
Networks. Volume 83, Issue 4, June 2024, Pages 627-641
In this article, we study the complexity of the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem is NP-hard on general networks. However, in some particular cases, we prove that this
Externí odkaz:
http://arxiv.org/abs/2409.11900
Publikováno v:
European Journal of Operational Research, Volume 303, Issue 1, 16 November 2022, Pages 14-36
We study the upgrading version of the maximal covering location problem with edge length modifications on networks. This problem aims at locating p facilities on the vertices (of the network) so as to maximise coverage, considering that the length of
Externí odkaz:
http://arxiv.org/abs/2409.11883
Publikováno v:
Computers & Operations Research, Volume 130, 2021, 105181, ISSN 0305-0548
This paper addresses a version of the single-facility Maximal Covering Location Problem on a network where the demand is: (i) distributed along the edges and (ii) uncertain with only a known interval estimation. To deal with this problem, we propose
Externí odkaz:
http://arxiv.org/abs/2409.11872
Autor:
Baldomero-Naranjo, Marta, Blanco, Víctor, García, Sergio, Gázquez, Ricardo, Kalcsics, Jörg, Martínez-Merino, Luisa I., Muñoz-Ocaña, Juan M., Temprano, Francisco, Torrejón, Alberto
The International Workshop on Locational Analysis and Related Problems will take place during September 7-8, 2023 in Edinburgh (United Kingdom). It is organized by the Spanish Location Network and the Location Group GELOCA from the Spanish Society of
Externí odkaz:
http://arxiv.org/abs/2309.08337
ALNS is a popular metaheuristic with renowned efficiency in solving combinatorial optimisation problems. However, despite 16 years of intensive research into ALNS, whether the embedded adaptive layer can efficiently select operators to improve the in
Externí odkaz:
http://arxiv.org/abs/2302.14678
Publikováno v:
In Computers and Operations Research December 2024 172
We study competitive location problems in a continuous setting, in which facilities have to be placed in a rectangular domain $R$ of normalized dimensions of $1$ and $\rho\geq 1$, and distances are measured according to the Manhattan metric. We show
Externí odkaz:
http://arxiv.org/abs/2011.13275
Autor:
Barkhagen, Mathias, Fleming, Brian, Quiles, Sergio Garcia, Gondzio, Jacek, Kalcsics, Joerg, Kroeske, Jens, Sabanis, Sotirios, Staal, Arne
A new framework for portfolio diversification is introduced which goes beyond the classical mean-variance approach and portfolio allocation strategies such as risk parity. It is based on a novel concept called portfolio dimensionality that connects d
Externí odkaz:
http://arxiv.org/abs/1906.00920
Autor:
Delorme, Maxence, García, Sergio, Gondzio, Jacek, Kalcsics, Joerg, Manlove, David, Pettersson, William
We present new integer linear programming (ILP) models for NP-hard optimisation problems in instances of the Stable Marriage problem with Ties and Incomplete lists (SMTI) and its many-to-one generalisation, the Hospitals / Residents problem with Ties
Externí odkaz:
http://arxiv.org/abs/1810.02711
Publikováno v:
In European Journal of Operational Research 16 November 2022 303(1):14-36