hrcak mascot   Srce   HID

Izvorni znanstveni članak

Three Algorithms for a Class of Multidimensional Assignment Problems

A. B. Poore ; Department of Mathematics, Colorado State University, Fort Collins, U.S.A.
N. Rijavec ; Department of Mathematics, Colorado State University, Fort Collins, U.S.A.

Puni tekst: engleski, pdf (7 MB) str. 25-37 preuzimanja: 504* citiraj
APA 6th Edition
B. Poore, A. i Rijavec, N. (1994). Three Algorithms for a Class of Multidimensional Assignment Problems. Journal of computing and information technology, 2 (1), 25-37. Preuzeto s https://hrcak.srce.hr/150478
MLA 8th Edition
B. Poore, A. i N. Rijavec. "Three Algorithms for a Class of Multidimensional Assignment Problems." Journal of computing and information technology, vol. 2, br. 1, 1994, str. 25-37. https://hrcak.srce.hr/150478. Citirano 19.02.2020.
Chicago 17th Edition
B. Poore, A. i N. Rijavec. "Three Algorithms for a Class of Multidimensional Assignment Problems." Journal of computing and information technology 2, br. 1 (1994): 25-37. https://hrcak.srce.hr/150478
Harvard
B. Poore, A., i Rijavec, N. (1994). 'Three Algorithms for a Class of Multidimensional Assignment Problems', Journal of computing and information technology, 2(1), str. 25-37. Preuzeto s: https://hrcak.srce.hr/150478 (Datum pristupa: 19.02.2020.)
Vancouver
B. Poore A, Rijavec N. Three Algorithms for a Class of Multidimensional Assignment Problems. Journal of computing and information technology [Internet]. 1994 [pristupljeno 19.02.2020.];2(1):25-37. Dostupno na: https://hrcak.srce.hr/150478
IEEE
A. B. Poore i N. Rijavec, "Three Algorithms for a Class of Multidimensional Assignment Problems", Journal of computing and information technology, vol.2, br. 1, str. 25-37, 1994. [Online]. Dostupno na: https://hrcak.srce.hr/150478. [Citirano: 19.02.2020.]

Sažetak
The assignment problem of matching the elements of two sets at some cost or to some benefit is well known and can be solved in polynomial time. However, many applications, particularly those in remote sensing and computer vision, require matching elements from more than two sets at some cost. Such problems are called multidimensional assignment problems and are known to be NP-hard. For time-critical applications and nontrivial multidimensional assignment problems, fast near-optimal algorithms are the only alternative. This paper compares three such algorithms: greedy, limited branch and bound, and Lagrangian relaxation.

Ključne riječi
Multitarget tracking; multi-dimensional assignment problems; data association; Lagrangian relaxation; Greedy; Branch; Bound

Hrčak ID: 150478

URI
https://hrcak.srce.hr/150478

Posjeta: 541 *