Pages that link to "Item:Q4973260"
From MaRDI portal
The following pages link to The Branch and Cut Method for the Clique Partitioning Problem (Q4973260):
Displaying 8 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← links)
- Metric space method for constructing splitting partitions of graphs (Q2178736) (← 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)
- The affine hull of the schedule polytope for servicing identical requests by parallel devices (Q5100122) (← links)
- A New Branch and Bound Algorithm for the Clique Partitioning Problem (Q5392092) (← links)
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)