Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
From MaRDI portal
Publication:2471278
DOI10.1016/j.disopt.2006.10.009zbMath1169.90469OpenAlexW2033863375MaRDI QIDQ2471278
Publication date: 22 February 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.009
Related Items (20)
The multi-terminal vertex separator problem: branch-and-cut-and-price ⋮ An exact approach for the balanced \(k\)-way partitioning problem with weight constraints and its application to sports team realignment ⋮ A three-phased local search approach for the clique partitioning problem ⋮ An algorithm for the microaggregation problem using column generation ⋮ Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables ⋮ A branch-and-bound algorithm for the acyclic partitioning problem ⋮ Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint ⋮ Size-constrained graph partitioning polytopes ⋮ A note on branch-and-cut-and-price ⋮ Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem ⋮ Fixed set search applied to the clique partitioning problem ⋮ Solving Graph Partitioning Problems with Parallel Metaheuristics ⋮ New bounds and constraint propagation techniques for the clique partitioning problem ⋮ The sport teams grouping problem ⋮ Column generation bounds for numerical microaggregation ⋮ Reformulated acyclic partitioning for rail-rail containers transshipment ⋮ A branch-and-price-and-cut method for computing an optimal bramble ⋮ Branch-price-and-cut for the mixed capacitated general routing problem with time windows ⋮ Balanced Partition of a Graph for Football Team Realignment in Ecuador ⋮ Interval scheduling with economies of scale
Uses Software
Cites Work
- Facets of the clique partitioning polytope
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- A polyhedral approach to edge coloring
- Cliques and clustering: A combinatorial approach
- Linear programming for the \(0-1\) quadratic knapsack problem
- Min-cut clustering
- MINTO, a Mixed INTeger Optimizer
- A technical review of column generation in integer programming
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- The partition problem
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem
- Finding optimal realignments in sports leagues using a branch-and-cut-and-price approach
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- An Optimization Based Heuristic for Political Districting
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Quadratic knapsack problems
- A Column Generation Approach for Graph Coloring
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Exact Solution of the Quadratic Knapsack Problem
- Realignment in the National Football League: Did they do it right?
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Lagrangian relaxation approach to the edge-weighted clique problem
This page was built for publication: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
