Pages that link to "Item:Q2489123"
From MaRDI portal
The following pages link to Exploiting semidefinite relaxations in constraint programming (Q2489123):
Displaying 8 items.
- Semidefinite relaxations of dynamical programs under discrete constraints (Q601981) (← links)
- On semidefinite programming relaxations of \((2+p)\)-SAT (Q1861907) (← links)
- Constraint programming based Lagrangian relaxation for the automatic recording problem (Q1861933) (← links)
- Relaxations of the satisfiability problem using semidefinite programming (Q1977751) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- On the cooperation of the constraint domains ℋ, ℛ, and ℱ in CFLP (Q3183129) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897211) (← links)
- Extended McCormick relaxation rules for handling empty arguments representing infeasibility (Q6166098) (← links)