An exact algorithm for min-max hyperstructure equipartition with a connected constraint
DOI10.1016/j.cor.2017.05.016zbMath1391.90620OpenAlexW2618617393MaRDI QIDQ1652415
Tunzi Tan, Juan A. Mesa, Sui-Xiang Gao
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2017.05.016
NP-hardminimax programmingrapid transit networkbalanced constraintconnected constrainthyperstructure equipartition
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60) Graph algorithms (graph-theoretic aspects) (05C85)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An effective multilevel tabu search approach for balanced graph partitioning
- On the complexity of partitioning graphs into connected subgraphs
- Equipartitions of graphs
- Some simplified NP-complete graph problems
- Min-cut clustering
- An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
- A branch-and-cut algorithm for the equicut problem
- On the validity of a front-oriented approach to partitioning large sparse graphs with a connectivity constraint
- An exact algorithm for graph partitioning
- Hypergraph theory. An introduction
- An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
- Recent directions in netlist partitioning: a survey
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- How to draw a hypergraph
- HYPERSTRUCTURES, A NEW APPROACH TO COMPLEX SYSTEMS
- Fast Approximate Graph Partitioning Algorithms
- Solving Graph Bisection Problems with Semidefinite Programming
- Line graphs for a multiplex network
- Graph Partitioning and Graph Clustering
- Min-Max Graph Partitioning and Small Set Expansion
This page was built for publication: An exact algorithm for min-max hyperstructure equipartition with a connected constraint
