Journals in DBLP

Computers & OR
2007, volume: 34, number: 4

1. Christopher Head, Sami Shaban
   A heuristic approach to simultaneous course/student timetabling. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:919-933 [Journal]
   
2. Jose Gutiérrez, Antonio Sedeño-Noda, Marcos Colebrook, Joaquin Sicilia
   A polynomial algorithm for the production/ordering planning problem with limited storage. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:934-937 [Journal]
   
3. Ramón Companys, Manuel Mateo
   Different behaviour of a double branch-and-bound algorithm on Fm|prmu|C_max and Fm|block|C_max problems. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:938-953 [Journal]
   
4. Wade D. Cook, Boaz Golany, Michal Penn, Tal Raviv
   Creating a consensus ranking of proposals from reviewers' partial ordinal rankings. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:954-965 [Journal]
   
5. Der-Chiang Li, Chih-Sen Wu, Tung-I. Tsai, Yao-San Lina
   Using mega-trend-diffusion and artificial samples in small data set learning for early flexible manufacturing system scheduling knowledge. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:966-982 [Journal]
   
6. Jesus R. Artalejo, Antonis Economou, Antonio Gómez-Corral
   Applications of maximum queue lengths to call center management. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:983-996 [Journal]
   
7. Tommy Thomadsen, Thomas Stidsen
   The generalized fixed-charge network design problem. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:997-1007 [Journal]
   
8. Jing-Quan Li, Denis Borenstein, Pitu B. Mirchandani
   A decision support system for the single-depot vehicle rescheduling problem. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:1008-1032 [Journal]
   
9. Ammar Oulamara
   Makespan minimization in a no-wait flow shop problem with two batching machines. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2007, v:34, n:4, pp:1033-1050 [Journal]
   
10. Marc-André Carle, Jacques Renaud, Angel Ruiz
    Fast and efficient methods for industrial floor assembly. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1051-1060 [Journal]
    
11. Thierry Mautor, Edith Naudin
    Arcs-states models for the vehicle routing problem with time windows and related problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1061-1084 [Journal]
    
12. Günes Erdogan, Barbaros Tansel
    A branch-and-cut algorithm for quadratic assignment problems based on linearizations. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1085-1106 [Journal]
    
13. Yaodong Cui
    An exact algorithm for generating homogenous T-shape cutting patterns. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1107-1120 [Journal]
    
14. Gábor Maróti, Leo G. Kroon
    Maintenance routing for train units: The interchange model. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1121-1140 [Journal]
    
15. Margarida Corte-Real, Luís Gouveia
    Network flow models for the local access network expansion problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1141-1157 [Journal]
    
16. Ibrahim Akgün, Barbaros Ç. Tansel
    Optimization of transportation requirements in the deployment of military units. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1158-1176 [Journal]
    
17. Alberto Fernández, Sergio Gómez
    Portfolio selection using neural networks. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1177-1191 [Journal]
    
18. Dogan A. Serel
    Capacity reservation under supply uncertainty. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1192-1220 [Journal]
    
19. Guy Desaulniers
    Managing large fixed costs in vehicle routing and crew scheduling problems solved by column generation. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2007, v:34, n:4, pp:1221-1239 [Journal]