Pages that link to "Item:Q1122492"

The following pages link to A cutting plane algorithm for a clustering problem (Q1122492):

Displaying 50 items.

• Multi-attribute community detection in international trade network (Q2129400) (← links)
• An overview of graph covering and partitioning (Q2142633) (← links)
• Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← links)
• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint (Q2177831) (← links)
• An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
• Additive approximation algorithms for modularity maximization (Q2221809) (← 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)
• Flight gate assignment and recovery strategies with stochastic arrival and departure times (Q2362237) (← links)
• The partition problem (Q2366610) (← links)
• The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem (Q2370343) (← links)
• Detecting community structure: from parsimony to weighted parsimony (Q2429906) (← 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)
• Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
• Evaluating the quality of image matrices in blockmodeling (Q2516355) (← links)
• Clustering of microarray data via clique partitioning (Q2576442) (← links)
• A global optimization RLT-based approach for solving the hard clustering problem (Q2576449) (← links)
• Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering (Q2670543) (← links)
• A polyhedral study of lifted multicuts (Q2688466) (← links)
• Balanced Partition of a Graph for Football Team Realignment in Ecuador (Q2835691) (← links)
• Agrégation des similarités : une solution oubliée (Q3148380) (← links)
• Solving Graph Partitioning Problems Arising in Tagless Cache Management (Q3195315) (← links)
• Exact Algorithms for Cluster Editing: Evaluation and Experiments (Q3506417) (← links)
• Models for machine-part grouping in cellular manufacturing (Q4230175) (← links)
• Fast Clustering Algorithms (Q4302716) (← links)
• A New Composite Algorithm for Clustering Problems (Q4344451) (← links)
• The clique partitioning problem: Facets and patching facets (Q4537609) (← links)
• Transitive packing (Q4645940) (← links)
• The Branch and Cut Method for the Clique Partitioning Problem (Q4973260) (← links)
• Toward Optimal Community Detection: From Trees to General Weighted Networks (Q4985780) (← links)
• Storage assignment and order batching problem in Kiva mobile fulfilment system (Q5058813) (← links)
• Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
• The affine hull of the schedule polytope for servicing identical requests by parallel devices (Q5100122) (← links)
• Using Mathematical Programming to Refine Heuristic Solutions for Network Clustering (Q5265217) (← links)
• Experiments with a Non-convex Variance-Based Clustering Criterion (Q5270614) (← links)
• Cluster Editing (Q5326357) (← links)
• Clique Partitioning for Clustering: A Comparison with<i>K</i>-Means and Latent Class Analysis (Q5451111) (← links)
• Going Weighted: Parameterized Algorithms for Cluster Editing (Q5505638) (← links)
• Efficient algorithms for cluster editing (Q5963626) (← links)
• An efficient heuristic for the \(k\)-partitioning problem (Q6063777) (← links)
• A strong formulation for the graph partition problem (Q6068542) (← 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)
• Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← 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)
• The balanced maximally diverse grouping problem with integer attribute values (Q6166203) (← links)