403 search results - page 28 / 81 » Variable ranges in linear constraints |
SODA
1998
ACM
13 years 9 months ago
1998
ACM
We describe a new exact-arithmetic approach to linear programming when the number of variables n is much larger than the number of constraints m (or vice versa). The algorithm is ...
IOR
2010
13 years 5 months ago
2010
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
CPAIOR
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. This article first introduces an extension of the classical cumulative constraint: each task is no more a rectangle but rather a sequence of contiguous trapezoid sub-tas...
CPAIOR
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The NValue constraint counts the number of different values assigned to a vector of variables. Propagating generalized arc consistency on this constraint is NP-hard. We ...
CP
2005
Springer
14 years 2 months ago
2005
Springer
We propose a surprisingly simple new way of breaking all value symmetries with constraints. Our method requires the addition of one variable per value of the problem plus a linear ...