920 search results - page 26 / 184 » Generating Satisfiable Problem Instances |
ECOOP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We present Shekoosh, a novel framework for constraint-based generation of structurally complex inputs of large sizes. Given a Java predicate that represents the desired s...
EOR
2007
13 years 7 months ago
2007
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
INFORMS
2000
13 years 7 months ago
2000
Time-indexed formulations for machine scheduling problems have received a great deal of attention; not only do the linear programming relaxations provide strong lower bounds, but ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
ECCC
2010
13 years 7 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...