Journals in DBLP

Oper. Res. Lett.
2000, volume: 27, number: 4

1. Donald K. Wagner
   Shortest paths in almost acyclic graphs. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:27, n:4, pp:143-147 [Journal]
   
2. Jean B. Lasserre
   Why the logarithmic barrier function in convex and linear programming? [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:27, n:4, pp:149-152 [Journal]
   
3. Lázaro Cánovas, Mercedes Landete, Alfredo Marín
   New facets for the set packing polytope. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:27, n:4, pp:153-161 [Journal]
   
4. David Perry, Wolfgang Stadje, S. Zacks
   Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:27, n:4, pp:163-174 [Journal]
   
5. S. Papachristos, K. Skouri
   An optimal replenishment policy for deteriorating items with time-varying demand and partial-exponential type - backlogging. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:27, n:4, pp:175-184 [Journal]
   
6. Alessandro Agnetis, Dario Pacciarelli
   Part sequencing in three-machine no-wait robotic cells. [Citation Graph (0, 0)][DBLP]
   Oper. Res. Lett., 2000, v:27, n:4, pp:185-192 [Journal]