Pages that link to "Item:Q2152278"
From MaRDI portal
The following pages link to Concise integer linear programming formulation for clique partitioning problems (Q2152278):
Displaying 4 items.
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
- Redundant constraints in the standard formulation for the clique partitioning problem (Q2257087) (← links)
- New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)