Journals in DBLP

4OR
2004, volume: 2, number: 4

1. Jakob Krarup, Malene Nordlund Rørbech
   LP formulations of the shortest path tree problem. [Citation Graph (0, 0)][DBLP]
   4OR, 2004, v:2, n:4, pp:259-274 [Journal]
   
2. Bruno Bachelet, Philippe Mahey
   Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. [Citation Graph (0, 0)][DBLP]
   4OR, 2004, v:2, n:4, pp:275-291 [Journal]
   
3. Raymond Bisdorff
   Concordant outranking with multiple criteria of ordinal significance. [Citation Graph (0, 0)][DBLP]
   4OR, 2004, v:2, n:4, pp:293-308 [Journal]
   
4. Mustafa Ç. Pinar
   A note on robust 0-1 optimization with uncertain cost coefficients. [Citation Graph (0, 0)][DBLP]
   4OR, 2004, v:2, n:4, pp:309-316 [Journal]
   
5. Alberto Caprara
   Knapsack problems: A book review. [Citation Graph (0, 0)][DBLP]
   4OR, 2004, v:2, n:4, pp:317-320 [Journal]
   
6. Emilie Danna
   Integrating local search techniques into mixed integer programming. [Citation Graph (0, 0)][DBLP]
   4OR, 2004, v:2, n:4, pp:321-324 [Journal]
   
7. Olivier Spanjaard
   Non-classical preference models in combinatorial problems: Models and algorithms for graphs. [Citation Graph (0, 0)][DBLP]
   4OR, 2004, v:2, n:4, pp:325-328 [Journal]