Efficient two-dimensional packing algorithms for mobile WiMAX
| Year of publication: |
2011
|
|---|---|
| Authors: | Lodi, Andrea ; Martello, Silvano ; Monaci, Michele ; Cicconetti, Claudio ; Lenzini, Luciano |
| Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 57.2011, 12, p. 2130-2144
|
| Subject: | Mobilkommunikation | Mobile communications | Packproblem | Packing problem | Scheduling-Verfahren | Scheduling problem | Operations Research | Operations research |
-
Chance-constrained multiple bin packing problem with an application to operating room planning
Wang, Shanshan, (2021)
-
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
Libralesso, Luc, (2021)
-
Just-in-time two-dimensional bin packing
Polyakovskiy, Sergey, (2021)
- More ...
-
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
Lodi, Andrea, (2011)
-
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
Lodi, Andrea, (2011)
-
Exact algrithms for the two-dimensional guillotine knapsack
Dolatabadi, Mohammad, (2012)
- More ...