A map-reduce lagrangian heuristic for multidimensional assignment problems with decomposable costs.
Gregory TauerRakesh NagiPublished in: Parallel Comput. (2013)
Keyphrases
- map reduce
- lagrangian heuristic
- open source
- parallel computation
- cloud computing
- branch and bound
- efficient implementation
- parallel computing
- mixed integer
- multi dimensional
- recently developed
- parallel algorithm
- lagrangian relaxation
- lower bound
- search algorithm
- data structure
- community detection
- join algorithms
- upper bound
- search space