Efficient algorithms for the offline variable sized bin-packing problem

We addresses a variant of the classical one dimensional bin-packing problem where several types of bins with unequal sizes and costs are presented. Each bin-type includes limited and/or unlimited identical bins. The goal is to minimize the total cost of bins needed to store a given set of items, each item with some space requirements. Four new heuristics to solve this problem are proposed, developed and compared. The experiments results show that higher quality solutions can be obtained using the proposed algorithms.     

Properties of silver nanoparticle-polypyrrole composite film grown on cellulosic paper

Cellulose - In this work, a cellulosic paper substrate (Pap) coated by in situ polymerization of polypyrrole (PPY) was designed. This paper was subsequently coated with silver nanoparticles...     

Evidence of interchange reaction in a poly(ethylene 2,6-naphthalenedicarboxylate)/poly(bisphenol-A carbonate) blend

The existence of interchange reactions in a poly(ethylene 2,6-naphthalenedicarboxylate)/poly(bisphenol-A carbonate) blend (PEN/PC) has been proven by means of solubility tests, DSC and FTIR and NMR spectroscopies. In addition, DSC results reveal that these interchange reactions are responsible for the miscibilization of the initially immiscible system.