The following pages link to (Q3140425):
Displaying 5 items.
- A brief history of lift-and-project (Q537586) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Bi-criteria and approximation algorithms for restricted matchings (Q2453169) (← links)
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization (Q4789079) (← links)
