A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
From MaRDI portal
Publication:1753400
DOI10.1016/j.ejor.2016.12.021zbMath1402.90149OpenAlexW2564312101MaRDI QIDQ1753400
Wenbin Zhu, Qian Hu, Hu Qin, Andrew E. B. Lim
Publication date: 29 May 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.12.021
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (7)
Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Tug scheduling for hinterland barge transport: a branch-and-price approach ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows ⋮ Stabilized branch-and-price algorithms for vector packing problems ⋮ A branch-and-price algorithm for the two-dimensional vector packing problem
Cites Work
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- An asymptotic approximation scheme for the concave cost bin packing problem
- Heuristics for the variable sized bin-packing problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- An exact algorithm for IP column generation
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- A typology of cutting and packing problems
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- TS\(^2\)PACK: A two-level tabu search for the three-dimensional bin packing problem
- Bin packing with general cost structures
- Solving the one-dimensional bin packing problem with a weight annealing heuristic
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Guided Local Search for the Three-Dimensional Bin-Packing Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Algorithms for the Bin Packing Problem with Conflicts
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- Extreme Point-Based Heuristics for Three-Dimensional Bin Packing
- Decomposition Principle for Linear Programs
- An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
- The Three-Dimensional Bin Packing Problem
- Bin‐packing problem with concave costs of bin utilization
- Lower bounds and algorithms for the 2-dimensional vector packing problem
This page was built for publication: A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
