Pages that link to "Item:Q1871975"
From MaRDI portal
The following pages link to Partition-based lower bound for Max-CSP (Q1871975):
Displaying 7 items.
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- A branch and bound algorithm for numerical Max-CSP (Q968350) (← links)
- Maintaining reversible DAC for Max-CSP (Q1277774) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- Investigation of maximum and minimum satisfiability problems using \(L\)-partition (Q2487731) (← links)
- Exact Max-SAT solvers for over-constrained problems (Q2506236) (← links)
- Maximum feasibility estimation (Q6087374) (← links)