The SCEAS System
Navigation Menu

Journals in DBLP

Computers & OR
2003, volume: 30, number: 4

  1. Kun-Jen Chung, Kuo-Lung Hou
    An optimal production run time with imperfect production processes and allowable shortages. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:483-490 [Journal]
  2. Fayez F. Boctor, Gilbert Laporte, Jacques Renaud
    Heuristics for the traveling purchaser problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:491-504 [Journal]
  3. Vincent T'Kindt, Jatinder N. D. Gupta, Jean-Charles Billaut
    Two-machine flowshop scheduling with a secondary criterion. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:505-526 [Journal]
  4. Elkafi Hassini, Raymond G. Vickson
    A two-carousel storage location problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:527-539 [Journal]
  5. Chiang Kao, Chang-Chung Li, Shih-Pin Chen
    Simulation response optimization via direct conjugate direction method. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:541-552 [Journal]
  6. Joy Bhadury, Horst A. Eiselt, Jorge H. Jaramillo
    An alternating heuristic for medianoid and centroid problems in the plane. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:553-565 [Journal]
  7. Yi-Kuei Lin
    Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:567-575 [Journal]
  8. Donald E. K. Martin
    An algorithm to compute the probability of a run in binary fourth-order Markovian trials. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:577-588 [Journal]
  9. Kuo-Hwa Chang, Wen-Fang Chen
    Admission control policies for two-stage tandem queues with no waiting spaces. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:589-601 [Journal]
  10. Gloria Galán Marín, Enrique Mérida Casermeiro, José Muñoz-Pérez
    Modelling competitive Hopfield networks for the maximum clique problem. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:603-624 [Journal]
  11. Dennis C. Dietz, Amie J. Elcan, Daphne E. Skipper
    Optimization models for ATM network planning. [Citation Graph (0, 0)][DBLP]
    Computers & OR, 2003, v:30, n:4, pp:625-641 [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