scientific article; zbMATH DE number 5237020
From MaRDI portal
Publication:5443138
Recommendations
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- A semidefinite programming approach to the hypergraph minimum bisection problem
- An exact combinatorial algorithm for minimum graph bisection
- Solving Graph Bisection Problems with Semidefinite Programming
- scientific article; zbMATH DE number 1817784
- On the graph bisection problem
- Graph Bipartization and via minimization
- On minimum bisection and related partition problems in graphs with bounded tree width
- scientific article; zbMATH DE number 1929926
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Cited in
(12)- Some optimization problems on weak-bisplit graphs
- Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
- Two new integer linear programming formulations for the vertex bisection problem
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- A semidefinite programming approach to the hypergraph minimum bisection problem
- On the Graph Bisection Cut Polytope
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- scientific article; zbMATH DE number 666305 (Why is no real title available?)
- Solving Graph Bisection Problems with Semidefinite Programming
- scientific article; zbMATH DE number 1778391 (Why is no real title available?)
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- An exact combinatorial algorithm for minimum graph bisection
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5443138)
