The following pages link to Rudy (Q33723):
Displaying 14 items.
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- Simplifying maximum flow computations: the effect of shrinking and good initial flows (Q411873) (← links)
- Models for the single-vehicle preemptive pickup and delivery problem (Q421257) (← links)
- Computational study of valid inequalities for the maximum \(k\)-cut problem (Q1657394) (← links)
- SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Exploiting sparsity for the min \(k\)-partition problem (Q2175445) (← links)
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- Computational study of a branching algorithm for the maximum \(k\)-cut problem (Q2673248) (← links)
- A Branch-Price-and-Cut Algorithm for Packing Cuts in Undirected Graphs (Q5266610) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Semidefinite programming and combinatorial optimization (Q5906394) (← links)
