Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation.
Lindong LiuXiangtong QiZhou XuPublished in: INFORMS J. Comput. (2016)
Keyphrases
- lagrangian relaxation
- cooperative games
- integer programming
- feasible solution
- lower bound
- branch and bound algorithm
- column generation
- np hard
- linear programming
- dynamic programming
- social welfare
- lower and upper bounds
- branch and bound
- optimal solution
- setup times
- resource allocation
- convex hull
- mathematical model
- shortest path
- upper bound
- single machine scheduling problem
- special case
- machine learning