An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs

DOI10.1016/j.ejor.2021.10.011zbMath1495.90165OpenAlexW3206518727MaRDI QIDQ2670556

Qian Hu, Andrew E. B. Lim, Ting Wang

Publication date: 11 March 2022

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2021.10.011

zbMATH Keywords

packinggeneral costsbranch-and-price-and-cuttwo-dimensional vector packing problemvolumetric weight

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (1)

Lower and upper bounding procedures for the bin packing problem with concave loading cost

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• There is no asymptotic PTAS for two-dimensional vector packing
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• Bin packing and related problems: general arc-flow formulation with graph compression
• Consistent neighborhood search for one-dimensional bin packing and two-dimensional vector packing
• Stabilized branch-and-price algorithms for vector packing problems
• An asymptotic approximation scheme for the concave cost bin packing problem
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• Local search algorithms for the bin packing problem and their relationships to various construction heuristics
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• A branch-and-price algorithm for the two-dimensional vector packing problem
• A two-dimensional vector packing model for the efficient use of coil cassettes
• Improved branch-cut-and-price for capacitated vehicle routing
• Bin packing with general cost structures
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• 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: An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs