Bin packing with divisible item sizes and rejection penalties

DOI10.1007/s11590-021-01803-3zbMath1492.90151OpenAlexW3201278010MaRDI QIDQ2136894

Junran Lichen, Jianping Li, Pengxiang Pan, Lijian Cai, Wencheng Wang

Publication date: 16 May 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01803-3

zbMATH Keywords

combinatorial optimizationbin packingexact combinatorial algorithmsdivisible item sizesrejection penalties

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (1)

Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing with rejection revisited
• A polynomial algorithm for the multiple knapsack problem with divisible item sizes
• Online algorithms. The state of the art
• Bin packing with divisible item sizes
• Bin packing can be solved within 1+epsilon in linear time
• Linear time-approximation algorithms for bin packing
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Bin packing problems with rejection penalties and their dual problems
• The Design of Approximation Algorithms
• AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Bin packing with divisible item sizes and rejection penalties