Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
type: Item
instance of: scholarly article
title: Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
author: Oliviana Xavier do Nascimento
author: Thiago Alves de Queiroz
author: Leonardo Junqueira
published in: Computers \& Operations Research
publication date: 2021-05-21T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7350571
zbMATH Keywords: container loading problem
zbMATH Keywords: practical constraints
zbMATH Keywords: integer linear programming
zbMATH Keywords: constraint programming
MaRDI profile type: Publication
full work available at URL: j.cor.2020.105186
OpenAlex ID: W3112629014
cites work: Grids for cutting and packing problems: a study in the 2D knapsack problem
cites work: The three-dimensional knapsack problem with balancing constraints
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: A hybrid genetic algorithm for the container loading problem
cites work: Constraints in container loading -- a state-of-the-art review
cites work: An analytical model for the container loading problem
cites work: A new constraint programming approach for the orthogonal packing problem
cites work: Solving a large multicontainer loading problem in the car manufacturing industry
cites work: Combinatorial Benders' Cuts for the Strip Packing Problem
cites work: An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
cites work: Heuristic approaches for the two- and three-dimensional knapsack packing problem
cites work: Solving container loading problems by block arrangement
cites work: A tree search algorithm for solving the container loading problem
cites work: A MIP approach for some practical packing problems: balancing constraints and tetris-like items
cites work: A Genetic Algorithm for Solving the Container Loading Problem
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study
cites work: A linear programming approach for the three-dimensional bin-packing problem
cites work: MIP-based approaches for the container loading problem with multi-drop constraints
cites work: Three-dimensional container loading models with cargo stability and load bearing constraints
cites work: A novel hybrid tabu search approach to container loading
cites work: A parallel hybrid local search algorithm for the container loading problem
cites work: The Three-Dimensional Bin Packing Problem
cites work: LP bounds in various constraint programming approaches for orthogonal packing
cites work: A mixed integer programming formulation for the three-dimensional bin packing problem deriving from an air cargo application
cites work: Heuristics for the container loading problem
cites work: An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability
cites work: Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
cites work: A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions
cites work: A new load balance methodology for container loading problem in road transportation
cites work: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
cites work: The G4-Heuristic for the Pallet Loading Problem
cites work: Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
cites work: An effective tabu search approach with improved loading algorithms for the 3L-CVRP
cites work: A two-dimensional heuristic decomposition approach to a three-dimensional multiple container loading problem
cites work: A global optimization approach for solving three-dimensional open dimension rectangular packing problems
DOI: 10.1016/J.COR.2020.105186
description: scientific article; zbMATH DE number 7350571