Local Search Heuristics for the Multidimensional Assignment Problem
From MaRDI portal
Publication:3655144
DOI10.1007/978-3-642-02029-2_10zbMath1194.68209MaRDI QIDQ3655144
Gregory Gutin, Daniel Karapetyan
Publication date: 7 January 2010
Published in: Graph Theory, Computational Intelligence and Thought (Search for Journal in Brave)
Full work available at URL: http://repository.essex.ac.uk/22073/1/0806.3258v6.pdf
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem, Solving the multidimensional assignment problem by a cross-entropy method, Branch and bound solution of the multidimensional assignment problem formulation of data association
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- A hybrid genetic algorithm for the three-index assignment problem
- Asymptotic properties of random multidimensional assignment problems
- Test problem generator for the multidimensional assignment problem
- GRASP with Path Relinking for Three-Index Assignment
- An Algorithm for the Three-Index Assignment Problem
- Letter to the Editor—The Multidimensional Assignment Problem
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem