Buscar
Mostrando ítems 11-20 de 1011
Method of sentinels for packing items within arbitrary convex regions
(Palgrave Macmillan LtdBasingstokeInglaterra, 2006)
Two-dimensional strip packing with unloading constraints
(Elsevier Science BvAmsterdamHolanda, 2014)
Multicast packing problem: abordagem multiobjetivo
(Universidade Federal do Rio Grande do NorteBRUFRNPrograma de Pós-Graduação em Sistemas e ComputaçãoCiência da Computação, 2013-02-01)
This work presents a algorithmic study of Multicast Packing Problem considering a multiobjective
approach. The first step realized was an extensive review about the problem. This
review serverd as a reference point for the ...
Minimizing the object dimensions in circle and sphere packing problems
(PERGAMON-ELSEVIER SCIENCE LTD, 2008)
Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also ...
Stronger Bounds And Faster Algorithms For Packing In Generalized Kernel Systems
(Springer HeidelbergHeidelberg, 2016)
A note on the approximability of cutting stock problems
(Elsevier Science BvAmsterdamHolanda, 2007)
Approximation schemes for knapsack problems with shelf divisions
(Elsevier Science BvAmsterdamHolanda, 2006)
The packing coloring problem for lobsters and partner limited graphs
(Elsevier Science, 2014-08)
A packing k-coloring of a graph G is a k-coloring such that the distance between two vertices having color i is at least i + 1. To compute the packing chromatic number is NP-hard, even restricted to trees, and it is known ...
Approximation algorithms and hardness results for the clique packing problem
(ELSEVIER SCIENCE BV, 2009)
For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural ...
A NOTE ON DUAL APPROXIMATION ALGORITHMS FOR CLASS CONSTRAINED BIN PACKING PROBLEMS
(Edp Sciences S ALes Ulis Cedex AFrança, 2009)