The SCEAS System
Navigation Menu

Journals in DBLP

INFORMS Journal on Computing
2000, volume: 12, number: 1

  1. Ellis L. Johnson, George L. Nemhauser, Martin W. P. Savelsbergh
    Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:1, pp:2-23 [Journal]
  2. Marie Coffin, Matthew J. Saltzman
    Statistical Analysis of Computational Tests of Algorithms and Heuristics. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:1, pp:24-44 [Journal]
  3. Robert E. Bixby, Alexander Martin
    Parallelizing the Dual Simplex Method. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:1, pp:45-56 [Journal]
  4. Gerhard J. Woeginger
    When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:1, pp:57-74 [Journal]
  5. David Pisinger
    A Minimal Algorithm for the Bounded Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 2000, v:12, n:1, pp:75-82 [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