Pages that link to "Item:Q5131716"
From MaRDI portal
The following pages link to Incremental Upper Bound for the Maximum Clique Problem (Q5131716):
Displaying 12 items.
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- Computing lower bounds for minimum sum coloring and optimum cost chromatic partition (Q2003584) (← 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)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- (Q4960830) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900316) (← links)
- Research trends in combinatorial optimization (Q6091419) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
- Learning driven three-phase search for the maximum independent union of cliques problem (Q6551156) (← links)