The following pages link to Optimal rectangle packing (Q610984):
Displayed 13 items.
- Models and algorithms for packing rectangles into the smallest square (Q342053) (← links)
- Rectangle packing with additional restrictions (Q650936) (← links)
- Logic based Benders' decomposition for orthogonal stock cutting problems (Q1652086) (← links)
- Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
- LP bounds in various constraint programming approaches for orthogonal packing (Q1761178) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- A hybrid metaheuristic for the two-dimensional strip packing problem (Q2069243) (← links)
- Local search with a SAT oracle for combinatorial optimization (Q2233496) (← links)
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container (Q2673561) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- Packing a rectangle with <i>m</i> x <i>(m +</i> 1) rectangles (Q5371047) (← links)
- Probabilistic analysis of shelf algorithms for strip packing (Q5491239) (← links)
- Automatic generation of dominance breaking nogoods for a class of constraint optimization problems (Q6080646) (← links)