2976 search results - page 25 / 596 » On the bounded integer programming |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
EMNLP
2006
13 years 9 months ago
2006
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...
ANOR
2005
13 years 7 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
DISOPT
2007
13 years 7 months ago
2007
This paper presents techniques for handling symmetries in integer linear programs where variables can take integer values, extending previous work dealing exclusively with binary v...