A branch-and-price algorithm for the two-dimensional level strip packing problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1175962 (Why is no real title available?)
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A branch-and-price algorithm for the two-dimensional level strip packing problem
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- A near-optimal solution to a two-dimensional cutting stock problem
- An exact approach to the strip-packing problem
- An optimization algorithm for a penalized knapsack problem
- Column Generation
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Models and bounds for two-dimensional level packing problems
- Recent advances on two-dimensional bin packing problems
- Two exact algorithms for the capacitated p-median problem
- Two-Dimensional Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(11)- An optimization algorithm for a penalized knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- Triple-solution approach for the strip packing problem with two-staged patterns
- 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 level strip packing problem
- The rectangular two-dimensional strip packing problem real-life practical constraints: a bibliometric overview
- Packing squares independently
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- Models and bounds for two-dimensional level packing problems
This page was built for publication: A branch-and-price algorithm for the two-dimensional level strip packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029564)