IEEE Transactions on Aerospace and Electronic Systems· 2016Q1
On implementing 2D rectangular assignment algorithms
- 391citations
- Q1SCImago
- 2016year
Short summary
A novel k-best 2D rectangular assignment algorithm with bounded runtime has been implemented by combining existing optimal methods, offering a practical solution for complex assignment tasks.
AI-generated from the title and abstract; the full text is not read.
Key points
- Developed a k-best 2D rectangular assignment algorithm with guaranteed bounded runtime.
- Combines and integrates the best existing methods for solving the 2D rectangular assignment problem.
- Utilizes a shortest augmenting path approach, a low polynomial-order algorithm.
- Provides accompanying Matlab code for practical implementation.
AI-generated from the title and abstract; the full text is not read.
Abstract
This paper reviews research into solving the two-dimensional (2D) rectangular assignment problem and combines the best methods to implement a k-best 2D rectangular assignment algorithm with bounded runtime. This paper condenses numerous results as an understanding of the "best" algorithm, a strong polynomial-time algorithm with a low polynomial order (a shortest augmenting path approach), would require assimilating information from many separate papers, each making a small contribution. 2D rectangular assignment Matlab code is provided.
The authors' abstract, as published at the source. IEEE Transactions on Aerospace and Electronic Systems, 2016 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computer Graphics and Computer-Aided Design
Computer Graphics and Computer-Aided DesignComputer Science