Pages that link to "Item:Q877223"

The following pages link to Solving group technology problems via clique partitioning (Q877223):

Displaying 14 items.

• A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
• Iterated maxima search for the maximally diverse grouping problem (Q323418) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299) (← links)
• Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← links)
• 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)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5918755) (← 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)