A fast bipartite network flow algorithm for selective assembly.
Satoru IwataTomomi MatsuiS. Thomas McCormickPublished in: Oper. Res. Lett. (1998)
Keyphrases
- network flow
- objective function
- cost function
- np hard
- segmentation algorithm
- learning algorithm
- dynamic programming
- worst case
- computational complexity
- optimization algorithm
- search space
- linear programming
- ant colony optimization
- combinatorial optimization
- knapsack problem
- graph model
- minimum cost
- globally optimal
- optimization model
- optimal solution
- min cost