13 search results - page 1 / 3 » A Faster Exact Separation Algorithm for Blossom Inequalities |
IPCO
2004
13 years 9 months ago
2004
MP
2010
13 years 6 months ago
2010
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To generate such inequalities, one needs separation algorithms...
IPCO
2007
13 years 9 months ago
2007
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
SOFSEM
2007
Springer
14 years 2 months ago
2007
Springer
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
The k-means algorithm is widely used for clustering, compressing, and summarizing vector data. In this paper, we propose a new acceleration for exact k-means that gives the same a...