The following pages link to (Q4640250):
Displaying 9 items.
- A maximum edge-weight clique extraction algorithm based on branch-and-bound (Q783045) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900316) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)