Pages that link to "Item:Q1026242"
From MaRDI portal
The following pages link to Hardness of approximation for orthogonal rectangle packing and covering problems (Q1026242):
Displaying 9 items.
- New approximability results for two-dimensional bin packing (Q261358) (← links)
- Packing anchored rectangles (Q276437) (← links)
- A space-indexed formulation of packing boxes into a larger box (Q433833) (← links)
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems (Q1988631) (← links)
- Optimal clustering of a pair of irregular objects (Q2018508) (← links)
- Exploiting Packing Components in General-Purpose Integer Programming Solvers (Q4634979) (← links)
- TWO FOR ONE: TIGHT APPROXIMATION OF 2D BIN PACKING (Q5168419) (← links)
- Tight approximation algorithms for geometric bin packing with skewed items (Q6053472) (← links)
- There is no APTAS for 2-dimensional vector bin packing: revisited (Q6072215) (← links)
