Approximation algorithms for multi-dimensional assignment problems with decomposable costs

A New Lagrangian Relaxation Based Algorithm for a Class ofMultidimensional Assignment Problems

Computational Optimization and Applications

A Set of Greedy Randomized Adaptive Local Search Procedure (GRASP) Implementations for the Multidimensional Assignment Problem

Computational Optimization and Applications

Establishing motion correspondence using extended temporal scope

Artificial Intelligence

On approximability of linear ordering and related NP-optimization problems on graphs

Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)

An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors

Discrete Applied Mathematics

Multi-index transport problems with decomposition structure

Automation and Remote Control

Improved approximations for TSP with simple precedence constraints

CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity

Approximation algorithms for data association problem arising from multitarget tracking

CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119

Improved approximations for TSP with simple precedence constraints

Journal of Discrete Algorithms

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

Parallel Computing