A note on a two dimensional knapsack problem with unloading constraints

DOI10.1051/ita/2013037zbMath1311.90130OpenAlexW2159351466MaRDI QIDQ5397721

Flávio K. Miyazawa, Eduardo Candido Xavier, Jefferson L. M. da Silveira

Publication date: 24 February 2014

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/5af019e447dac4db2801b0aca307f7daa911d538

zbMATH Keywords

knapsack problemapproximation algorithmsunloading/loading constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems ⋮ Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review

This page was built for publication: A note on a two dimensional knapsack problem with unloading constraints