Login / Signup
A branch-and-cut algorithm for two-level survivable network design problems.
Inmaculada Rodríguez Martín
Juan José Salazar González
Hande Yaman
Published in:
Comput. Oper. Res. (2016)
Keyphrases
</>
network design problem
computational complexity
objective function
np hard
energy function
optimal solution
search space
dynamic programming
linear programming
cost function
probabilistic model
expectation maximization
convergence rate
bayesian networks
solution quality
lot sizing