Relevant bibliographies by topics / Bin packing

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Bin packing'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bin packing.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Bin packing"

1

Gutin, Gregory, Tommy Jensen, and Anders Yeo. "Batched bin packing." Discrete Optimization 2, no. 1 (2005): 71–82. http://dx.doi.org/10.1016/j.disopt.2004.11.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Epstein, Leah, and Elena Kleiman. "Selfish Bin Packing." Algorithmica 60, no. 2 (2009): 368–94. http://dx.doi.org/10.1007/s00453-009-9348-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kuipers, Jeroen. "Bin packing games." Mathematical Methods of Operations Research 47, no. 3 (1998): 499–510. http://dx.doi.org/10.1007/bf01198407.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Epstein, Leah. "On bin packing with clustering and bin packing with delays." Discrete Optimization 41 (August 2021): 100647. http://dx.doi.org/10.1016/j.disopt.2021.100647.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kartak, Vadim M., and Artem V. Ripatti. "Large proper gaps in bin packing and dual bin packing problems." Journal of Global Optimization 74, no. 3 (2018): 467–76. http://dx.doi.org/10.1007/s10898-018-0696-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Liu, Yang, and Thanh Vinh Vo. "Bin Packing Solution for Automated Packaging Application." Applied Mechanics and Materials 143-144 (December 2011): 279–83. http://dx.doi.org/10.4028/www.scientific.net/amm.143-144.279.

Full text
Abstract:
This paper introduces the implementation of a new heuristic recursive algorithm for bin packing solution used in automated packaging application. The theoretical method proposed in this paper is successfully implemented on a real ABB robot arm with some important improvements such as added rotation flexibility and removing an added product from the structure. The computational results on a class of benchmark problems have shown that this algorithm not only finds shorter height than the known meta-heuristic ones, but also runs in shorter time. The average running time is very suitable for such
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Jianglong, Kaibo Liang, Huwei Liu, et al. "Optimizing e-commerce warehousing through open dimension management in a three-dimensional bin packing system." PeerJ Computer Science 9 (October 9, 2023): e1613. http://dx.doi.org/10.7717/peerj-cs.1613.

Full text
Abstract:
In the field of e-commerce warehousing, maximizing the utilization of packing bins is a fundamental goal for all major logistics enterprises. However, determining the appropriate size of packing bins poses a practical challenge for many logistics companies. Given the limited research on the open-size 3D bin packing problem as well as the high complexity and lengthy computation time of existing models, this study focuses on optimizing multiple-bin sizes within the e-commerce context. Building upon existing research, we propose a hybrid integer programming model, denoted as the three dimensional
APA, Harvard, Vancouver, ISO, and other styles
8

Lin, Bingchen, Jiawei Li, Ruibin Bai, Rong Qu, Tianxiang Cui, and Huan Jin. "Identify Patterns in Online Bin Packing Problem: An Adaptive Pattern-Based Algorithm." Symmetry 14, no. 7 (2022): 1301. http://dx.doi.org/10.3390/sym14071301.

Full text
Abstract:
Bin packing is a typical optimization problem with many real-world application scenarios. In the online bin packing problem, a sequence of items is revealed one at a time, and each item must be packed into a bin immediately after its arrival. Inspired by duality in optimization, we proposed pattern-based adaptive heuristics for the online bin packing problem. The idea is to predict the distribution of items based on packed items, and to apply this information in packing future arrival items in order to handle uncertainty in online bin packing. A pattern in bin packing is a combination of items
APA, Harvard, Vancouver, ISO, and other styles
9

Shah, Devavrat, and John N. Tsitsiklis. "Bin Packing with Queues." Journal of Applied Probability 45, no. 4 (2008): 922–39. http://dx.doi.org/10.1239/jap/1231340224.

Full text
Abstract:
We study the best achievable performance (in terms of the average queue size and delay) in a stochastic and dynamic version of the bin-packing problem. Items arrive to a queue according to a Poisson process with rate 2ρ, where ρ ∈ (0, 1). The item sizes are independent and identically distributed (i.i.d.) with a uniform distribution in [0, 1]. At each time unit, a single unit-size bin is available and can receive any of the queued items, as long as their total size does not exceed 1. Coffman and Stolyar (1999) and Gamarnik (2004) have established that there exist packing policies under which t
APA, Harvard, Vancouver, ISO, and other styles
10

Shah, Devavrat, and John N. Tsitsiklis. "Bin Packing with Queues." Journal of Applied Probability 45, no. 04 (2008): 922–39. http://dx.doi.org/10.1017/s0021900200004885.

Full text
Abstract:
We study the best achievable performance (in terms of the average queue size and delay) in a stochastic and dynamic version of the bin-packing problem. Items arrive to a queue according to a Poisson process with rate 2ρ, where ρ ∈ (0, 1). The item sizes are independent and identically distributed (i.i.d.) with a uniform distribution in [0, 1]. At each time unit, a single unit-size bin is available and can receive any of the queued items, as long as their total size does not exceed 1. Coffman and Stolyar (1999) and Gamarnik (2004) have established that there exist packing policies under which t
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bin packing"

1

Burcea, Mihai. "Online dynamic bin packing." Thesis, University of Liverpool, 2014. http://livrepository.liverpool.ac.uk/2005382/.

Full text
Abstract:
In this thesis we study online algorithms for dynamic bin packing. An online algorithm is presented with input throughout time and must make irrevocable decisions without knowledge of future input. The classical bin packing problem is a combinatorial optimization problem in which a set of items must be packed into a minimum number of uniform-sized bins without exceeding their capacities. The problem has been studied since the early 1970s and many variants continue to attract researchers’ attention today. The dynamic version of the bin packing problem was introduced by Coffman, Garey and Johnso
APA, Harvard, Vancouver, ISO, and other styles
2

Nielsen, Torben Noerup. "Combinatorial Bin Packing Problems." Diss., The University of Arizona, 1985. http://hdl.handle.net/10150/187536.

Full text
Abstract:
In the past few years, there has been a strong and growing interest in evaluating the expected behavior of what we call combinatorial bin packing problems. A combinatorial bin packing problem consists of a number of items of various sizes and value ratios (value per unit of size) along with a collection of bins of fixed capacity into which the items are to be packed. The packing must be done in such a way that the sum of the sizes of the items into a given bin does not exceed the capacity of that bin. Moreover, an item must either be packed into a bin in its entirety or not at all: this "all o
APA, Harvard, Vancouver, ISO, and other styles
3

BALDI, MAURO MARIA. "Generalized Bin Packing Problems." Doctoral thesis, Politecnico di Torino, 2013. http://hdl.handle.net/11583/2507776.

Full text
Abstract:
Packing problems make up a fundamental topic of combinatorial optimization. Their importance is confirmed both by their wide range of scientific and technological applications they are able to address and by their theoretical implications. In fact, they are exploited in many fields such as computer science and technologies, industrial applications, transportation and logistics, and telecommunications. From a theoretical perspective, packing problems often appear as sub-problems in order to iteratively solve bigger problems. Although packing problems play a fundamental role in all these setting
APA, Harvard, Vancouver, ISO, and other styles
4

Ilicak, Isil. "Bi-objective Bin Packing Problems." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/2/1079987/index.pdf.

Full text
Abstract:
In this study, we consider two bi-objective bin packing problems that assign a number of weighted items to bins having identical capacities. Firstly, we aim to minimize total deviation over bin capacity and minimize number of bins. We show that these two objectives are conflicting. Secondly, we study the problem of minimizing maximum overdeviation and minimizing the number of bins. We show the similarities of these two problems to parallel machine scheduling problems and benefit from the results while developing our solution approaches. For both problems, we propose exact procedures that gener
APA, Harvard, Vancouver, ISO, and other styles
5

Lundanes, Petter Olsen. "Bin packing problem with order constraints." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2014. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-27334.

Full text
Abstract:
This paper presents an algorithm to solve a variant of the bin packing problem with additional constraints on the order of items. The performance of this algorithm is tested, both for optimal solutions and approximations given by early termination, and is found to be limited for optimal solutions, but fairly efficient for decent approximations.
APA, Harvard, Vancouver, ISO, and other styles
6

Khan, Arindam. "Approximation algorithms for multidimensional bin packing." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/54371.

Full text
Abstract:
The bin packing problem has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical bin packing problem, we are given a list of real numbers in the range (0, 1], the goal is to place them in a minimum number of bins so that no bin holds numbers summing to more than 1. In this thesis we study approximation algorithms for three generalizations of bin packing: geometric bin packing, vector bin packing and weighted bipartite edge coloring. In two-dimensional (2-D) geometric bin packing, we are given a collection of re
APA, Harvard, Vancouver, ISO, and other styles
7

Shor, Peter Williston. "Random planar matching and bin packing." Thesis, Massachusetts Institute of Technology, 1985. https://hdl.handle.net/1721.1/128792.

Full text
Abstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.<br>Bibliography: leaves 123-124.<br>by Peter Williston Shor.<br>Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1985.
APA, Harvard, Vancouver, ISO, and other styles
8

Clautiaux, François. "New collaborative approaches for bin-packing problems." Habilitation à diriger des recherches, Université de Technologie de Compiègne, 2010. http://tel.archives-ouvertes.fr/tel-00749419.

Full text
Abstract:
Ce document décrit de nouvelles modélisations et approches de résolution que nous appliquons à des problèmes de découpe et de conditionnement. Nous étudions dans un premier temps plusieurs techniques de décomposition alliées à différentes méta-heuristiques basées sur des stratégies d'oscillation. Nous étudions ensuite le concept de fonctions dual-réalisables qui permettent d'obtenir des évaluations par défaut polynomiales pour des problèmes de conditionnement. Finalement, nous proposons des modèles originaux pour des problèmes de placement de rectangles. Nous utilisons ces modèles dans des mét
APA, Harvard, Vancouver, ISO, and other styles
9

Ben, Mohamed Ahmed Mohamed Abdellahi. "Résolution approchée du problème de bin-packing." Le Havre, 2009. http://www.theses.fr/2009LEHA0031.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Pasha, Arfath. "Geometric bin packing algorithm for arbitrary shapes." [Gainesville, Fla.] : University of Florida, 2003. http://purl.fcla.edu/fcla/etd/UFE0000907.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Bin packing"

1

Anderson, R. J. Parallel approximation algorithms for bin packing. Dept. of Computer Science, Stanford University, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Csirik, J. On the multidimensional vector bin packing. European Institute for Advanced Studies in Management, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Labbé, Martine. An exact algorithm for the dual bin packing problem. European Institute for Advanced Studies in Management, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Scheithauer, Guntram. 3 notes on cutting stock, bin packing, and container loading. University of Wrocław, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Steiner, Beat Friedrich. Modulare Werkstattsteuerung einer Fluidzellpresse: Lösung eines sequentiellen 2D Bin Packing-Problems. [s.n.], 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vanderbeck, François. Computational study of a column generation algorithm for bin packing and cutting stock problems. Judge Institute, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Goessens, Walter. An exact calculation of the expected waste for a bin-packing algorithm using items that are exponentially distributed. Universiteit Antwerpen, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Tuenter, Hans J. H. Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem. University of Birmingham, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

United States. Congress. House. Committee on Agriculture. Subcommittee on Livestock and Horticulture. Proposals to ban packer ownership of livestock: Hearing before the Subcommittee on Livestock and Horticulture of the Committee on Agriculture, House of Representatives, One Hundred Eighth Congress, first session, June 21, 2003, Grand Island, NE. U.S. G.P.O., 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

United States. Congress. House. Committee on Agriculture. Subcommittee on Livestock and Horticulture. Proposals to ban packer ownership of livestock: Hearing before the Subcommittee on Livestock and Horticulture of the Committee on Agriculture, House of Representatives, One Hundred Eighth Congress, first session, June 21, 2003, Grand Island, NE. U.S. G.P.O., 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Bin packing"

1

Korte, Bernhard, and Jens Vygen. "Bin-Packing." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24488-9_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Johnson, David S. "Bin Packing." In Encyclopedia of Algorithms. Springer New York, 2016. http://dx.doi.org/10.1007/978-1-4939-2864-4_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Korte, Bernhard, and Jens Vygen. "Bin-Packing." In Kombinatorische Optimierung. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-25401-7_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Johnson, David S. "Bin Packing." In Encyclopedia of Algorithms. Springer US, 2008. http://dx.doi.org/10.1007/978-0-387-30162-4_49.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Korte, Bernhard, and Jens Vygen. "Bin-Packing." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-21708-5_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Korte, Bernhard, and Jens Vygen. "Bin-Packing." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-21711-5_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Vazirani, Vijay V. "Bin Packing." In Approximation Algorithms. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-662-04565-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Korte, Bernhard, and Jens Vygen. "Bin-Packing." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-56039-6_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Coleman, Nastaran, and Pearl Wang. "Bin-Packing." In Encyclopedia of Operations Research and Management Science. Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_75.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Korte, Bernhard, and Jens Vygen. "Bin-Packing." In UNITEXT. Springer Milan, 2011. http://dx.doi.org/10.1007/978-88-470-1523-4_18.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bin packing"

1

Deleplanque, Samuel, Amélia Durbec, and Amina El Yaagoubi. "Quantum solution for solving the Bin Packing problem." In 2024 10th International Conference on Control, Decision and Information Technologies (CoDIT). IEEE, 2024. http://dx.doi.org/10.1109/codit62066.2024.10708635.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Angelopoulos, Spyros, Shahin Kamali, and Kimia Shadkami. "Online Bin Packing with Predictions." In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/635.

Full text
Abstract:
Bin packing is a classic optimization problem with a wide range of applications from load balancing to supply chain management. In this work, we study the online variant of the problem, in which a sequence of items of various sizes must be placed into a minimum number of bins of uniform capacity. The online algorithm is enhanced with a (potentially erroneous) prediction concerning the frequency of item sizes in the sequence. We design and analyze online algorithms with efficient tradeoffs between the consistency (i.e., the competitive ratio assuming no prediction error) and the robustness (i.e
APA, Harvard, Vancouver, ISO, and other styles
3

Miyazawa, Flavio K., and Andre L. Vignatti. "Distributed selfish bin packing." In Distributed Processing (IPDPS). IEEE, 2009. http://dx.doi.org/10.1109/ipdps.2009.5160881.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Liu, Mozhengfu, and Xueyan Tang. "Dynamic Bin Packing with Predictions." In SIGMETRICS '23: ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems. ACM, 2023. http://dx.doi.org/10.1145/3578338.3593538.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bozejko, Wojciech, Lukasz Kacprzak, and Mieczyslaw Wodecki. "Parallel packing procedure for three dimensional bin packing problem." In 2015 20th International Conference on Methods and Models in Automation and Robotics (MMAR ). IEEE, 2015. http://dx.doi.org/10.1109/mmar.2015.7284036.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Hasan, Jasim, Jihene Kaabi, and Youssef Harrath. "Multi-objective 3D bin-packing problem." In 2019 8th International Conference on Modeling Simulation and Applied Optimization (ICMSAO). IEEE, 2019. http://dx.doi.org/10.1109/icmsao.2019.8880442.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Eisenbrand, Friedrich, Dömötör Pálvölgyi, and Thomas Rothvoß. "Bin Packing via Discrepancy of Permutations." In Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2011. http://dx.doi.org/10.1137/1.9781611973082.38.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Bansal, Nikhil, Marek Eliáš, and Arindam Khan. "Improved Approximation for Vector Bin Packing." In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2015. http://dx.doi.org/10.1137/1.9781611974331.ch106.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gupta, Varun, and Ana Radovanovic. "Lagrangian-based Online Stochastic Bin Packing." In SIGMETRICS '15: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. ACM, 2015. http://dx.doi.org/10.1145/2745844.2745897.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Balslev, Ivar, and Ren‰ D. Eriksen. "From belt picking to bin packing." In Optomechatronic Systems III, edited by Toru Yoshizawa. SPIE, 2002. http://dx.doi.org/10.1117/12.467380.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Bin packing"

1

Gaver, Donald P., and Patricia A. Jacobs. Asymptotic Properties of Stochastic Greedy Bin-Packing. Defense Technical Information Center, 1993. http://dx.doi.org/10.21236/ada273378.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

ศิวรังสรรค์, นภา. การผลิต wavelengthgt 11 DNA และ In vitro packaging mixes เพื่อใช้ในงานพันธุวิศวกรรม. จุฬาลงกรณ์มหาวิทยาลัย, 1993. https://doi.org/10.58837/chula.res.1993.17.

Full text
Abstract:
งานวิจัยนี้มีจุดประสงค์ที่จะผลิต lambda gt 11 DNA จากเชื้อ E. coli BNN 97 โดยการเหนี่ยวนำให้เชื้อเกิด lysis ที่อุณหภูมิ 45 C จากนั้นนำ Bacteriophage lambda gt 11 มาบุกรุกเซลล์ให้อาศัย E. coli Y 1088 จะสามารถขยายจำนวน Bacteriophage ให้มากขึ้นก่อนที่จะทำการแยก lambda gt 11 DNA แบบเสกลเล็ก (Requena 1993) และแบบขยายส่วน (Maniatis 1982) ปริมาณ lambda gt 11 DNA ที่แยกได้จากแต่ละวิธีขึ้นอยู่กับจำนวน pfu ของ lambda gt 11 ที่ใช้ในการบุกรุกเซลล์ให้อาศัย ผลการทดลองพบว่า เมื่อใช้ lambda gt 11 จำนวน 5 x 10[superscript 5] pfu บุกรุกเซลล์ให้อาศัย จะสามารถแยก lambda gt 11 DNA แบบเสกลเล็กได้ทั้งหมดเท่ากับ 7.93
APA, Harvard, Vancouver, ISO, and other styles
3

van den Oever, Martien, Karin Molenveld, Maarten van der Zee, and Harriëtte Bos. Bio-based and biodegradable plastics : facts and figures : focus on food packaging in the Netherlands. Wageningen Food & Biobased Research, 2017. http://dx.doi.org/10.18174/408350.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Petrausch, Julius, Daniel Klein, Johannes Zimmer, and Markus Stommel. On the cryo-molding process and subsequent forming processes of biopolymers with low glass transition temperature. Universidad de los Andes, 2024. https://doi.org/10.51573/andes.pps39.ss.bbb.10.

Full text
Abstract:
Bio-based as well as biodegradable polymers are increasingly finding their way into applications such as food packaging. Here, certain biopolymers with a high degree of crystallinity may be of interest due to their superior barrier properties. Conversely, forming processes including high deformations often require an almost amorphous material state to avoid the brittle behavior associated with crystal structures. For some of those biopolymers, the narrow window in which they can be processed has delayed their potential use for packaging applications. In rigid packaging, two-step processes are
APA, Harvard, Vancouver, ISO, and other styles
5

Garcia Aramendiz, Johan Sebastián, Leonardo Forero Varela, and Jorge Alberto Medina Perilla. Evaluation of the effect of cellulose nanofibers in thermoplastic starch films. Universidad de los Andes, 2024. https://doi.org/10.51573/andes.pps39.ss.bbb.9.

Full text
Abstract:
Thermoplastic starches (TPS) are important bio-based, biodegradable polymers used in flexible packaging. However, their mechanical properties, processability, and high hydrophilicity limit their applications. This study examines the effects of chemical modifications and mechanical reinforcements on TPS matrices. Combinations of native and acetylated TPS, reinforced with native (CNF) and acetylated cellulose nanofibers (CNFA) at 1%, 2%, 3%, and 10%, were analyzed. TPS films were prepared with CNF using compression molding, followed by structural, morphological, mechanical, and hygroscopic analy
APA, Harvard, Vancouver, ISO, and other styles
6

Wexler, Margaret, Alice Di Pasquale, and Hannah Moody. PFAS (perfluoroalkyl and polyfluoroalkyl substances) and breast cancer. Breast Cancer UK, 2024. https://doi.org/10.71450/42501116.

Full text
Abstract:
PFAS comprise a large class of synthetic compounds that contain carbon-fluorine bonds. They have heat-resistant, non-stick and water-repellent properties and are used widely in food packaging, textiles, non-stick cookware, cosmetics and fire-fighting foam. They degrade very slowly and are distributed globally. PFAS are found in body fluids and tissues, for example, blood, breast milk and placenta. They are associated with many health problems, including cancer, and may increase breast cancer risk. Animal studies have shown that PFAS exposure may increase the risk of mammary tumours, and in ute
APA, Harvard, Vancouver, ISO, and other styles
7

Staples, P. Details of the analysis algorithms provided for the implementation of the packaging program at the BN-350 reactor, MAEC, AKTAU, Kasakhstan. Office of Scientific and Technical Information (OSTI), 1999. http://dx.doi.org/10.2172/334289.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Rahimipour, Shai, and David Donovan. Renewable, long-term, antimicrobial surface treatments through dopamine-mediated binding of peptidoglycan hydrolases. United States Department of Agriculture, 2012. http://dx.doi.org/10.32747/2012.7597930.bard.

Full text
Abstract:
There is a need for renewable antimicrobial surface treatments that are semi- permanent, can eradicate both biofilms and planktonic pathogens over long periods of time and that do not select for resistant strains. This proposal describes a dopamine binding technology that is inexpensive, bio-friendly, non-toxic, and uses straight-forward commercially available products. The antimicrobial agents are peptidoglycanhydrolase enzymes that are non-toxic and highly refractory to resistance development. The goal of this project is to create a treatment that will be applicable to a wide variety of surf
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bin packing' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography