Local search heuristics for the multidimensional assignment problem
From MaRDI portal
Publication:544814
DOI10.1007/s10732-010-9133-3zbMath1214.90078OpenAlexW3103502041MaRDI QIDQ544814
Daniel Karapetyan, Gregory Gutin
Publication date: 16 June 2011
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: http://repository.essex.ac.uk/22073/1/0806.3258v6.pdf
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items (5)
Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ A novel convex dual approach to three-dimensional assignment problem: theoretical analysis ⋮ A dual approach to multi-dimensional assignment problems ⋮ Multidimensional assignment problem for multipartite entity resolution
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Establishing motion correspondence using extended temporal scope
- A hybrid genetic algorithm for the three-index assignment problem
- Asymptotic properties of random multidimensional assignment problems
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Geometric three-dimensional assignment problems
- Test problem generator for the multidimensional assignment problem
- Tracking elementary particles near their primary vertex: A combinatorial approach
- Randomized parallel algorithms for the multidimensional assignment problem
- Solving the multisensor data association problem.
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Perspectives of Monge properties in optimization
- GRASP with Path Relinking for Three-Index Assignment
- APPLYING SIMULATED ANNEALING TO THE MULTIDIMENSIONAL ASSIGNMENT PROBLEM
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- An Algorithm for the Three-Index Assignment Problem
- Local search heuristics for multi-index assignment problems with decomposable costs
- Branch and bound algorithms for the multidimensional assignment problem
- Letter to the Editor—The Multidimensional Assignment Problem
- Experimental and Efficient Algorithms
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
- Experimental evaluation of heuristic optimization algorithms: A tutorial
This page was built for publication: Local search heuristics for the multidimensional assignment problem
