Rudy
From MaRDI portal
Software:33723
No author found.
Related Items (14)
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints ⋮ An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions ⋮ Computational study of valid inequalities for the maximum \(k\)-cut problem ⋮ Exploiting sparsity for the min \(k\)-partition problem ⋮ SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances ⋮ 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 ⋮ Semidefinite programming and combinatorial optimization ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs
This page was built for software: Rudy
