Journals in DBLP

INFORMS Journal on Computing
2004, volume: 16, number: 2

1. W. David Kelton
   From the Editor. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:107- [Journal]
   
2. 
   Institute for Operations Research and the Management Sciences. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:108- [Journal]
   
3. Richard D. McBride, John W. Mamer
   Implementing an LU Factorization for the Embedded Network Simplex Algorithm. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:109-119 [Journal]
   
4. Willem de Paepe, Jan Karel Lenstra, Jiri Sgall, René A. Sitters, Leen Stougie
   Computer-Aided Complexity Classification of Dial-a-Ride Problems. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:120-132 [Journal]
   
5. Mutsunori Yagiura, Toshihide Ibaraki, Fred Glover
   An Ejection Chain Approach for the Generalized Assignment Problem. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:133-151 [Journal]
   
6. John Shortle, Percy H. Brill, Martin J. Fischer, Donald Gross, Denise M. Bevilacqua Masi
   An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:152-161 [Journal]
   
7. Jeffery L. Kennington, Karen R. Lewis
   Generalized Networks: The Theory of Preprocessing and an Empirical Analysis. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:162-173 [Journal]
   
8. Jeffery L. Kennington, Eli V. Olinick
   Wavelength Translation in WDM Networks: Optimization Models and Solution Procedures. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:174-187 [Journal]
   
9. Alain Billionnet, Éric Soutif
   Using a Mixed Integer Programming Tool for Solving the 0-1 Quadratic Knapsack Problem. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 2004, v:16, n:2, pp:188-197 [Journal]
   
10. Francis Sourd
    The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2004, v:16, n:2, pp:198-208 [Journal]