Yanasse H.H.

H.H. Yanasse

Information about the author H.H. Yanasse will soon be added to the site.
Found 8 papers in total
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem
2007
In this paper, we suggest a parallel algorithm based on a shared memory SIMD...
Checkerboard pattern: proposals for its generation
Checkerboard pattern: proposals for its generation
2005
Checkerboard patterns, also known as 1-group patterns, belong to a special class of...
Linear models for 1-group two-dimensional guillotine cutting problems
Linear models for 1-group two-dimensional guillotine cutting problems
2006
In this study we present integer linear and non-linear models to generate 1-group...
Refinements on an emuneration scheme for solving a pattern sequencing problem
Refinements on an emuneration scheme for solving a pattern sequencing problem
2004
We introduce some refinements on a branch-and-bound-scheme for solving the...
An algorithm for determining the k-best solutions of the one-dimensional knapsack problem
An algorithm for determining the k-best solutions of the one-dimensional knapsack problem
2000
In this work we present an enumerative scheme for determining the K-best solutions (K...
Bounds for a problem of sequencing patterns
Bounds for a problem of sequencing patterns
1999
In some wood cutting settings, the cutting sequence of the patterns produced to...
A transformation for solving a pattern sequencing in the wood cut industry
A transformation for solving a pattern sequencing in the wood cut industry
1997
Consider a wood cutting setting where different panels have to be cut from large...
The complexity of the cost-time tradeoff problem with non-convex functions
The complexity of the cost-time tradeoff problem with non-convex functions
1991
In this paper it is shown that the cost-time tradeoff problem with non-convex...
Papers per page: