16 Feb 2024
#8AYW #Day3 #OptimizationOnGraphs
Federico Michelotto presents a lower-bound procedure and a heuristic algorithm for the problem of designing survivable telecommunication networks with shared-protection routing robust against single link failures #orms
4
6
466
16 Feb 2024
#8AYW #Day3 #OptimizationOnGraphs
Alberto Boggio Tomasaz presents a Branch-and-Bound for the problem of finding a connected subgraph of minimum weight such that the complementary connected components do not exceed its weight #orms
1
2
102
16 Feb 2024
#8AYW #Day3 #OptimizationOnGraphs
Alberto Guastalla studies a variant of the Team Orienteering problem with Service Time and Mandatory and Incompatible Nodes, presents two formulations, and develops a Branch-and-Cut #orms
1
2
96
16 Feb 2024
#8AYW #Day3 #OptimizationOnGraphs
Andrea Mancuso presents three formulations for the new Covering Tour Problem with Edge Upgrade to identify the minimum length tour while integrating edge upgrading and budgetary constraints #orms
1
4
124