Pages that link to "Item:Q5897220"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2003 (Q5897220):
Displaying 15 items.
- Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
- Finding quasi core with simulated stacked neural networks (Q526647) (← links)
- Global propagation of side constraints for solving over-constrained problems (Q545560) (← links)
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- Some spin glass ideas applied to the clique problem (Q885046) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
