Linear and quadratic programming approaches for the general graph partitioning problem

Authors:
Neng Fan;Panos M. Pardalos
Affiliations:
Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA;Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
Venue:
Journal of Global Optimization
Year:
2010

Citing 12
Cited 5

Computational aspects of a branch and bound algorithm for quadratic zero-one programming

Computing
A decomposition method for quadratic zero-one programming

Management Science
Recent directions in netlist partitioning: a survey

Integration, the VLSI Journal
Multilevel hypergraph partitioning: applications in VLSI domain

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Graph Partitioning and Continuous Quadratic Programming

SIAM Journal on Discrete Mathematics
Semidefinite programming relaxations for the graph partitioning problem

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Bipartite graph partitioning and data clustering

Proceedings of the tenth international conference on Information and knowledge management
Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

SIAM Journal on Optimization
Parallel Multilevel Graph Partitioning

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Global Optimization: Fractal Approach and Non-redundant Parallelism

Journal of Global Optimization
Survey: Graph clustering

Computer Science Review
A new linearization technique for multi-quadratic 0-1 programming problems

Operations Research Letters

Robust optimization of graph partitioning and critical node detection in analyzing networks

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
On the two-stage stochastic graph partitioning problem

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs

Journal of Combinatorial Optimization
Robust optimization of graph partitioning involving interval uncertainty

Theoretical Computer Science
Employee workload balancing by graph partitioning

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The graph partitioning problem is to partition the vertex set of a graph into a number of nonempty subsets so that the total weight of edges connecting distinct subsets is minimized. Previous research requires the input of cardinalities of subsets or the number of subsets for equipartition. In this paper, the problem is formulated as a zero-one quadratic programming problem without the input of cardinalities. We also present three equivalent zero-one linear integer programming reformulations. Because of its importance in data biclustering, the bipartite graph partitioning is also studied. Several new methods to determine the number of subsets and the cardinalities are presented for practical applications. In addition, hierarchy partitioning and partitioning of bipartite graphs without reordering one vertex set, are studied.