1486 search results - page 20 / 298 » Algorithms for two-box covering |
WAOA
2004
Springer
14 years 22 days ago
2004
Springer
SODA
2010
ACM
14 years 4 months ago
2010
ACM
MP
2010
13 years 5 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...
ICCS
2003
Springer
14 years 18 days ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
