Pages that link to "Item:Q1913697"
From MaRDI portal
The following pages link to Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring (Q1913697):
Displayed 8 items.
- Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem (Q875414) (← links)
- An algorithm for finding a maximum clique in a graph (Q1267190) (← links)
- The maximum clique problem (Q1318271) (← links)
- A fast algorithm for the maximum clique problem (Q1613374) (← links)
- On the minimum number of logical clauses inferred from examples (Q1919787) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- Solving the minimum-weighted coloring problem (Q2748384) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)