Solving the multidimensional assignment problem by a cross-entropy method
type: Item
instance of: scholarly article
title: Solving the multidimensional assignment problem by a cross-entropy method
zbMATH Open document ID: 1297.90072
author: Duc Manh Nguyen
author: Le Thi Hoai An
author: Pham Dinh Tao
published in: Journal of Combinatorial Optimization
publication date: 2014-06-24T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6307090
zbMATH Keywords: multidimensional assignment problem (MAP)
zbMATH Keywords: large-scale MAP
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: cross-entropy
MaRDI profile type: Publication
full work available at URL: s10878-012-9554-z
OpenAlex ID: W1970825336
cites work: GRASP with path relinking for three-index assignment
cites work: Solving the multisensor data association problem.
cites work: An Algorithm for the Three-Index Assignment Problem
cites work: Local search heuristics for multi-index assignment problems with decomposable costs
cites work: Q3145800
cites work: Convergence properties of the cross-entropy method for discrete optimization
cites work: A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
cites work: Test problem generator for the multidimensional assignment problem
cites work: Local Search Heuristics for the Multidimensional Assignment Problem
cites work: An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
cites work: Q4395333
cites work: Randomized parallel algorithms for the multidimensional assignment problem
cites work: Nonlinear assignment problems. Algorithms and applications
cites work: Q3002967
cites work: Letter to the Editor—The Multidimensional Assignment Problem
cites work: Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
cites work: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
cites work: Tracking elementary particles near their primary vertex: A combinatorial approach
cites work: Optimization of computer simulation models with rare events
cites work: The cross-entropy method for combinatorial and continuous optimization
cites work: Cross-entropy and rare events for maximal cut and partition problems
cites work: Q4828558
cites work: Q4801573
cites work: An LP-based algorithm for the data association problem in multitarget tracking.
DOI: 10.1007/S10878-012-9554-Z
description: scientific article; zbMATH DE number 6307090