Two Dimensional Knapsack with Unloading Constraints

DOI10.1016/j.endm.2011.05.046zbMath1268.90074OpenAlexW1965730446MaRDI QIDQ2840720

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

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.046

zbMATH Keywords

knapsack problemapproximation algorithmsunloading/loading constraints

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (2)

Queue-constrained packing: a vehicle ferry case study ⋮ An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem

Cites Work

• Unnamed Item
• A Polynomial Time Approximation Scheme for the Square Packing Problem
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints

This page was built for publication: Two Dimensional Knapsack with Unloading Constraints