The following pages link to Recent Advances in Constraints (Q5899108):
Displayed 4 items.
- Exact algorithms for exact satisfiability and number of perfect matchings (Q958212) (← links)
- A comparison of problem decomposition techniques for the FAP (Q972658) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)