Login / Signup
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints.
Luis Eduardo Neves Gouveia
Martim Joyce-Moniz
Markus Leitner
Published in:
Comput. Oper. Res. (2018)
Keyphrases
</>
network design problem
computationally expensive
image segmentation
computational complexity
lower bound
worst case
constraint satisfaction
lower and upper bounds
mixed integer programming
transportation networks