Cliques and clustering: A combinatorial approach

Authors:
Anuj Mehrotra;Michael A Trick
Affiliations:
Department of Management Science, University of Miami, Coral Gables, FL 33124-8237, USA;Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA 15213-3890, USA
Venue:
Operations Research Letters
Year:
1998

Citing 15
Cited 10

On the cut polytope

Mathematical Programming: Series A and B
On the maximum weight clique problem

Mathematics of Operations Research
A cutting plane algorithm for a clustering problem

Mathematical Programming: Series A and B
The Boolean quadric polytope: some characteristics, facets and relatives

Mathematical Programming: Series A and B
Facets of the clique partitioning polytope

Mathematical Programming: Series A and B
Modelling and strong linear programs for mixed integer programming

Algorithms and model formulations in mathematical programming
Minimum weighted coloring of triangulated graphs, with application to maximum weight vertex packing and clique finding in arbitrary graphs

SIAM Journal on Computing
The partition problem

Mathematical Programming: Series A and B
Constrained graph partitioning: decomposition, polyhedral structure and algorithms

Constrained graph partitioning: decomposition, polyhedral structure and algorithms
Min-cut clustering

Mathematical Programming: Series A and B
The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs

SIAM Journal on Discrete Mathematics
Solving binary cutting stock problems by column generation and branch-and-bound

Computational Optimization and Applications
Formulations and valid inequalities for the node capacitated graph partitioning problem

Mathematical Programming: Series A and B
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Software section: MINTO, a mixed INTeger optimizer

Operations Research Letters

Consolidating Maintenance Spares

Computational Optimization and Applications
A column generation approach to the coalition formation problem in multi-agent systems

Computers and Operations Research
Orbitopal Fixing

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
A reactive GRASP with path relinking for capacitated clustering

Journal of Heuristics
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

Computers and Operations Research
An efficient integer programming formulation for the assignment of base stations to controllers in cellular networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement

Discrete Optimization
New bounds and constraint propagation techniques for the clique partitioning problem

Discrete Applied Mathematics
Lagrangian relaxation and pegging test for the clique partitioning problem

Advances in Data Analysis and Classification
Randomized heuristics for handover minimization in mobility networks

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We use column generation and a specialized branching technique for solving constrained clustering problems. We also develop and implement an innovative combinatorial method for solving the pricing subproblems. Computational experiments comparing the resulting branch-and-price method to competing methodologies in the literature are presented and suggest that our technique yields a significant improvement on the hard instances of this problem.