Journals in DBLP

J. Math. Model. Algorithms
2003, volume: 2, number: 1

1. S. Kumar, P. Gupta
   An Incremental Algorithm for the Maximum Flow Problem. [Citation Graph (0, 0)][DBLP]
   J. Math. Model. Algorithms, 2003, v:2, n:1, pp:1-16 [Journal]
   
2. Mourad Boudhar
   Dynamic Scheduling on a Single Batch Processing Machine with Split Compatibility Graphs. [Citation Graph (0, 0)][DBLP]
   J. Math. Model. Algorithms, 2003, v:2, n:1, pp:17-35 [Journal]
   
3. Frederico R. B. Cruz, Geraldo Robson Mateus, James MacGregor Smith
   A Branch-and-Bound Algorithm to Solve a Multi-level Network Optimization Problem. [Citation Graph (0, 0)][DBLP]
   J. Math. Model. Algorithms, 2003, v:2, n:1, pp:37-56 [Journal]
   
4. Sukumar Mondal, Madhumangal Pal, Tapan Kumar Pal
   An Optimal Algorithm to Solve the All-Pairs Shortest Paths Problem on Permutation Graphs. [Citation Graph (0, 0)][DBLP]
   J. Math. Model. Algorithms, 2003, v:2, n:1, pp:57-65 [Journal]
   
5. Hesham K. Alfares
   Four-Day Workweek Scheduling with Two or Three Consecutive Days Off. [Citation Graph (0, 0)][DBLP]
   J. Math. Model. Algorithms, 2003, v:2, n:1, pp:67-80 [Journal]