1. (100%) Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB) - Mukhacheva,E.A.; Belov,G.N.; Kartack,V.M.; Mukhacheva,A.S.
Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method ( ...
(text/html) - 23-may-2005

2. (100%) Limit Theory for Random Sequential Packing and Deposition - Penrose, Mathew D.; Yukich, J.E.
Consider sequential packing of unit balls in a large cube, as in the Rényi car-parking model, but in any dimension and with finite input. We prove a law of large numbers and central limit theorem for
(application/pdf) - 19-sep-2008

3. (100%) Parking Arcs on the Circle with Applications to One-Dimensional Communication Networks - Coffman, E. G.; Mallows, C. L.; Poonen, Bjorn
Let $(r_1, s_1), \ldots, (r_n, s_n)$ be a sequence of requests to place arcs on the unit circle, whe ...
(application/pdf) - 19-sep-2008

4. (100%) Solving Nesting Problems with Non-Convex Polygons by Constraint Logic Programming ∗ - Maria Antónia; Carravilla Cristina Ribeiro; José F. Oliveira
problems is presented. Nesting problems are a special case of the cutting and packing problems, in ... deal with the geometric constraints inherent to all cutting and packing problems. Computational
(application/pdf) - 15-jul-2009

5. (100%) Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals - Alberto Caprara; Romeo Rizzi
4 as well as for Set Packing where the maximum size of a set is 6. Any improvement in the ratio
(application/postscript) - 23-jul-2009

6. (100%) Parametric On-Line Algorithms for Packing Rectangles and Boxes - F. K. Miyazawa; F. K. Miyazawa; Y. Wakabayashi; Y. Wakabayashi
We present approximation algorithms for the following problems: the two-dimensional bin packing, the three-dimensional packing problem and the container packing problem. We consider the special
(application/postscript) - 24-jul-2009

7. (100%) New Classes of Lower Bounds for Bin Packing Problems - Sandor P. Fekete; S'andor P. Fekete; Jörg Schepers; Jorg Schepers
The bin packing problem is one of the classical NP-hard optimization problems. Even though there ... the currently best known "economical" lower bound for the bin packing problem by Martello
(application/postscript) - 28-jul-2009

8. (100%) On more-dimensional packing II: Bounds - Sandor P. Fekete; Jörg Schepers; Sandor P. Fekete; Sandor P. Fekete
More-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branchand -bound framework for solving these
(application/postscript) - 29-jul-2009

9. (100%) On more-dimensional packing I: Modeling - Sandor P. Fekete; Jörg Schepers; Sandor P. Fekete; Sandor P. Fekete
More-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous eorts for exact algorithms have been unable to avoid
(application/postscript) - 29-jul-2009

10. (100%) On more-dimensional packing III: Exact Algorithms - Sandor P. Fekete; Jörg Schepers; Sandor P. Fekete; Sandor P. Fekete
More-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Combining the use of our data structure for characterizing
(application/postscript) - 29-jul-2009

Página de resultados:
1  2  3  4  5  6  7  8  9  10  Siguiente