Solving the multidimensional assignment problem by a cross-entropy method

DOI10.1007/s10878-012-9554-zzbMath1297.90072OpenAlexW1970825336MaRDI QIDQ2015813

Hoai An Le Thi, Duc Manh Nguyen, Tao Pham Dinh

Publication date: 24 June 2014

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9554-z

zbMATH Keywords

combinatorial optimizationcross-entropylarge-scale MAPmultidimensional assignment problem (MAP)

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

DC Programming and DCA for General DC Programs ⋮ Distribution functions, extremal limits and optimal transport ⋮ Multidimensional assignment problem for multipartite entity resolution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
• Optimization of computer simulation models with rare events
• 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
• An LP-based algorithm for the data association problem in multitarget tracking.
• Nonlinear assignment problems. Algorithms and applications
• 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.
• The cross-entropy method for combinatorial and continuous optimization
• Convergence properties of the cross-entropy method for discrete optimization
• GRASP with Path Relinking for Three-Index Assignment
• A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
• Local Search Heuristics for the Multidimensional Assignment Problem
• An Algorithm for the Three-Index Assignment Problem
• Cross-entropy and rare events for maximal cut and partition problems
• Local search heuristics for multi-index assignment problems with decomposable costs
• Letter to the Editor—The Multidimensional Assignment Problem

This page was built for publication: Solving the multidimensional assignment problem by a cross-entropy method