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 |
-
A fast approximation algorithm for solving the complete set packing problem
Tri-Dung Nguyen, (2014)
-
Combinatorial Benders' cuts for the strip packing problem
Côté, Jean-François, (2014)
-
A genetic algorithm for two-dimensional bin packing with due dates
Bennell, Julia A., (2013)
- More ...
-
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
Lodi, Andrea, (2011)
-
Efficient Two-Dimensional Packing Algorithms for Mobile WiMAX
Lodi, Andrea, (2011)
-
Two-dimensional packing problems: A survey
Lodi, Andrea, (2002)
- More ...