Rudy
From MaRDI portal
Cited in
(21)- MADAM
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- SpeeDP
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
- Exploiting sparsity for the min \(k\)-partition problem
- Biq Mac
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- BiqMac
- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Randgraph
- 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
- Bqplib
- BiqBin
- A branch-price-and-cut algorithm for packing cuts in undirected graphs
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- Semidefinite programming and combinatorial optimization
This page was built for software: Rudy
