Pages that link to "Item:Q4537609"

The following pages link to The clique partitioning problem: Facets and patching facets (Q4537609):

Displaying 39 items.

• A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
• An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
• Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
• A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Size-constrained graph partitioning polytopes (Q607006) (← links)
• Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
• Solving group technology problems via clique partitioning (Q877223) (← links)
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
• Solving the clique partitioning problem as a maximally diverse grouping problem (Q1677299) (← links)
• Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
• A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
• Projection results for the \(k\)-partition problem (Q1751250) (← links)
• The biclique partitioning polytope (Q2032987) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← 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)
• Redundant constraints in the standard formulation for the clique partitioning problem (Q2257087) (← links)
• Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
• New bounds and constraint propagation techniques for the clique partitioning problem (Q2446845) (← links)
• Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
• Clustering of microarray data via clique partitioning (Q2576442) (← links)
• A polyhedral study of lifted multicuts (Q2688466) (← links)
• Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
• Transitive packing (Q4645940) (← links)
• The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
• Disconnecting graphs by removing vertices: a polyhedral approach (Q5422013) (← links)
• Clique Partitioning for Clustering: A Comparison with<i>K</i>-Means and Latent Class Analysis (Q5451111) (← links)
• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem (Q6080763) (← links)
• The <scp><i>K</i>‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp> (Q6092622) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← 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)
• On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
• Efficient enumeration of the optimal solutions to the correlation clustering problem (Q6162510) (← links)
• \texttt{CP-Lib}: benchmark instances of the clique partitioning problem (Q6548518) (← links)