The following pages link to The partition problem (Q2366610):
Displaying 50 items.
- Separation algorithm for tree partitioning inequalities (Q325404) (← links)
- An extended edge-representative formulation for the \(K\)-partitioning problem (Q325479) (← links)
- Stochastic graph partitioning: quadratic versus SOCP formulations (Q331990) (← links)
- Multicuts and perturb \& MAP for probabilistic graph clustering (Q334274) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- Orbitopal fixing (Q408377) (← links)
- Size-constrained graph partitioning polytopes (Q607006) (← links)
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem (Q646707) (← links)
- A branch-and-cut algorithm for the partitioning-hub location-routing problem (Q709201) (← links)
- Solving group technology problems via clique partitioning (Q877223) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← 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)
- Cardinality constrained Boolean quadratic polytope (Q1372737) (← links)
- Planning personnel retraining: column generation heuristics (Q1631648) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- An extended formulation of the convex recoloring problem on a tree (Q1675254) (← links)
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774) (← links)
- Block rearranging elements within matrix columns to minimize the variability of the row sums (Q1743640) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← 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)
- Global optimization of multilevel electricity market models including network design and graph partitioning (Q2010915) (← links)
- Political districting to minimize cut edges (Q2099493) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- A class of spectral bounds for max \(k\)-cut (Q2181211) (← links)
- An exact approach for the multi-constraint graph partitioning problem (Q2219514) (← links)
- Facets from gadgets (Q2220662) (← links)
- A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem (Q2246187) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- Congress seat allocation using mathematical optimization (Q2334468) (← 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)
- Clustering of microarray data via clique partitioning (Q2576442) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems (Q2803836) (← links)
- Scheduling Personnel Retraining: Column Generation Heuristics (Q2835678) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- Probabilistic Correlation Clustering and Image Partitioning Using Perturbed Multicuts (Q3300302) (← links)
