3082 search results - page 65 / 617 » New Bounds for the Controller Problem |
133
click to vote
CPAIOR
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
120
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
For a given prime p, a new construction of families of the complex valued sequences of period p with efficient implementation is given by applying both multiplicative characters a...
105
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
In this paper we introduce a new method for bounding the solution to constraint optimization problems called semi-independent partitioning. We show that our method is a strict gene...
125
click to vote
CGA
2005
15 years 3 months ago
2005
We propose new analytical formulations of bounded blending operations for the function-based constructive shape modeling. The blending set operations are defined using R-functions...
133
click to vote
CP
2007
Springer
15 years 10 months ago
2007
Springer
Deviation is a recent constraint to balance a set of variables with respect to a given mean. We show that the propagators recently introduced are not bound-consistent when the mean...