Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS
From MaRDI portal
Recommendations
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Introduction to ABACUS -- a branch-and-cut system
- scientific article; zbMATH DE number 780782
- Combinatorial optimization and small polytopes
- An augment-and-branch-and-cut framework for mixed 0-1 programming
Cited in
(16)- Introduction to ABACUS -- a branch-and-cut system
- ABACUS
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors
- Symmetric ILP: Coloring and small integers
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
- Solving real-world ATSP instances by branch-and-cut
- Branch, cut, and price: sequential and parallel
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- scientific article; zbMATH DE number 780782 (Why is no real title available?)
- A branch and cut solver for the maximum stable set problem
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Constrained planarity in practice -- engineering the synchronized planarity algorithm
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Design of survivable IP-over-optical networks
- PEBBL: an object-oriented framework for scalable parallel branch and bound
This page was built for publication: Branch-and-cut algorithms for combinatorial optimization and their implementation in ABACUS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4735939)
