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

DOI10.1007/s11590-022-01969-4MaRDI QIDQ6081604

Junran Lichen, Pengxiang Pan, Jianping Li, Lijian Cai

Publication date: 26 October 2023

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

zbMATH Keywords

combinatorial optimizationknapsack problemcombinatorial algorithmspenaltiesdivisible item sizes

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A polynomial-time algorithm for knapsack with divisible item sizes
• Solving sequential knapsack problems
• Bin packing with rejection revisited
• Online algorithms. The state of the art
• Bin packing with divisible item sizes
• A new fully polynomial time approximation scheme for the Knapsack problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• New exact approaches and approximation results for the penalized knapsack problem
• A faster FPTAS for the unbounded knapsack problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Algorithms for the variable sized bin packing problem
• Bin packing with divisible item sizes and rejection penalties
• An optimization algorithm for a penalized knapsack problem
• 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
• Computing Partitions with Applications to the Knapsack Problem
• An Efficient Algorithm for the 0-1 Knapsack Problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Approximate Algorithms for the 0/1 Knapsack Problem
• Combinatorial optimization. Theory and algorithms.

This page was built for publication: Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties