Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
From MaRDI portal
Publication:2719124
DOI10.1137/S009753979834669XzbMath0980.68056OpenAlexW2045970682WikidataQ57186010 ScholiaQ57186010MaRDI QIDQ2719124
Publication date: 21 June 2001
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s009753979834669x
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Operations research and management science (90B99)
Related Items (15)
Variable neighborhood search for quadratic multiple constraint variable sized bin-packing problem ⋮ Packing items to feed assembly lines ⋮ An improved typology of cutting and packing problems ⋮ Accelerating column generation for variable sized bin-packing problems ⋮ A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Efficient algorithms for the offline variable sized bin-packing problem ⋮ Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items ⋮ A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ Variable neighbourhood search for the variable sized bin packing problem ⋮ An exact algorithm for the type-constrained and variable sized bin packing problem ⋮ A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan ⋮ Heuristics for the variable sized bin-packing problem
This page was built for publication: Variable-Sized Bin Packing: Tight Absolute Worst-Case Performance Ratios for Four Approximation Algorithms
