Editing Bin packing problem (section)

=== Related problems ===
The problem of '''fractional [[Knapsack problem|knapsack]] with penalties''' was introduced by Malaguti, Monaci, Paronuzzi and Pferschy.<ref>{{Cite journal |last1=Malaguti |first1=Enrico |last2=Monaci |first2=Michele |last3=Paronuzzi |first3=Paolo |last4=Pferschy |first4=Ulrich |date=2019-03-16 |title=Integer optimization with penalized fractional values: The Knapsack case |url=https://www.sciencedirect.com/science/article/pii/S0377221718307963 |journal=European Journal of Operational Research |language=en |volume=273 |issue=3 |pages=874–888 |doi=10.1016/j.ejor.2018.09.020 |issn=0377-2217 |s2cid=31722681|hdl=11585/657029 |hdl-access=free }}</ref> They developed an FPTAS and a [[Dynamic programming|dynamic program]] for the problem, and they showed an extensive computational study comparing the performance of their models. See also: [[Fractional job scheduling]].