356 search results - page 6 / 72 » On the Global Solution of Linear Programs with Linear Comple... |
195
click to vote
CP
2010
Springer
15 years 4 months ago
2010
Springer
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
169
click to vote
DCC
2003
IEEE
16 years 5 months ago
2003
IEEE
This paper introduces a linear programming (LP) technique that performs ratedistortion based optimization for constrained video coding. Given the assumption of piecewise linear an...
148
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
160
click to vote
CPAIOR
2007
Springer
16 years 6 days ago
2007
Springer
We show how to efficiently model binary constraint problems (BCP) as integer programs. After considering tree-structured BCPs first, we show that a Sherali-Adams-like procedure r...
142
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...