On optimality of a polynomial algorithm for random linear multidimensional assignment problem
From MaRDI portal
Publication:628662
DOI10.1007/s11590-010-0198-6zbMath1213.90158MaRDI QIDQ628662
Publication date: 14 March 2011
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-010-0198-6
90C59: Approximation methods and heuristics in mathematical programming
90B80: Discrete location and assignment
Related Items
Exact solution approaches for bilevel 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
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Selected topics on assignment problems
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- Random assignment problems
- Probabilistic asymptotic properties of some combinatorial optimization problems
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
- Solving the multisensor data association problem.
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- An Algorithm for the Three-Index Assignment Problem
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- Letter to the Editor—The Multidimensional Assignment Problem
