Solving Graph Bisection Problems with Semidefinite Programming
From MaRDI portal
Recommendations
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- Graph bisection revisited
- scientific article; zbMATH DE number 5237020
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- Spectral methods for graph bisection problems.
Cited in
(40)- Partitioning through projections: strong SDP bounds for large graph partition problems
- scientific article; zbMATH DE number 1817784 (Why is no real title available?)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- Engineering branch-and-cut algorithms for the equicut problem
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
- Exact combinatorial branch-and-bound for graph bisection
- Graph bisection revisited
- Mixed linear and semidefinite programming for combinatorial and quadratic optimization
- Spectral methods for graph bisection problems.
- Semidefinite programming relaxations for the graph partitioning problem
- An exact combinatorial algorithm for minimum graph bisection
- An effective iterated tabu search for the maximum bisection problem
- A semidefinite programming approach to the hypergraph minimum bisection problem
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- scientific article; zbMATH DE number 5237020 (Why is no real title available?)
- A MILP model for the connected multidimensional maximum bisection problem
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- Graph-Based Representations in Pattern Recognition
- Exploiting low-rank structure in semidefinite programming by approximate operator splitting
- Quadratic convex reformulations for quadratic 0-1 programming
- Some optimization problems on weak-bisplit graphs
- Memetic search for the max-bisection problem
- scientific article; zbMATH DE number 6401405 (Why is no real title available?)
- A full NT-step infeasible interior-point algorithm for semidefinite optimization based on a self-regular proximity
- A nonmonotone GRASP
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
- scientific article; zbMATH DE number 7286677 (Why is no real title available?)
- A projected gradient algorithm for solving the maxcut SDP relaxation
- An efficient semidefinite programming relaxation for the graph partition problem
- A branch-and-bound algorithm for the minimum cut linear arrangement problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems
- Exploiting semidefinite relaxations in constraint programming
- An exact algorithm for graph partitioning
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- ILP-Based Local Search for Graph Partitioning
- Advanced coarsening schemes for graph partitioning
- Finding optimal solutions to the graph partitioning problem with heuristic search
This page was built for publication: Solving Graph Bisection Problems with Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427330)
