Relevant bibliographies by topics / Bin-Packing-Problem

Contents

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

Academic literature on the topic 'Bin-Packing-Problem'

Author: Grafiati
Published: 4 June 2021
Last updated: 26 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-Problem.'

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-Problem"

1

Kim, Jong-Kyou, H. Lee-Kwang, and Seung W. Yoo. "Fuzzy bin packing problem." Fuzzy Sets and Systems 120, no. 3 (2001): 429–34. http://dx.doi.org/10.1016/s0165-0114(99)00073-1.

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

Baldi, Mauro Maria, Teodor Gabriel Crainic, Guido Perboli, and Roberto Tadei. "The generalized bin packing problem." Transportation Research Part E: Logistics and Transportation Review 48, no. 6 (2012): 1205–20. http://dx.doi.org/10.1016/j.tre.2012.06.005.

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

BUJTÁS, CSILLA, GYÖRGY DÓSA, CSANÁD IMREH, JUDIT NAGY-GYÖRGY, and ZSOLT TUZA. "THE GRAPH-BIN PACKING PROBLEM." International Journal of Foundations of Computer Science 22, no. 08 (2011): 1971–93. http://dx.doi.org/10.1142/s012905411100915x.

Full text
Abstract:
We deal with a very general problem: a given graph G is to be "packed" into a host graph H, and we are asked about some natural optimization questions concerning this packing. The problem has never been investigated before in this general form. The input of the problem is a simple graph G = (V, E) with lower and upper bounds on its edges and weights on its vertices. The vertices correspond to items which have to be packed into the vertices (bins) of a host graph, such that each host vertex can accommodate at most L weight in total, and if two items are adjacent in G, then the distance of their
APA, Harvard, Vancouver, ISO, and other styles
4

Bódis, Attila, and János Balogh. "Bin packing problem with scenarios." Central European Journal of Operations Research 27, no. 2 (2018): 377–95. http://dx.doi.org/10.1007/s10100-018-0574-3.

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

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
6

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
7

Wu, Yong, Wenkai Li, Mark Goh, and Robert de Souza. "Three-dimensional bin packing problem with variable bin height." European Journal of Operational Research 202, no. 2 (2010): 347–55. http://dx.doi.org/10.1016/j.ejor.2009.05.040.

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

Li, Chung-Lun, and Zhi-Long Chen. "Bin-packing problem with concave costs of bin utilization." Naval Research Logistics 53, no. 4 (2006): 298–308. http://dx.doi.org/10.1002/nav.20142.

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

Zehmakan, AbdolahadNoori. "Bin Packing Problem: Two Approximation Algorithms." International Journal in Foundations of Computer Science & Technology 5, no. 4 (2015): 01–11. http://dx.doi.org/10.5121/ijfcst.2015.5401.

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

Martello, Silvano, David Pisinger, and Daniele Vigo. "The Three-Dimensional Bin Packing Problem." Operations Research 48, no. 2 (2000): 256–67. http://dx.doi.org/10.1287/opre.48.2.256.12386.

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

Dissertations / Theses on the topic "Bin-Packing-Problem"

1

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
2

Pietrobuoni, Enrico <1986&gt. "Two-Dimensional Bin Packing Problem with Guillotine Restrictions." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amsdottorato.unibo.it/6810/1/PhD_Pietrobuoni.pdf.

Full text
Abstract:
This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluate
APA, Harvard, Vancouver, ISO, and other styles
3

Pietrobuoni, Enrico <1986&gt. "Two-Dimensional Bin Packing Problem with Guillotine Restrictions." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2015. http://amsdottorato.unibo.it/6810/.

Full text
Abstract:
This thesis, after presenting recent advances obtained for the two-dimensional bin packing problem, focuses on the case where guillotine restrictions are imposed. A mathematical characterization of non-guillotine patterns is provided and the relation between the solution value of the two-dimensional problem with guillotine restrictions and the two-dimensional problem unrestricted is being studied from a worst-case perspective. Finally it presents a new heuristic algorithm, for the two-dimensional problem with guillotine restrictions, based on partial enumeration, and computationally evaluate
APA, Harvard, Vancouver, ISO, and other styles
4

Ongkunaruk, Pornthipa. "Asymptotic Worst-Case Analyses for the Open Bin Packing Problem." Diss., Virginia Tech, 2005. http://hdl.handle.net/10919/30105.

Full text
Abstract:
The open bin packing problem (OBPP) is a new variant of the well-known bin packing problem. In the OBPP, items are packed into bins so that the total content before the last item in each bin is strictly less than the bin capacity. The objective is to minimize the number of bins used. The applications of the OBPP can be found in the subway station systems in Hong Kong and Taipei and the scheduling in manufacturing industries. We show that the OBPP is NP-hard and propose two heuristic algorithms instead of solving the problem to optimality. We propose two offline algorithms in which the informat
APA, Harvard, Vancouver, ISO, and other styles
5

Qiao, Wenxin. "An algorithm for crew scheduling problem with bin packing features." College Park, Md.: University of Maryland, 2008. http://hdl.handle.net/1903/8818.

Full text
Abstract:
Thesis (M.S.) -- University of Maryland, College Park, 2008.<br>Thesis research directed by: Dept. of Civil and Environmental Engineering . Title from t.p. of PDF. Includes bibliographical references. Published by UMI Dissertation Services, Ann Arbor, Mich. Also available in paper.
APA, Harvard, Vancouver, ISO, and other styles
6

Ancora, Gabriele <1993&gt. "The three-dimensional single-bin-size bin packing problem: combining metaheuristic and machine learning approaches." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2022. http://amsdottorato.unibo.it/10476/1/tesiFrontespizioOK.pdf.

Full text
Abstract:
The Three-Dimensional Single-Bin-Size Bin Packing Problem is one of the most studied problem in the Cutting & Packing category. From a strictly mathematical point of view, it consists of packing a finite set of strongly heterogeneous “small” boxes, called items, into a finite set of identical “large” rectangles, called bins, minimizing the unused volume and requiring that the items are packed without overlapping. The great interest is mainly due to the number of real-world applications in which it arises, such as pallet and container loading, cutting objects out of a piece of material and pack
APA, Harvard, Vancouver, ISO, and other styles
7

ALVIM, ADRIANA CESARIO DE FARIA. "A HYBRID IMPROVEMENT HEURISTICS FOR THE BIN PACKING PROBLEM AND ITS APPLICATION TO THE PROBLEM OF TASK SCHEDULING." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2003. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4364@1.

Full text
Abstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>A principal contribuição desta tese consiste no desenvolvimento de uma heurística híbrida, robusta e eficiente, para o problema de empacotamento unidimensional. A heurística proposta utiliza os seguintes componentes: limites inferiores e superiores do número de caixas; reduções; abordagem dual para a obtenção de soluções iniciais; heurísticas para redistribuição dos pesos; e busca tabu. O outro objetivo desta tese é a aplicação desta heurística para a solução do problema de escalonamento em processadores paralelos idênti
APA, Harvard, Vancouver, ISO, and other styles
8

Sannia, Giacomo. "Ottimizzazione di un sistema di pallettizzazione. Il caso IRSAP." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020.

Find full text
Abstract:
Il processo di pallettizzazione dei prodotti all'interno delle realtà industriali è stato riconosciuto negli ultimi decenni come un valore aggiunto se ottimizzato al meglio. Più i prodotti sono disposti in modo ordinato e stabile sui bancali, più la saturazione volumetrica cresce e ciò che ne consegue è una riduzione del numero di pallet totali necessari. Allo stesso tempo ottimizzare il processo di pallettizzazione coinvolge anche l'aspetto dei tempi richiesti da tutte le operazioni collegate; spesso molte realtà industriali presentano sprechi e attività non necessarie che allungano inutilmen
APA, Harvard, Vancouver, ISO, and other styles
9

Heydrich, Sandy [Verfasser], and Rob van [Akademischer Betreuer] Stee. "A tale of two packing problems : improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem / Sandy Heydrich ; Betreuer: Rob van Stee." Saarbrücken : Saarländische Universitäts- und Landesbibliothek, 2018. http://d-nb.info/1164012193/34.

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

Tuenter, Hans J. H. "Worst-case bounds for bin-packing heuristics with applications to the duality gap of the one-dimensional cutting stock problem." Thesis, University of Birmingham, 1997. http://etheses.bham.ac.uk//id/eprint/266/.

Full text
Abstract:
The thesis considers the one-dimensional cutting stock problem, the bin-packing problem, and their relationship. The duality gap of the former is investigated and a characterisation of a class of cutting stock problems with the next round-up property is given. It is shown that worst-case bounds for bin-packing heuristics can be and are best expressed in terms of the linear programming relaxation of the corresponding cutting stock problem. The concept of recurrency is introduced for a bin-packing heuristic, which allows a more natural derivation of a measure for the worst-case behaviour. The id
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Bin-Packing-Problem"

1

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
2

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
3

Kanna, Rajesh, and Jaisree AD. Genetic Algorithm for Bin Packing Problem. Independently Published, 2016.

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

Book chapters on the topic "Bin-Packing-Problem"

1

Boyar, Joan, Leah Epstein, Lene M. Favrholdt, et al. "The Maximum Resource Bin Packing Problem." In Fundamentals of Computation Theory. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11537311_35.

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

Jiang, Qianpan. "Analysis of the bin packing problem." In Advances in Energy Science and Equipment Engineering II. CRC Press, 2017. http://dx.doi.org/10.1201/9781315116174-105.

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

Seiden, Steven S. "On the Online Bin Packing Problem." In Automata, Languages and Programming. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-48224-5_20.

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

Zou, Ding, Jiayi Lian, Wei Lu, et al. "An Equally-Split Bin Packing Problem." In Lecture Notes in Computer Science. Springer Nature Singapore, 2025. https://doi.org/10.1007/978-981-96-4445-2_20.

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

Furini, Fabio, and Xueying Shen. "Matheuristics for the Temporal Bin Packing Problem." In Operations Research/Computer Science Interfaces Series. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-58253-5_19.

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

Khuri, Sami, Martin Schütz, and Jörg Heitkötter. "Evolutionary Heuristics for the Bin Packing Problem." In Artificial Neural Nets and Genetic Algorithms. Springer Vienna, 1995. http://dx.doi.org/10.1007/978-3-7091-7535-4_75.

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

Fekete, Sándor P., Jonas Grosse-Holz, Phillip Keldenich, and Arne Schmidt. "Parallel Online Algorithms for the Bin Packing Problem." In Approximation and Online Algorithms. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-39479-0_8.

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

Kamali, Shahin, and Pooya Nikbakht. "On the Fault-Tolerant Online Bin Packing Problem." In Algorithmic Aspects of Cloud Computing. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-93043-1_1.

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

Blum, Christian, Vera Hemmelmayr, Hugo Hernández, and Verena Schmid. "Hybrid Algorithms for the Variable Sized Bin Packing Problem." In Hybrid Metaheuristics. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-16054-7_2.

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

Bożejko, Wojciech, Łukasz Kacprzak, and Mieczysław Wodecki. "Parallel Coevolutionary Algorithm for Three-Dimensional Bin Packing Problem." In Artificial Intelligence and Soft Computing. Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-19324-3_29.

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

Conference papers on the topic "Bin-Packing-Problem"

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

Krisadee, Sarun, and Wattana Jindaluang. "An Improvement of a Heuristic Algorithm for 3D Bin-Packing Problem." In 2024 28th International Computer Science and Engineering Conference (ICSEC). IEEE, 2024. https://doi.org/10.1109/icsec62781.2024.10770638.

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

Ge, Chenglong, Xiangjing Lai, and Yue Li. "An Effective Heuristic Algorithm for the Two-Dimensional Variable-Size Bin Packing Problem with Circular Containers." In 2024 China Automation Congress (CAC). IEEE, 2024. https://doi.org/10.1109/cac63892.2024.10864950.

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

Mhiri, Mariem. "A Mixed-integer Programming Model for the Bin Packing Problem with Piecewise Linear Loading Cost and Time Windows." In 2024 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2024. https://doi.org/10.1109/ieem62345.2024.10857005.

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

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
6

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
7

Saraiva, Rachel, and Rafael Schouery. "Approximation algorithms for the bin packing problem." In Congresso de Iniciação Científica UNICAMP. Universidade Estadual de Campinas, 2019. http://dx.doi.org/10.20396/revpibic2720191943.

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

Krishna, Nistala, Ashwin Krishnan, and Manoj Nambiar. "GPU Implementation: Accelerating 3D-Bin Packing Problem." In AIMLSystems 2023: The Third International Conference on Artificial Intelligence and Machine Learning Systems. ACM, 2023. http://dx.doi.org/10.1145/3639856.3639900.

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

Salma, Mezghani, and Frikha Ahmed. "Three-dimensional bin packing problem with variable bin length Application in industrial storage problem." In 2011 4th International Conference on Logistics (LOGISTIQUA). IEEE, 2011. http://dx.doi.org/10.1109/logistiqua.2011.5939451.

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

Wang, Yanfeng, Weili Lu, and Guangzhao Cui. "DNA Tile Assembly Model for Bin Packing Problem." In 2011 Sixth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA). IEEE, 2011. http://dx.doi.org/10.1109/bic-ta.2011.35.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Bin-Packing-Problem' for particular source types:
Journal articles Dissertations / Theses
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