34 search results - page 1 / 7 » Interior-Point Algorithms for Linear-Programming Decoding |
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of ...
STOC
2009
ACM
14 years 11 months ago
2009
ACM
Let K be a polytope in Rn defined by m linear inequalities. We give a new Markov Chain algorithm to draw a nearly uniform sample from K. The underlying Markov Chain is the first t...
SIAMJO
2000
13 years 10 months ago
2000
There has been a great deal of success in the last twenty years with the use of cutting plane algorithms to solve specialized integer programming problems. Generally, these algori...
MP
1998
13 years 10 months ago
1998
This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a po...
SIAMJO
2000
13 years 10 months ago
2000
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...