Pages that link to "Item:Q5900295"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900295):
Displaying 9 items.
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- Approximability of clausal constraints (Q970111) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights (Q1575713) (← links)
- Solving the weighted MAX-SAT problem using the dynamic convexized method (Q2439524) (← links)
- (Q4636519) (← links)
- (Q5457277) (← links)
- Tractability of explaining classifier decisions (Q6098842) (← links)