Sciweavers

368 search results - page 1 / 74
» Sphere Methods for LP
Sort
View
AOR
2010
13 years 2 months ago
Sphere Methods for LP
The sphere method for solving linear programs operates with only a subset of constraints in the model in each iteration, and thus has the advantage of handling instances which may...
Katta G. Murty, Mohammad R. Oskoorouchi
ADCM
2004
58views more  ADCM 2004»
13 years 5 months ago
On the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits
A band-dominant function on the Euclidean sphere embedded in Rq+1 is the restriction to this sphere of an entire function of q + 1 complex variables having a finite exponential ty...
Hrushikesh Narhar Mhaskar, Francis J. Narcowich, J...
CORR
2007
Springer
112views Education» more  CORR 2007»
13 years 5 months ago
Adaptive Methods for Linear Programming Decoding
—Detectability of failures of linear programming (LP) decoding and the potential for improvement by adding new constraints motivate the use of an adaptive approach in selecting t...
Mohammad H. Taghavi, Paul H. Siegel
C3S2E
2008
ACM
13 years 7 months ago
Integer least squares: sphere decoding and the LLL algorithm
This paper considers the problem of integer least squares, where the least squares solution is an integer vector, whereas the coefficient matrix is real. In particular, we discuss...
Sanzheng Qiao
IPL
2007
78views more  IPL 2007»
13 years 5 months ago
LP-based solution methods for the asymmetric TSP
We consider an LP relaxation for ATSP. We introduce concepts of high-value and high-flow cycles in LP basic solutions and show that the existence of this kind of cycles would lea...
Vardges Melkonian