swMATH21923MaRDI QIDQ33723FDOQ33723
Author name not available (Why is that?)
Official website: https://www-user.tu-chemnitz.de/~helmberg/sdp_software.html
Cited In (20)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- Lifting and separation procedures for the cut polytope
- Simplifying maximum flow computations: the effect of shrinking and good initial flows
- Models for the single-vehicle preemptive pickup and delivery problem
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- Semidefinite programming and combinatorial optimization
- SpeeDP
- Biq Mac
- BiqMac
- Randgraph
- Bqplib
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- BiqBin
- Exploiting sparsity for the min \(k\)-partition problem
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
This page was built for software: Rudy
