Sciweavers

170 search results - page 4 / 34
» Solving Sparse Integer Linear Systems
Sort
View
IOR
2006
177views more  IOR 2006»
13 years 7 months ago
Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
Gianni Codato, Matteo Fischetti
CORR
2010
Springer
124views Education» more  CORR 2010»
13 years 7 months ago
Integer-Forcing Linear Receivers
Abstract--Linear receivers are often used to reduce the implementation complexity of multiple antenna systems. In a traditional linear receiver architecture, the receive antennas a...
Jiening Zhan, Bobak Nazer, Uri Erez, Michael Gastp...
DAC
2002
ACM
14 years 8 months ago
Watermarking integer linear programming solutions
Linear programming (LP) in its many forms has proven to be an indispensable tool for expressing and solving optimization problems in numerous domains. We propose the first set of ...
Seapahn Megerian, Milenko Drinic, Miodrag Potkonja...
CAV
2008
Springer
158views Hardware» more  CAV 2008»
13 years 9 months ago
Linear Arithmetic with Stars
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...
Ruzica Piskac, Viktor Kuncak
AMC
2005
87views more  AMC 2005»
13 years 7 months ago
Wavelet based preconditioners for sparse linear systems
A class of efficient preconditioners based on Daubechies family of wavelets for sparse, unsymmetric linear systems that arise in numerical solution of Partial Differential Equatio...
B. V. Rathish Kumar, Mani Mehra