592 search results - page 47 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
140
click to vote
CCO
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
107
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
193
click to vote
MMSP
2008
IEEE
15 years 9 months ago
2008
IEEE
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...
136
click to vote
CPAIOR
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. This paper introduces a problem called the temporal knapsack problem, presents several algorithms for solving it, and compares their performance. The temporal knapsack pr...
104
click to vote
CPAIOR
2008
Springer
15 years 4 months ago
2008
Springer
We present a propagator that achieves MDD consistency for a separable equality over an MDD (multivalued decision diagram) store in pseudo-polynomial time. We integrate the propagat...