Efficient algorithms for finding the K best paths through a trellis
- 1 March 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 26 (2) , 405-410
- https://doi.org/10.1109/7.53448
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Finding the best set of K paths through a trellis with application to multitarget trackingIEEE Transactions on Aerospace and Electronic Systems, 1989
- The relax codes for linear minimum cost network flow problemsAnnals of Operations Research, 1988
- Dual coordinate step methods for linear network flow problemsMathematical Programming, 1988
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow ProblemsOperations Research, 1988
- A shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing, 1987
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972