Pages that link to "Item:Q5898782"
From MaRDI portal
The following pages link to Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5898782):
Displaying 10 items.
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- On semidefinite programming relaxations of \((2+p)\)-SAT (Q1861907) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q1977751) (← links)
- Iterative and core-guided maxsat solving: a survey and assessment (Q2348540) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem (Q3651486) (← links)
- (Q4782039) (← links)
- ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver (Q5015596) (← links)
- ANALYSIS OF L-STRUCTURE OF POLYHEDRON IN THE PARTIAL MAX SAT PROBLEM (Q5151087) (← links)