A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
type: Item
instance of: scholarly article
title: A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
zbMATH Open document ID: 1402.90149
author: Qian Hu
author: Wenbin Zhu
author: Hu Qin
author: Andrew Lim
published in: European Journal of Operational Research
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6875752
zbMATH Keywords: packing
zbMATH Keywords: 2D vector packing
zbMATH Keywords: piecewise linear cost function
zbMATH Keywords: branch-and-price
zbMATH Keywords: column generation
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.12.021
OpenAlex ID: W2564312101
cites work: Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
cites work: Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
cites work: A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
cites work: Lower bounds and algorithms for the 2-dimensional vector packing problem
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
cites work: A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
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 typology of cutting and packing problems
cites work: A branch-and-price algorithm for the bin packing problem with conflicts
cites work: Bin packing with general cost structures
cites work: Guided local search for the three-dimensional bin-packing problem
cites work: Algorithms for the bin packing problem with conflicts
cites work: Heuristics for the variable sized bin-packing problem
cites work: An asymptotic approximation scheme for the concave cost bin packing problem
cites work: Bin‐packing problem with concave costs of bin utilization
cites work: Solving the one-dimensional bin packing problem with a weight annealing heuristic
cites work: The Three-Dimensional Bin Packing Problem
cites work: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
cites work: A branch-and-bound algorithm for the two-dimensional vector packing problem
cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem
cites work: Solving binary cutting stock problems by column generation and branch- and-bound
cites work: Computational study of a column generation algorithm for bin packing and cutting stock problems
cites work: An exact algorithm for IP column generation
DOI: 10.1016/J.EJOR.2016.12.021
description: scientific article; zbMATH DE number 6875752