A prototype column generation strategy for the multiple container loading problem
type: Item
instance of: scholarly article
title: A prototype column generation strategy for the multiple container loading problem
zbMATH Open document ID: 1253.90014
author: Wenbin Zhu
author: Weili Huang
author: Andrew Lim
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6119550
zbMATH Keywords: packing
zbMATH Keywords: column generation
zbMATH Keywords: heuristic
zbMATH Keywords: multiple container loading problem
describes a project that uses: Ts2pack
describes a project that uses: Packlib2
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.05.039
OpenAlex ID: W2004466487
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Loading Multiple Pallets
cites work: Column Generation Approaches to a Robust Airline Crew Pairing Model For Managing Extra Flights
cites work: The multiple container loading cost minimization problem
cites work: Extreme point-based heuristics for three-dimensional bin packing
cites work: TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
cites work: Decomposition Principle for Linear Programs
cites work: A Column Generation Approach to the Urban Transit Crew Scheduling Problem
cites work: Routing with time windows by column generation
cites work: Solving container loading problems by block arrangement
cites work: A bottleneck assignment approach to the multiple container loading problem
cites work: A tree search algorithm for solving the container loading problem
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
cites work: A suggested computation for maximal multi-commodity network flows
cites work: A Parallel Genetic Algorithm for Solving the Container Loading Problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Heuristic algorithms for the three-dimensional bin packing problem
cites work: Selected Topics in Column Generation
cites work: A parallel hybrid local search algorithm for the container loading problem
cites work: The Three-Dimensional Bin Packing Problem
cites work: Neighborhood structures for the container loading problem: a VNS implementation
cites work: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
cites work: A maximal-space algorithm for the container loading problem
cites work: The two-dimensional bin packing problem with variable bin sizes and costs
cites work: An efficient approach for the multi-pallet loading problem
cites work: An improved typology of cutting and packing problems
cites work: A new iterative-doubling greedy-lookahead algorithm for the single container loading problem
DOI: 10.1016/J.EJOR.2012.05.039
Recommended article: A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem
Recommended article: A bottleneck assignment approach to the multiple container loading problem
Recommended article: A heuristic for multiple container loading problems
Recommended article: Q4310695
Recommended article: Column generation based primal heuristics for routing and loading problems
Recommended article: A multi-start random constructive heuristic for the container loading problem
Recommended article: A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
Recommended article: A novel hybrid tabu search approach to container loading
description: scientific article; zbMATH DE number 6119550