The following pages link to (Q4735939):
Displaying 10 items.
- ABACUS (Q15484) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- PEBBL: an object-oriented framework for scalable parallel branch and bound (Q903924) (← links)
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301) (← links)
- An integer programming approach to optimal basic block instruction scheduling for single-issue processors (Q1751173) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
