A branch-and-bound algorithm for the Precedence-Constrained Minimum-Cost Arborescence problem.
Mauro Dell'AmicoJafar JamalRoberto MontemanniPublished in: Comput. Oper. Res. (2023)
Keyphrases
- branch and bound algorithm
- minimum cost
- np hard
- spanning tree
- minimum weight
- lower bound
- approximation algorithms
- lower bounding
- randomly generated
- optimal solution
- branch and bound
- precedence constraints
- network flow problem
- network flow
- special case
- np complete
- scheduling problem
- upper bound
- finding an optimal solution
- upper bounding
- integer programming
- randomly generated problems
- capacity constraints
- lagrangian relaxation
- linear program
- single machine scheduling problem
- worst case
- computational complexity
- linear programming
- knapsack problem