A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority

DOI10.1111/itor.12740OpenAlexW2982343354WikidataQ126975222 ScholiaQ126975222MaRDI QIDQ6092554

Charly Lersteau, Trung Thanh Nguyen, Unnamed Author

Publication date: 23 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12740

zbMATH Keywords

linear programmingpackingheuristiccontainer loading problemmultiple heterogeneous knapsack problemphysical Internet

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

An efficient method for the three-dimensional container loading problem by forming box sizes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• The load-balanced multi-dimensional bin-packing problem
• Three-dimensional container loading models with cargo stability and load bearing constraints
• A typology of cutting and packing problems
• Constraints in container loading -- a state-of-the-art review
• Approximation and online algorithms for multidimensional bin packing: a survey
• An improved typology of cutting and packing problems
• A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
• A comparative review of 3D container loading algorithms
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

This page was built for publication: A mixed‐integer linear model for the multiple heterogeneous knapsack problem with realistic container loading constraints and bins' priority