Weighted quantum genetic algorithm for one-dimensional bin packing problem

DOI10.1007/S11128-025-04893-5MaRDI QIDQ6922805zbMATH OpenFDO

Authors Thae-Gyong Han, Nam-Chol Kim, Myong-Chol Ko, Ju-Song Ryom, Su-Ryon Ri

Publication date 30 September 2025

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-025-04893-5

zbMATH Keywords

bin packing problemweighted quantum genetic algorithm

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites work

• A Linear Programming Approach to the Cutting-Stock Problem
• An improved typology of cutting and packing problems
• Branching in branch-and-price: A generic scheme
• Can quantum genetic algorithm really improve quantum backpropagation neural network?
• Handbooks in operations Research \& management science: Transportation
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• LP models for bin packing and cutting stock problems
• Routing and wavelength assignment in optical networks using bin packing based algorithms
• The bin packing problem with precedence constraints
• Using extra dual cuts to accelerate column generation
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Weighted quantum genetic algorithm for one-dimensional bin packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6922805)