Exact algorithms for the minimum cost vertex blocker clique problem.
Farzaneh NasirianFoad Mahdavi PajouhJosephine M. NamayanjaPublished in: Comput. Oper. Res. (2019)
Keyphrases
- exact algorithms
- minimum cost
- approximation algorithms
- undirected graph
- np hard
- spanning tree
- vehicle routing problem with time windows
- knapsack problem
- network flow
- special case
- minimum weight
- network flow problem
- capacity constraints
- worst case
- network design problem
- minimum cost flow
- network simplex algorithm
- exact solution
- combinatorial optimization
- computational complexity
- optimal solution
- scheduling problem
- integer programming
- directed graph
- linear programming
- lower bound
- strongly connected