The following pages link to (Q3145801):
Displaying 22 items.
- Semi-on-line bin packing: a short overview and a new lower bound (Q301113) (← links)
- Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Lower and upper bounds for the bin packing problem with fragile objects (Q406499) (← links)
- Selfish bin packing (Q534779) (← links)
- Space and time allocation in a shipyard assembly hall (Q610963) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration (Q632667) (← links)
- Station assignment with reallocation (Q666668) (← links)
- Improved lower bounds for semi-online bin packing problems (Q1014344) (← links)
- On dynamic bin packing: An improved lower bound and resource augmentation analysis (Q1014797) (← links)
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times (Q1046715) (← links)
- The optimal absolute ratio for online bin packing (Q1741486) (← links)
- Batched bin packing (Q1779689) (← links)
- New lower bounds for the three-dimensional finite bin packing problem (Q1827849) (← links)
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- Dynamic bin packing of unit fractions items (Q2378533) (← links)
- Approximation and online algorithms for multidimensional bin packing: a survey (Q2400930) (← links)
- Online bin packing of fragile objects with application in cellular networks (Q2426651) (← links)
- On-line bin packing with restricted repacking (Q2436663) (← links)
- Online bin packing with arbitrary release times (Q2474079) (← links)
- Bin Packing with Queues (Q5504150) (← links)
