Pages that link to "Item:Q2446845"
From MaRDI portal
The following pages link to New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845):
Displaying 13 items.
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment (Q1631652) (← links)
- Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
- Clustering data that are graph connected (Q1753555) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
- Flight gate assignment and recovery strategies with stochastic arrival and departure times (Q2362237) (← links)
- Balanced Partition of a Graph for Football Team Realignment in Ecuador (Q2835691) (← links)
- Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)
- Fixed set search applied to the clique partitioning problem (Q6112737) (← links)
- \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)
