Pages that link to "Item:Q5392092"
From MaRDI portal
The following pages link to A New Branch and Bound Algorithm for the Clique Partitioning Problem (Q5392092):
Displaying 8 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- The clique-partitioning problem (Q807637) (← links)
- A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
- Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← links)
- New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845) (← links)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- (Q4960830) (← links)
- The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)