Login / Signup
A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique.
Wondi Geremew
Nguyen Mau Nam
Alexander Semenov
Vladimir Boginski
Eduardo L. Pasiliao
Published in:
J. Glob. Optim. (2018)
Keyphrases
</>
dc programming
network design problem
exact penalty
convex functions
network design
cutting plane
valid inequalities
approximation algorithms
packing problem
semidefinite programming
dynamic programming
transportation networks
computational complexity
branch and bound
integer programming
duality gap