144 search results - page 7 / 29 » New approaches to covering and packing problems |
114
click to vote
SODA
2012
ACM
13 years 1 days ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
—Every year the computing resources available on dynamically partially reconfigurable devices increase enormously. In the near future, we expect many applications to run on a si...
103
click to vote
CP
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Selecting conformations for side-chains is an important subtask in building three-dimensional protein models. Side-chain placement is a difficult problem because of the l...
EVOW
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper introduces a new tabu search algorithm for a twodimensional (2D) Strip Packing Problem (2D-SPP). It integrates several key features: A direct representation of...
MP
2010
14 years 8 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...