Figure 2 - available via license: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Content may be subject to copyright.
Download
View publication
Illustration of incompatibility

Illustration of incompatibility

Source publication
Figure 2: Illustration of incompatibility
Figure 5: Performance profile graph of #solved instances using...
Figure 6: Performance profile graph of #solved instances using...
Upgrading edges in the maximal covering location problem
Preprint
Full-text available
  • Sep 2024
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 the edges can be reduced at a cost, subject to a given budget. Hence, we have to decide on: the opt...
Cite
Download full-text

Context in source publication

Context 1
... 2 Consider the network depicted in Figure 2. For each edge, its length, its upper bound of reduction, and its cost per unit of reduction, (ℓ e , u e , c e ), are printed next to the edge. ...

Similar publications

Results Summary
On Graph Reduction in Consensus Control of Multi-Agent Systems: A Preliminary Study
Conference Paper
Full-text available
  • Jul 2024
Since the use of multi-agent systems has significantly increased over the past few decades, it is crucial to study the methods used in this area and take implementation-related practical issues into consideration. For instance, in the formulation of the consensus problem , the communication between the agents is depicted using a graph, where each e...
View