53
Views
18
CrossRef citations to date
0
Altmetric
Part Special Issue

Local search heuristics for multi-index assignment problems with decomposable costs

, &
Pages 694-704 | Received 01 Sep 2002, Accepted 01 Jan 2004, Published online: 21 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (2)

David Degras. (2023) Scalable Feature Matching Across Large Data Collections. Journal of Computational and Graphical Statistics 32:1, pages 196-212.
Read now
MatthiasH.Y. Tan & C. F. Jeff Wu. (2012) Generalized selective assembly. IIE Transactions 44:1, pages 27-42.
Read now

Articles from other publishers (16)

Samhita Vadrevu & Rakesh Nagi. (2023) A GPU Accelerated Dual-Ascent Algorithm for the Multidimensional Assignment Problem in a Multitarget Tracking Application. IEEE Transactions on Automation Science and Engineering 20:3, pages 1706-1720.
Crossref
Tobias Sprodowski, Marit Hoff-Hoffmeyer-Zlotnik & Michael Freitag. (2023) Dimension reduction for a multi-resource general assignment problem by decomposable costs for a vehicle compound. IFAC-PapersOnLine 56:2, pages 11148-11153.
Crossref
Shardul Natu, Ketan Date & Rakesh Nagi. (2020) GPU-accelerated Lagrangian heuristic for multidimensional assignment problems with decomposable costs. Parallel Computing 97, pages 102666.
Crossref
Virginia M. Miori, Nicolle Clements & Brian W. Segulin. (2019) Heuristic Approach to Temporal Assignments of Spatial Grid Points for Vegetation Monitoring. International Journal of Strategic Decision Sciences 10:3, pages 1-19.
Crossref
Olivia Reynen, Samhita Vadrevu, Rakesh Nagi & Keith LeGrand. (2019) Large-scale Multi-dimensional Assignment: Problem Formulations and GPU Accelerated Solutions. Large-scale Multi-dimensional Assignment: Problem Formulations and GPU Accelerated Solutions.
Gregory Tauer, Ketan Date, Rakesh Nagi & Moises Sudit. (2019) An incremental graph-partitioning algorithm for entity resolution. Information Fusion 46, pages 171-183.
Crossref
Andrei Soeanu, Sujoy Ray, Jean Berger & Mourad Debbabi. (2018) Efficient sensor network management for asset localization. Computers & Operations Research 99, pages 148-165.
Crossref
Gunther Koliander, Dominic Schuhmacher & Franz Hlawatsch. (2018) Rate-Distortion Theory of Finite Point Processes. IEEE Transactions on Information Theory 64:8, pages 5832-5861.
Crossref
Jose L. Walteros, Chrysafis Vogiatzis, Eduardo L. Pasiliao & Panos M. Pardalos. (2014) Integer programming models for the multidimensional assignment problem with star costs. European Journal of Operational Research 235:3, pages 553-568.
Crossref
Duc Manh Nguyen, Hoai An Le Thi & Tao Pham Dinh. (2012) Solving the Multidimensional Assignment Problem by a Cross-Entropy method. Journal of Combinatorial Optimization 27:4, pages 808-823.
Crossref
Virginia M. Miori. (2014) The Pollyanna Problem. International Journal of Business Intelligence Research 5:1, pages 1-12.
Crossref
Gregory Tauer & Rakesh Nagi. (2013) A map-reduce lagrangian heuristic for multidimensional assignment problems with decomposable costs. Parallel Computing 39:11, pages 653-668.
Crossref
Gregory Tauer, Rakesh Nagi & Moises Sudit. (2013) The graph association problem: Mathematical models and a lagrangian heuristic. Naval Research Logistics (NRL) 60:3, pages 251-268.
Crossref
Daniel KarapetyanGregory Gutin. (2011) A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem. Evolutionary Computation 19:3, pages 345-371.
Crossref
Daniel Karapetyan & Gregory Gutin. (2010) Local search heuristics for the multidimensional assignment problem. Journal of Heuristics 17:3, pages 201-249.
Crossref
Yusuke Kuroki & Tomomi Matsui. (2009) An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors. Discrete Applied Mathematics 157:9, pages 2124-2135.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.