1776 search results - page 178 / 356 » Uncertain Linear Constraints |
165
click to vote
CCO
2001
Springer
15 years 10 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
144
click to vote
FORMATS
2006
Springer
15 years 9 months ago
2006
Springer
Using a variant of Clariso-Cortadella's parametric method for verifying asynchronous circuits, we formally derive a set of linear constraints that ensure the correctness of so...
142
click to vote
WSC
2001
15 years 7 months ago
2001
We review chessboard distributions for modeling partially specified finite-dimensional random vectors. Chessboard distributions can match a given set of marginals, a given covaria...
178
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
We describe sequential and parallel algorithms that approximately solve linear programs with no negative coefficients (a.k.a. mixed packing and covering problems). For explicitly ...
143
click to vote
MOC
1998
15 years 5 months ago
1998
Integer lattices have numerous important applications, but some of them may have been overlooked because of the common assumption that a lattice basis is part of the problem instan...