2 papers
math.OC2026
Minimum cost network flow with interval capacities: The worst-case scenario
Miroslav Rada, Milan HladÃk, Elif Radová Garajová +3
We study the problem of determining the worst optimal value and characterizing the corresponding worst-case scenarios in minimum cost network flow problems with interval uncertaint…
math.OC2025
Advanced Kernel Search approach for the MST Problem with conflicts involving affinity detection and initial solution construction
Francesco Carrabs, Martina Cerulli, Domenico Serra
The Minimum Spanning Tree Problem with Conflicts consists in finding the minimum conflict-free spanning tree of a graph, i.e., the spanning tree of minimum cost, including no pairs…