Search
Now showing items 1-4 of 4
A mathematical analysis of EDAs with distance-based exponential models
(Springer, 2022)
Estimation of Distribution Algorithms have been successfully used to solve permutation-based Combinatorial Optimization Problems. In this case, the algorithms use probabilistic models specifically designed for codifying ...
A revisited branch-and-cut algorithm for large-scale orienteering problems
(Elsevier, 2024-02)
The orienteering problem is a route optimization problem which consists of finding a simple cycle that maximizes the total collected profit subject to a maximum distance limitation. In the last few decades, the occurrence ...
Price of Anarchy with multiple information sources under competition
(Elsevier, 2023-11)
We characterize the Price of Anarchy (PoA) in a single channel under the presence of K competing
sources. As performance metric we consider the Age of Information, which measures the freshness
of information in a remote ...
Characterizing Permutation-Based Combinatorial Optimization Problems in Fourier Space
(MIT Press, 2023-09-01)
[EN]Comparing combinatorial optimization problems is a difficult task. They are defined using different criteria and terms: weights, flows, distances, etc. In spite of this apparent discrepancy, on many occasions, they ...