Linear and quadratic programming approaches for the general graph partitioning problem
From MaRDI portal
Publication:1959249
DOI10.1007/s10898-009-9520-1zbMath1202.90261OpenAlexW2072884723MaRDI QIDQ1959249
Publication date: 6 October 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9520-1
Programming involving graphs or networks (90C35) Quadratic programming (90C20) Boolean programming (90C09)
Related Items
SDP-based bounds for graph partition via extended ADMM, Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables, Systematic and deterministic graph minor embedding for Cartesian products of graphs, The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>, Graph clustering with Boltzmann machines, Using hierarchical clustering and dendrograms to quantify the clustering of membrane proteins, Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs, Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm, Robust optimization of graph partitioning involving interval uncertainty, An exact approach for the multi-constraint graph partitioning problem, A locally optimal hierarchical divisive heuristic for bipartite modularity maximization, Employee workload balancing by graph partitioning, Graph Clustering Via Intra-Cluster Density Maximization, Reformulation of a model for hierarchical divisive graph modularity maximization, Robust Critical Node Selection by Benders Decomposition, Integer programming formulations and efficient local search for relaxed correlation clustering, Advanced Coarsening Schemes for Graph Partitioning, Column-generation based bounds for the homogeneous areas problem
Uses Software
Cites Work
- Unnamed Item
- Graph clustering
- A new linearization technique for multi-quadratic 0-1 programming problems.
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- A survey for the quadratic assignment problem
- Compact mathematical formulation for graph partitioning
- Global multidimensional optimization on parallel computer
- Some simplified NP-complete graph problems
- Multiset graph partitioning
- Global optimization: Fractal approach and non-redundant parallelism
- Graph partitioning using linear and semidefinite programming
- An evolutionary heuristic for quadratic 0-1 programming
- An improved linearization strategy for zero-one quadratic programming problems
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Integer Programming of Biclustering Based on Graph Models
- Recent directions in netlist partitioning: a survey
- An Efficient Heuristic Procedure for Partitioning Graphs
- Parallel Multilevel series k-Way Partitioning Scheme for Irregular Graphs
- Graph Partitioning and Continuous Quadratic Programming
- A Decomposition Method for Quadratic Zero-One Programming
