A branch-and-price algorithm for the two-dimensional vector packing problem

DOI10.1016/J.EJOR.2019.08.024MaRDI QIDQ2329474zbMATH OpenOpenAlexWikidataFDO

Authors Lijun Wei, Minghui Lai, Andrew Lim, Qian Hu

Publication date 17 October 2019

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

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

zbMATH Keywords

exact algorithmpackingbranch-and-pricetwo-dimensional vector packing problem

Mathematics Subject Classification ID

Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
• Stabilized branch-and-price algorithms for vector packing problems
• Lower bounds and algorithms for the 2-dimensional vector packing problem

Cites work

• A branch-and-bound algorithm for the two-dimensional vector packing problem
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• A branch-and-price algorithm for the bin packing problem with conflicts
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• A set-covering-based heuristic approach for bin-packing problems
• A single machine scheduling problem with two-dimensional vector packing constraints
• A two-dimensional vector packing model for the efficient use of coil cassettes
• An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• 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
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• Selected Topics in Column Generation
• Stabilized branch-and-price algorithms for vector packing problems
• There is no asymptotic PTAS for two-dimensional vector packing
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem

Cited in

(13)

• Solving bin packing problems using VRPSolver models
• An improved approximation for packing big two-bar charts
• Stabilized branch-and-price algorithms for vector packing problems
• Lower bounds and algorithms for the 2-dimensional vector packing problem
• A branch-and-price algorithm for the bin packing problem with conflicts
• Lower and upper bounding procedures for the bin packing problem with concave loading cost
• The Co-Printing Problem: A Packing Problem with a Color Constraint
• Two-bar charts packing problem
• A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function
• A branch-and-bound algorithm for the two-dimensional vector packing problem
• An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
• Algorithms for the bin packing problem with scenarios
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows

This page was built for publication: A branch-and-price algorithm for the two-dimensional vector packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329474)