On the solution of a graph partitioning problem under capacity constraints

Authors:
Pierre Bonami;Viet Hung Nguyen;Michel Klein;Michel Minoux
Affiliations:
LIF, CNRS Aix-Marseille Université, Marseille, France;LIP6, Université Pierre et Marie Curie Paris 6, Paris, France;LIF, CNRS Aix-Marseille Université, Marseille, France;LIP6, Université Pierre et Marie Curie Paris 6, Paris, France
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 9
Cited 0

A cutting plane algorithm for a clustering problem

Mathematical Programming: Series A and B
Projection and Lifting in Combinatorial Optimization

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
SONET/SDH ring assignment with capacity constraints

Discrete Applied Mathematics - Special issue: Algorithmic aspects of communication
A column generation approach for SONET ring assignment

Networks
Acceleration of cutting-plane and column generation algorithms: Applications to network design

Networks - Special Issue on Multicommodity Flows and Network Design
Using a Mixed Integer Quadratic Programming Solver for the Unconstrained Quadratic 0-1 Problem

Mathematical Programming: Series A and B
Balanced Graph Partitioning

Theory of Computing Systems
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

Mathematical Programming: Series A and B
An in-out approach to disjunctive optimization

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a variant of the graph partitioning problem where the weight of a cluster in the partition depends on the edges incident to its nodes. This problem was first proposed in the context of optical networks design. We recall complexity results and establish new inaproximability results. We then study several mixed integer quadratic programming formulations for the problem and different solutions techniques. We present experimental results comparing the various formulations and solution techniques.