The SCEAS System
Navigation Menu

Journals in DBLP

Oper. Res. Lett.
2007, volume: 35, number: 1

  1. Carlo Mannino, Gianpaolo Oriolo, Federico Ricci, Sunil Chandran
    The stable set problem and the thinness of a graph. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:1-9 [Journal]
  2. Thành Nguyen
    On the disjoint paths problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:10-16 [Journal]
  3. Martha Salazar-Neumann
    The robust minimum spanning tree problem: Compact and convex uncertainty. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:17-22 [Journal]
  4. Xiaoguang Yang, Jianzhong Zhang
    Partial inverse assignment problems under l1 norm. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:23-28 [Journal]
  5. Juan Pablo Vielma
    A constructive characterization of the split closure of a mixed integer linear program. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:29-35 [Journal]
  6. Vicky Mak
    Iterative variable aggregation and disaggregation in IP: An application. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:36-44 [Journal]
  7. Alberto Amaya, André Langevin, Martin Trépanier
    The capacitated arc routing problem with refill points. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:45-53 [Journal]
  8. D. P. Wang
    Computing a maxian point of a simple rectilinear polygon. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:54-60 [Journal]
  9. Tamás Kis, Richárd Kápolnai
    Approximations and auctions for scheduling batches on related machines. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:61-68 [Journal]
  10. Eric Angel, Evripidis Bampis, Aleksei V. Fishkin
    A note on scheduling to meet two min-sum objectives. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:69-73 [Journal]
  11. Che-Lin Su
    Analysis on the forward market equilibrium model. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:74-82 [Journal]
  12. Yasemin Serin
    Competitive newsvendor problems with the same Nash and Stackelberg solutions. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:83-94 [Journal]
  13. Keli Feng, Uday S. Rao
    Echelon-stock (R, nT) control in two-stage serial stochastic inventory systems. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:95-104 [Journal]
  14. Maria Vlasiou, Ivo J. B. F. Adan
    Exact solution to a Lindley-type equation on a bounded support. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:105-113 [Journal]
  15. Kyung C. Chae, Sung J. Kim
    Busy period analysis for the GI/M/1 queue with exponential vacations. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:114-118 [Journal]
  16. Hideaki Takagi, Ramón M. Rodríguez-Dagnino
    Counting the number of renewals during a random interval in a discrete-time delayed renewal process. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:119-124 [Journal]
  17. Barbara Haas Margolius
    Periodic solution to the time-inhomogeneous multi-server Poisson queue. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:125-138 [Journal]
  18. Philippe Baptiste
    Book review. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2007, v:35, n:1, pp:139-140 [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