„Bin-Packing-Problem“

Suchergebnisse

115 Treffer

• A tale of two packing problems – improved algorithms and tighter bounds for online bin packing and the geometric knapsack problem
  Heydrich, Sandy ; Stee, Rob ˜vanœ 2018 Saarländische Universitäts- und Landesbibliothek
• Die Berücksichtigung von Reststücken in unterschiedlichen Modellierungsansätzen für das Cutting Stock Problem
  Lange, Matthias 2008 GRIN Verlag
• Retraction Note: An improved nature inspired meta-heuristic algorithm for 1-D bin packing problems
  Abdel-Basset, Mohamed ; Manogaran, Gunasekaran ; Abdel-Fatah, Laila ; Mirjalili, Seyedali
• Correction to: A hierarchical hyper-heuristic for the bin packing problem
  Guerriero, Francesca ; Saccomanno, Francesco Paolo
• Heuristic approaches and integer linear programming formulations for temporal bin packing problems
  Martinovic, John 2025
• Digitized counterdiabatic quantum optimization for bin packing problem
  Xu, Ruoqian ; Romero, Sebastián V. ; Tang, Jialiang ; Ban, Yue ; Chen, Xi
• Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
  Grüttemeier, Niels ; Morawietz, Nils ; Sommer, Frank 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• A General Bin Packing Game: Interest Taken into Account
  Wang, Zhenbo ; Han, Xin ; Dósa, György ; Tuza, Zsolt
• Improved Approximations for Translational Packing of Convex Polygons
  Kurpisz, Adam ; Suter, Silvan 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Near-Optimal Algorithms for Stochastic Online Bin Packing
  Ayyadevara, Nikhil ^* ; Dabas, Rajni ; Khan, Arindam ; Sreenivas, K. V. N. 2022 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Diffusion Limits in the Online Subsequence Selection Problems
  Gnedin, Alexander ; Seksenbayev, Amirlan 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Solving packing problems with few small items using rainbow matchings
  Bannach, Max ; Berndt, Sebastian ; Maack, Marten ; Mnich, Matthias ; Lassota, Alexandra ; Rau, Malin ; Skambath, Malte 2020 Universitätsbibliothek der Technischen Universität Hamburg-Harburg
• A Simple PTAS for the Dual Bin Packing Problem and Advice Complexity of Its Online Version
  Borodin, Allan ; Pankratov, Denis ; Salehi-Abari, Amirali 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications
  Munien, Chanaleä ; Ezugwu, Absalom E.
• Model and algorithm for container ship stowage planning based on bin-packing problem
  Wei-ying, Zhang ; Yan, Lin ; Zhuo-shang, Ji
• A new approach for bin packing problem using knowledge reuse and improved heuristic
  Fang, Jie ; Chen, Xubing ; Rao, Yunqing ; Peng, Yili ; Yan, kuan
• An adaptative multi-objective scatter search for solving the dynamic bin packing problem
  Aïder, Méziane ; Boulebene, Sabrin ; Hifi, Mhand
• Fast neighborhood search heuristics for the colored bin packing problem
  Silva, Renan F. F. da ; Borges, Yulle G. F. ; Schouery, Rafael C. S.
• Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
  Frenk, J. B. G. ; Galambos, G.
• A Metaheuristic Approach for a Two-dimensional Fuzzy Version of the Variable Size and Cost Bin Packing Problem
  Franklin, Jorge Herrera ; Rosete, Alejandro ; Sosa-Gómez, Guillermo ; Rojas, Omar