A map-reduce lagrangian heuristic for multidimensional assignment problems with decomposable costs

Gregory Tauer, Rakesh Nagi. A map-reduce lagrangian heuristic for multidimensional assignment problems with decomposable costs. Parallel Computing, 39(11):653-668, 2013. [doi]

@article{TauerN13,
  title = {A map-reduce lagrangian heuristic for multidimensional assignment problems with decomposable costs},
  author = {Gregory Tauer and Rakesh Nagi},
  year = {2013},
  doi = {10.1016/j.parco.2013.08.012},
  url = {http://dx.doi.org/10.1016/j.parco.2013.08.012},
  researchr = {https://researchr.org/publication/TauerN13},
  cites = {0},
  citedby = {0},
  journal = {Parallel Computing},
  volume = {39},
  number = {11},
  pages = {653-668},
}