Pages that link to "Item:Q5897208"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2003 (Q5897208):
Displayed 23 items.
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Solving satisfiability problems with preferences (Q606909) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- Improving exact algorithms for MAX-2-SAT (Q812398) (← links)
- Arc consistency for soft constraints (Q814581) (← links)
- Scatter search and genetic algorithms for MAX-SAT problems (Q928686) (← links)
- Combining VNS with constraint programming for solving anytime optimization problems (Q932188) (← links)
- An efficient solver for weighted Max-SAT (Q933784) (← links)
- Mendelian error detection in complex pedigrees using weighted constraint satisfaction tech\-niques (Q941662) (← links)
- A branch and bound algorithm for numerical Max-CSP (Q968350) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- A proof builder for Max-SAT (Q2118341) (← links)
- Evaluating the impact of AND/OR search on 0-1 integer linear programming (Q2267805) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- A taxonomy of exact methods for partial Max-SAT (Q2434567) (← links)
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability (Q2457672) (← links)
- Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
- Exact Max-SAT solvers for over-constrained problems (Q2506236) (← links)
- Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP (Q2506238) (← links)
- Algorithms for Solving Satisfiability Problems with Qualitative Preferences (Q2900530) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- On Inconsistent Clause-Subsets for Max-SAT Solving (Q3523061) (← links)