Graph partitions for the multidimensional assignment problem

DOI10.1007/s10589-013-9619-7zbMath1295.90017OpenAlexW2020032845MaRDI QIDQ2450905

Panos M. Pardalos, Chrysafis Vogiatzis, Eduardo L. Pasiliao

Publication date: 23 May 2014

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-013-9619-7

zbMATH Keywords

parallel computinggraph decompositionmultidimensional assignment problemmulti-sensor multi-target tracking problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (4)

Efficient sensor network management for asset localization ⋮ 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
• Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs
• A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
• Nonlinear assignment problems. Algorithms and applications
• Test problem generator for the multidimensional assignment problem
• Randomized parallel algorithms for the multidimensional assignment problem
• Solving the multisensor data association problem.
• GRASP with Path Relinking for Three-Index Assignment
• Branch and bound solution of the multidimensional assignment problem formulation of data association
• Branch and bound algorithms for the multidimensional assignment problem
• Letter to the Editor—The Multidimensional Assignment Problem

This page was built for publication: Graph partitions for the multidimensional assignment problem