Pages that link to "Item:Q1677299"

The following pages link to Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299):

Displaying 14 items.

• A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
• A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
• Solving the capacitated clustering problem with variable neighborhood search (Q1730629) (← links)
• Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping (Q2029286) (← links)
• The balanced maximally diverse grouping problem with block constraints (Q2031070) (← links)
• A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values (Q2095925) (← links)
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
• The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
• The balanced maximally diverse grouping problem with attribute values (Q6046134) (← links)
• An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← 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)
• The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study (Q6125237) (← links)
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)