LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
From MaRDI portal
Publication:2392866
Recommendations
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- scientific article; zbMATH DE number 5237020
- Solving Graph Bisection Problems with Semidefinite Programming
- Graph bisection revisited
- Semidefinite programming based algorithms for the sparsest cut problem
Cites work
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- scientific article; zbMATH DE number 5237020 (Why is no real title available?)
- scientific article; zbMATH DE number 2196287 (Why is no real title available?)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- A Spectral Bundle Method for Semidefinite Programming
- A spectral bundle method with bounds
- Benchmarking optimization software with performance profiles.
- Branching rules revisited
- Computational Experience with an Interior Point Cutting Plane Algorithm
- Constraint Integer Programming: A New Approach to Integrate CP and MIP
- Dynamic bundle methods
- Fixing Variables in Semidefinite Relaxations
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Geometry of cuts and metrics
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Min-cut clustering
- Nonpolyhedral Relaxations of Graph-Bisection Problems
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- On interior-point warmstarts for linear and combinatorial optimization
- On the Graph Bisection Cut Polytope
- On the Shannon capacity of a graph
- On the \(0/1\) knapsack polytope
- On the cut polytope
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Some new classes of facets for the equicut polytope
- The analysis of a nested dissection algorithm
- The equipartition polytope. I: Formulations, dimension and basic facets
- The equipartition polytope. II: Valid inequalities and facets
- The node capacitated graph partitioning problem: A computational study
Cited in
(18)- Efficient semidefinite branch-and-cut for MAP-MRF inference
- scientific article; zbMATH DE number 5117494 (Why is no real title available?)
- scientific article; zbMATH DE number 1778391 (Why is no real title available?)
- Improved exact approaches for row layout problems with departments of equal length
- An exact combinatorial algorithm for minimum graph bisection
- A framework for solving mixed-integer semidefinite programs
- The MIN-cut and vertex separator problem
- Semidefinite programming based algorithms for the sparsest cut problem
- Solving Graph Bisection Problems with Semidefinite Programming
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
- scientific article; zbMATH DE number 1817784 (Why is no real title available?)
- An efficient semidefinite programming relaxation for the graph partition problem
- Semidefinite programming and eigenvalue bounds for the graph partition problem
- Cardinality-constrained distributionally robust portfolio optimization
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Engineering branch-and-cut algorithms for the equicut problem
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- Partitioning through projections: strong SDP bounds for large graph partition problems
This page was built for publication: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392866)
