Pages that link to "Item:Q752015"
From MaRDI portal
The following pages link to Facets of the clique partitioning polytope (Q752015):
Displayed 50 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 corridor allocation problem (Q339697) (← links)
- Fractional programming formulation for the vertex coloring problem (Q402376) (← links)
- Improving heuristics for network modularity maximization using an exact algorithm (Q406498) (← links)
- Orbitopal fixing (Q408377) (← links)
- Column generation bounds for numerical microaggregation (Q486386) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
- A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- Community detection with the weighted parsimony criterion (Q904925) (← links)
- Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem (Q1048651) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- A cutting plane algorithm for a clustering problem (Q1122492) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Facets for the cut cone. I (Q1199749) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- Lifting theorems and facet characterization for a class of clique partitioning inequalities (Q1306454) (← links)
- Min-cut clustering (Q1321669) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Solving the anti-covering location problem using Lagrangian relaxation (Q1373891) (← 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)
- Clustering data that are graph connected (Q1753555) (← links)
- \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts (Q1814791) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- Facets of the \(k\)-partition polytope (Q1897366) (← links)
- On the partial order polytope of a digraph (Q1915807) (← links)
- Optimal solutions for the double row layout problem (Q1940444) (← links)
- The biclique partitioning polytope (Q2032987) (← 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)
- Facets from gadgets (Q2220662) (← links)
- Conference scheduling: a clustering-based approach (Q2242187) (← links)
- Max-multiflow/min-multicut for G+H series-parallel (Q2275455) (← links)
- Exact algorithms for the minimum \(s\)-club partitioning problem (Q2329904) (← links)
- Solving partitioning-hub location-routing problem using DCA (Q2358847) (← links)
- Flight gate assignment and recovery strategies with stochastic arrival and departure times (Q2362237) (← links)
- The realization problem for tail correlation functions (Q2363664) (← links)
- The partition problem (Q2366610) (← 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)
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement (Q2471278) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)