Two dimensional knapsack with unloading constraints

DOI10.1016/J.ENDM.2011.05.046zbMATH Open1268.90074OpenAlexW1965730446MaRDI QIDQ2840720FDOQ2840720

Jefferson L. M. da Silveira, Eduardo C. 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

Recommendations

• A note on a two dimensional knapsack problem with unloading constraints
• Two dimensional strip packing with unloading constraints
• Two-dimensional strip packing with unloading constraints
• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• Heuristics for the strip packing problem with unloading constraints

zbMATH Keywords

approximation algorithmsknapsack problemunloading/loading constraints

Mathematics Subject Classification ID

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

Cites Work

• A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
• Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A Polynomial Time Approximation Scheme for the Square Packing Problem
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Queue-constrained packing: a vehicle ferry case study
• An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem

This page was built for publication: Two dimensional knapsack with unloading constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840720)