The SCEAS System
Navigation Menu

Journals in DBLP

Computers & OR
2006, volume: 33, number: 12

  1. Gianpaolo Ghiani, Roberto Musmanno
    Recent algorithmic advances for Arc Routing Problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3361-3362 [Journal]
  2. José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins
    Lower and upper bounds for the mixed capacitated arc routing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3363-3383 [Journal]
  3. Angel Corberán, Enrique Mota, José M. Sanchis
    A comparison of two different formulations for arc routing problems on mixed graphs. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3384-3402 [Journal]
  4. Dino Ahr, Gerhard Reinelt
    A tabu search algorithm for the min-max k-Chinese postman problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3403-3422 [Journal]
  5. U. F. Aminu, Richard W. Eglese
    A constraint programming approach to the Chinese postman problem with time windows. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3423-3431 [Journal]
  6. Julián Aráoz, Elena Fernández, Cristina Zoltan
    Privatized rural postman problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3432-3449 [Journal]
  7. Gianpaolo Ghiani, Demetrio Laganà, Roberto Musmanno
    A constructive heuristic for the Undirected Rural Postman Problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3450-3457 [Journal]
  8. Sanne Wøhlk
    New lower bound for the Capacitated Arc Routing Problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3458-3472 [Journal]
  9. Philippe Lacomme, Christian Prins, Marc Sevaux
    A genetic algorithm for a bi-objective capacitated arc routing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3473-3493 [Journal]
  10. Fabien Marzolf, Martin Trépanier, André Langevin
    Road network monitoring: algorithms and a case study. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3494-3507 [Journal]
  11. Richard W. Eglese, Will Maden, Alan Falconer Slater
    A Road TimetableTM to aid vehicle routing and scheduling. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3508-3519 [Journal]
  12. Fernando C. Gomes, Cláudio Nogueira de Meneses, Panos M. Pardalos, Gerardo Valdisio R. Viana
    Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3520-3534 [Journal]
  13. Ernesto G. Birgin, José Mario Martínez, F. H. Nishihara, Débora P. Ronconi
    Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3535-3548 [Journal]
  14. Carlos G. Garcia, Dionisio Pérez-Brito, Vicente Campos, Rafael Martí
    Variable neighborhood search for the linear ordering problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3549-3565 [Journal]
  15. Yoshiaki Ohsawa, Frank Plastria, Kazuki Tamura
    Euclidean push-pull partial covering problems. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3566-3582 [Journal]
  16. Wilco van den Heuvel, Albert P. M. Wagelmans
    An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3583-3599 [Journal]
  17. Nafee Rizk, Alain Martel, Sophie D'Amours
    Multi-item dynamic production-distribution planning in process industries with divergent finishing stages. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3600-3623 [Journal]
  18. Byung-In Kim, Seongbae Kim, Surya Sahoo
    Waste collection vehicle routing problem with time windows. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2006, v:33, n:12, pp:3624-3642 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002