Pages that link to "Item:Q3596354"
From MaRDI portal
The following pages link to Bidimensional Packing by Bilinear Programming (Q3596354):
Displaying 14 items.
- A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation (Q868985) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Inverse convex programming and parallelepiped packing (Q1364041) (← links)
- Symmetry-breaking constraints for packing identical rectangles within polyhedra (Q1940443) (← links)
- Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
- A branch-and-cut algorithm for mixed-integer bilinear programming (Q2282539) (← links)
- A new constraint programming approach for the orthogonal packing problem (Q2456654) (← links)
- A new exact method for the two-dimensional bin-packing problem with fixed orientation (Q2467477) (← links)
- A new lower bound for the non-oriented two-dimensional bin-packing problem (Q2467479) (← links)
- A new exact method for the two-dimensional orthogonal packing problem (Q2643952) (← links)
- A computational study of lower bounds for the two dimensional bin packing problem (Q2861507) (← links)
- Prospective network flow models and algorithms for bin packing problems (Q2883549) (← links)
- The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)
