The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
2004, volume: 32, number: 6

  1. Andrew B. Kahng, Sherief Reda
    Match twice and stitch: a new TSP tour construction heuristic. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:499-509 [Journal]
  2. Dimitris Bertsimas, Dessislava Pachamanova, Melvyn Sim
    Robust linear optimization under general norms. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:510-516 [Journal]
  3. Wanpracha Chaovalitwongse, Panos M. Pardalos, Oleg A. Prokopyev
    A new linearization technique for multi-quadratic 0-1 programming problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:517-522 [Journal]
  4. Marco Locatelli, Immanuel M. Bomze, Marcello Pelillo
    The combinatorics of pivoting for the maximum weight clique. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:523-529 [Journal]
  5. Asaf Levin
    Strongly polynomial-time approximation for a class of bicriteria problems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:530-534 [Journal]
  6. Rob van Stee
    An approximation algorithm for square packing. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:535-539 [Journal]
  7. Reuven Bar-Yehuda, Dror Rawitz
    Local ratio with negative weights. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:540-546 [Journal]
  8. Jesper Makholm Byskov
    Enumerating maximal independent sets with applications to graph colouring. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:547-556 [Journal]
  9. Alix Munier Kordon
    Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:557-564 [Journal]
  10. Bas van Velzen
    Dominating set games. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:565-573 [Journal]
  11. Bong Dae Choi, Bara Kim
    Non-ergodicity criteria for denumerable continuous time Markov processes. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:574-580 [Journal]
  12. Chung-Yee Lee
    Inventory replenishment model: lot sizing versus just-in-time delivery. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:581-590 [Journal]
  13. Uriel G. Rothblum
    Tales of Hoffman. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2004, v:32, n:6, pp:591-594 [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