Journals in DBLP

European Journal of Operational Research
2002, volume: 141, number: 2

1. P. Y. Wang, Gerhard Wäscher
   Cutting and packing. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:239-240 [Journal]
   
2. Andrea Lodi, Silvano Martello, Michele Monaci
   Two-dimensional packing problems: A survey. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:241-252 [Journal]
   
3. José M. Valério de Carvalho
   LP models for bin packing and cutting stock problems. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:253-273 [Journal]
   
4. G. Belov, Guntram Scheithauer
   A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:274-294 [Journal]
   
5. Oliver Holthaus
   Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:295-312 [Journal]
   
6. Eugene J. Zak
   Modeling multistage cutting stock problems. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:313-327 [Journal]
   
7. Michael Armbruster
   A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:328-340 [Journal]
   
8. Yu-Liang Wu, Wenqi Huang, Siu-Chung Lau, C. K. Wong, Gilbert H. Young
   An effective quasi-human based heuristic for solving the rectangle packing problem. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:341-358 [Journal]
   
9. A. Miguel Gomes, José F. Oliveira
   A 2-exchange heuristic for nesting problems. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2002, v:141, n:2, pp:359-370 [Journal]
   
10. Kathryn A. Dowsland, Subodh Vaid, William B. Dowsland
    An algorithm for polygon placement using a bottom-left strategy. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:371-381 [Journal]
    
11. David Pisinger
    Heuristics for the container loading problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:382-392 [Journal]
    
12. Michael Eley
    Solving container loading problems by block arrangement. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:393-409 [Journal]
    
13. Andrea Lodi, Silvano Martello, Daniele Vigo
    Heuristic algorithms for the three-dimensional bin packing problem. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:410-420 [Journal]
    
14. Lauro Lins, Sóstenes Lins, Reinaldo Morabito
    An n-tet graph approach for non-guillotine packings of n-dimensional boxes into an n-container. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:421-439 [Journal]
    
15. Huaiqing Wang, Wenqi Huang, Quan Zhang, Dongming Xu
    An improved algorithm for the packing of unequal circles within a larger containing circle. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:440-453 [Journal]
    
16. Risto Lahdelma, Pekka Salminen
    Pseudo-criteria versus linear utility function in stochastic multi-criteria acceptability analysis. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2002, v:141, n:2, pp:454-469 [Journal]