Journals in DBLP

INFORMS Journal on Computing
1997, volume: 9, number: 1

1. Mohan Bala, Kipp Martin
   A Mathematical Programming Approach to Data Base Normalization. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:1-14 [Journal]
   
2. Jonathan Eckstein
   How Much Communication Does Parallel Branch and Bound Need? [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:15-29 [Journal]
   
3. Gintaras Palubeckis
   A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:30-42 [Journal]
   
4. Djangir A. Babayev, Fred Glover, Jennifer Ryan
   A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:43-50 [Journal]
   
5. Ger Koole
   On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:51-56 [Journal]
   
6. Pierre L'Ecuyer
   Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:57-60 [Journal]
   
7. Teodor Gabriel Crainic, Michel Toulouse, Michel Gendreau
   Toward a Taxonomy of Parallel Tabu Search Heuristics. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:61-72 [Journal]
   
8. Jacek Gondzio
   Presolove Analysis of Linear Programs Prior to Applying an Interior Point Method. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:73-91 [Journal]
   
9. Han Hoogeveen, Steef L. van de Velde
   Earliness-Tardiness Scheduling Around Almost Equal Due Dates. [Citation Graph (0, 0)][DBLP]
   INFORMS Journal on Computing, 1997, v:9, n:1, pp:92-99 [Journal]
   
10. Joy Bhadury, V. Chandru, A. Maheshwari, Ramaswamy Chandrasekaran
    Art Gallery Problems for Convex Nested Polygons. [Citation Graph (0, 0)][DBLP]
    INFORMS Journal on Computing, 1997, v:9, n:1, pp:100-110 [Journal]