Sciweavers

Share
CORR
2008
Springer

Interior-Point Algorithms for Linear-Programming Decoding

8 years 2 months ago
Interior-Point Algorithms for Linear-Programming Decoding
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of such algorithms for solving the linear program that appears in the linearprogramming decoder formulation.
Pascal O. Vontobel
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CORR
Authors Pascal O. Vontobel
Comments (0)
books