321
Voted
AUSSOIS
16 years 10 days ago
2001 Springer 
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
241
Voted
AUSSOIS
16 years 10 days ago
2001 Springer 
In recent years the branch-and-cut method, a synthesis of the classical branch-and-bound and cutting plane methods, has proven to be a highly successful approach to solving large-s...
|
Optimization