Pages that link to "Item:Q1122492"
From MaRDI portal
The following pages link to A cutting plane algorithm for a clustering problem (Q1122492):
Displaying 3 items.
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
- Comparison and polyhedral properties of valid inequalities for a polytope of schedules for servicing identical requests (Q6194920) (← links)
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)