Login / Signup
Reformulations and branch-and-price algorithm for the Minimum Cost Hop-and-root Constrained Forest Problem.
Dilson Lucas Pereira
Alexandre Salles da Cunha
Published in:
Comput. Oper. Res. (2018)
Keyphrases
</>
minimum cost
np hard
computational complexity
objective function
worst case
randomly generated
tree structure
simulated annealing
shortest path problem
network flow
convergence rate
minimal cost
spanning tree
branch and bound algorithm
convex hull
shortest path
dynamic programming