Complexity of fragmentable object bin packing and an application

DOI10.1016/S0898-1221(98)00087-XzbMath0992.90058MaRDI QIDQ1608419

C. A. Mandal, Partha Pratim Chakrabarti, Sujoy Ghose

Publication date: 6 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

complexityschedulinghigh-level synthesisbin packingfragmentable object bin packing problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (9)

Integer optimization with penalized fractional values: the knapsack case ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Exactly solving packing problems with fragmentation ⋮ New formulations for variable cost and size bin packing problems with item fragmentation ⋮ The bin packing problem with item fragmentation: a worst-case analysis ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ Approximation schemes for packing with item fragmentation ⋮ Bin packing with fragmentable items: presentation and approximations ⋮ Bin packing problem with conflicts and item fragmentation

Cites Work

• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of fragmentable object bin packing and an application