Benders Decomposition for the Hop-Constrained Survivable Network Design Problem
INFORMS Journal on Computing
On exact solutions for the Minmax Regret Spanning Tree problem
Computers and Operations Research
Hi-index | 0.00 |
A new cut selection criterion for Benders’ cuts is proposed and computationally analyzed. The results show that the new criterion is more robust—and often considerably faster—than the standard ones.