Layout design of parking lots with mathematical programming
There is a vivid debate in cities all over the world on how to distribute the restricted space in
urban areas among stakeholders. Urban design movements such as new pedestrianism or …
urban areas among stakeholders. Urban design movements such as new pedestrianism or …
Optimization of wireless sensor networks deployment with coverage and connectivity constraints
S Elloumi, O Hudry, E Marie, A Martin, A Plateau… - Annals of Operations …, 2021 - Springer
Wireless sensor networks have been widely deployed in the last decades to provide various
services, like environmental monitoring or object tracking. Such a network is composed of a …
services, like environmental monitoring or object tracking. Such a network is composed of a …
A fast vertex weighting-based local search for finding minimum connected dominating sets
X Wu, Z Lü, F Glover - INFORMS Journal on Computing, 2022 - pubsonline.informs.org
The minimum connected dominating set (MCDS) problem consists of selecting a minimum
set of vertices from an undirected graph, such that each vertex not in this set is adjacent to at …
set of vertices from an undirected graph, such that each vertex not in this set is adjacent to at …
A new formulation and algorithm for the maximum leaf spanning tree problem with an application in forest fire detection
This article proposes a new formulation for the maximum leaf spanning tree problem
(MLSTP) using network flow concepts to ensure the graph connectivity of the problem's …
(MLSTP) using network flow concepts to ensure the graph connectivity of the problem's …
Spanning trees with a constraint on the number of leaves. A new formulation
In this paper we present a new extended model for the problem of finding a minimum cost
spanning tree such that the number of leaves is equal to (greater than, less than) k. We show …
spanning tree such that the number of leaves is equal to (greater than, less than) k. We show …
On the online path extension problem--Location and routing problems in board games
K Kraus, K Klamroth, M Stiglmayr - arxiv preprint arxiv:2305.12898, 2023 - arxiv.org
We consider an online version of a longest path problem in an undirected and planar graph
that is motivated by a location and routing problem occurring in the board game" Turn & …
that is motivated by a location and routing problem occurring in the board game" Turn & …
Instance generation framework for green vehicle routing
This paper proposes a framework for generating relevant sets of instances for Green-Vehicle
Routing Problems (G-VRP). In the G-VRP, electric vehicles with limited autonomy can …
Routing Problems (G-VRP). In the G-VRP, electric vehicles with limited autonomy can …
Layout problems with reachability constraint
M Stiglmayr - … Research Proceedings 2019: Selected Papers of the …, 2020 - Springer
Many design/layout processes of warehouses, depots or parking lots are subject to
reachability constraints, ie, each individual storage/parking space must be directly reachable …
reachability constraints, ie, each individual storage/parking space must be directly reachable …
[PDF][PDF] Layout problems with reachability constraint
M Stiglmayr - 2019 - imacm.uni-wuppertal.de
Many design/layout processes of warehouses, depots or parking lots are subject to
reachability constraints, ie, each individual storage/parking space must be directly reachable …
reachability constraints, ie, each individual storage/parking space must be directly reachable …
[PDF][PDF] The k-hop connected dominating set problem: approximation algorithms and hardness results
RS Coelho - 2017 - pdfs.semanticscholar.org
COELHO, RS The k-hop connected dominating set problem: approximation algorithms and
hardness results. 2017. 86 pp. Tese (Doutorado)-Instituto de Matemática e Estatística …
hardness results. 2017. 86 pp. Tese (Doutorado)-Instituto de Matemática e Estatística …