An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions.
James R. SlaglePublished in: J. ACM (1964)
Keyphrases
- minimum cost
- np hard
- dynamic programming
- network flow
- optimal solution
- objective function
- computational complexity
- ant colony optimization
- spanning tree
- search space
- worst case
- undirected graph
- minimum cost flow
- bayesian networks
- approximation ratio
- mixed integer programming
- optimization model
- branch and bound algorithm