A branch-and-price algorithm for the two-dimensional vector packing problem
DOI10.1016/J.EJOR.2019.08.024zbMATH Open1430.90425OpenAlexW2968742484WikidataQ127362395 ScholiaQ127362395MaRDI QIDQ2329474FDOQ2329474
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
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
Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Selected Topics in Column Generation
- Exact solution of bin-packing problems using column generation and branch-and-bound
- There is no asymptotic PTAS for two-dimensional vector packing
- A branch-and-bound algorithm for the two-dimensional vector packing problem
- An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing
- A two-dimensional vector packing model for the efficient use of coil cassettes
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A set-covering-based heuristic approach for bin-packing problems
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- Lower bounds and algorithms for the 2-dimensional vector packing problem
- A single machine scheduling problem with two-dimensional vector packing constraints
- 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
- 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
- Stabilized branch-and-price algorithms for vector packing problems
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
- Lower and upper bounding procedures for the bin packing problem with concave loading cost
- A branch-and-price algorithm for the bin packing problem with conflicts
- 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)
