360 search results - page 31 / 72 » The TV-Break Packing Problem |
127
click to vote
RSS
2007
15 years 3 months ago
2007
— Many robot motion planning problems can be described as a combination of motion through relatively sparsely filled regions of configuration space and motion through tighter p...
ICTAI
2005
IEEE
15 years 7 months ago
2005
IEEE
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
119
click to vote
PDPTA
1996
15 years 3 months ago
1996
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
116
click to vote
IEAAIE
2010
Springer
14 years 12 months ago
2010
Springer
This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem k...
112
click to vote
STOC
2010
ACM
15 years 11 months ago
2010
ACM
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...