Bidimensional Packing by Bilinear Programming
From MaRDI portal
Recommendations
- Bidimensional packing by bilinear programming
- Two-dimensional bin packing problems
- scientific article; zbMATH DE number 4195184
- On Multidimensional Packing Problems
- Two-Dimensional Finite Bin-Packing Algorithms
- Multidimensional Bin Packing Algorithms
- Approximation schemes for multidimensional packing
- scientific article; zbMATH DE number 1305407
- A semidefinite programming hierarchy for packing problems in discrete geometry
Cited in
(14)- Bidimensional packing by bilinear programming
- Inverse convex programming and parallelepiped packing
- Symmetry-breaking constraints for packing identical rectangles within polyhedra
- Convexification of bilinear forms through non-symmetric lifting
- A branch-and-cut algorithm for mixed-integer bilinear programming
- A new constraint programming approach for the orthogonal packing problem
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- A new lower bound for the non-oriented two-dimensional bin-packing problem
- A new exact method for the two-dimensional orthogonal packing problem
- A computational study of lower bounds for the two dimensional bin packing problem
- Prospective network flow models and algorithms for bin packing problems
- A space-indexed formulation of packing boxes into a larger box
- The b‐bibranching problem: TDI system, packing, and discrete convexity
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
This page was built for publication: Bidimensional Packing by Bilinear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596354)
