Pages that link to "Item:Q1267180"

The following pages link to Cliques and clustering: A combinatorial approach (Q1267180):

Displaying 36 items.

• A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
• Large-scale pickup and delivery work area design (Q339655) (← links)
• Orbitopal fixing (Q408377) (← links)
• The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934) (← links)
• A reactive GRASP with path relinking for capacitated clustering (Q535394) (← links)
• Dual variable based fathoming in dynamic programs for column generation (Q707137) (← links)
• Solving group technology problems via clique partitioning (Q877223) (← links)
• Amalgamation of partitions from multiple segmentation bases: a comparison of non-model-based and model-based methods (Q1037693) (← links)
• Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
• Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
• The sport teams grouping problem (Q1730756) (← links)
• Reformulated acyclic partitioning for rail-rail containers transshipment (Q1735174) (← links)
• A novel mixed integer linear programming model for clustering relational networks (Q1743542) (← links)
• A branch-and-price-and-cut method for computing an optimal bramble (Q1751138) (← links)
• Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
• A column generation approach to the coalition formation problem in multi-agent systems (Q1885967) (← links)
• A branch-and-price procedure for clustering data that are graph connected (Q2060392) (← links)
• Political districting to minimize cut edges (Q2099493) (← links)
• Multi-attribute community detection in international trade network (Q2129400) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
• Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← 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)
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
• Clustering of microarray data via clique partitioning (Q2576442) (← links)
• Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
• Solving Graph Partitioning Problems Arising in Tagless Cache Management (Q3195315) (← links)
• A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)
• A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques (Q5085477) (← 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)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• Fixed set search applied to the clique partitioning problem (Q6112737) (← links)
• Efficient enumeration of the optimal solutions to the correlation clustering problem (Q6162510) (← links)