An algorithm for the two-dimensional assortment problem
| Year of publication: |
1985
|
|---|---|
| Authors: | Beasley, J. E. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 19.1985, 2, p. 253-261
|
| Subject: | Heuristik | Unternehmensforschung | Lagerhaltungsproblem | Produkt | Sortiment | Algorithmus | Algorithm | Theorie | Theory | Packproblem | Packing problem | Heuristics | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming |
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
-
A branch-and-price algorithm for the two-dimensional level strip packing problem
Bettinelli, Andrea, (2008)
-
Dynamic reduction heuristics for the rectangle packing area minimization problem
He, Kun, (2015)
- More ...
-
An algorithm for solving large capacitated warehouse location problems
Beasley, John E., (1988)
-
An exact two-dimensional non-guillotine cutting tree search procedure
Beasley, John E., (1985)
-
An optimal algorithm for variable knockout problems
Beasley, John E., (2024)
- More ...