Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks

Programming involving graphs or networks (90C35) Clustering in the social and behavioral sciences (91C20) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nonlinear programming (90C30) Combinatorial optimization (90C27)

Cites Work

Title not available (Why is that?)
MILP formulations for the modularity density maximization problem
Automatically finding clusters in normalized cuts
A fast constrained image segmentation algorithm
Modularity-maximizing graph communities via mathematical programming
Cliques and clustering: A combinatorial approach
A complete anytime algorithm for number partitioning
Cluster analysis and mathematical programming
Clustering on trees
Iterative ensemble normalized cuts
Complete mixed integer linear programming formulations for modularity density based clustering
Clustering data that are graph connected
On the multisource hyperplanes location problem to fitting set of points
A branch-and-price procedure for clustering data that are graph connected
A branch-and-price approach for the continuous multifacility monotone ordered median problem
A mathematical programming approach to overlapping community detection
Modularity maximization to design contiguous policy zones for pandemic response
Mathematical political districting taking care of minority groups
Political districting: from classical models to recent approaches
Segmentation of scanning-transmission electron microscopy images using the ordered median problem
Branch-and-price: Column generation for solving huge integer programs
A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
Partitioning Sparse Matrices with Eigenvectors of Graphs
A Polynomial Algorithm for the k-cut Problem for Fixed k
Imposing Contiguity Constraints in Political Districting Models
Column Generation
Selected Topics in Column Generation
Lower Bounds for the Partitioning of Graphs
The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>
A study on modularity density maximization: column generation acceleration and computational complexity analysis

This page was built for publication: Mixed-integer linear programming formulations and column generation algorithms for the minimum normalized cuts problem on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565391)