Journals in DBLP

J. Comb. Optim.
2004, volume: 8, number: 1

1. Hans Kellerer, Ulrich Pferschy
   Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2004, v:8, n:1, pp:5-11 [Journal]
   
2. Andrei A. Gladky, Yakov M. Shafransky, Vitaly A. Strusevich
   Flow Shop Scheduling Problems Under Machine-Dependent Precedence Constraints. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2004, v:8, n:1, pp:13-28 [Journal]
   
3. Bang Ye Wu
   Constructing the Maximum Consensus Tree from Rooted Triples. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2004, v:8, n:1, pp:29-39 [Journal]
   
4. Valmir C. Barbosa, Carlos A. G. Assis, Josina O. do Nascimento
   Two Novel Evolutionary Formulations of the Graph Coloring Problem. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2004, v:8, n:1, pp:41-63 [Journal]
   
5. Mhand Hifi
   Dynamic Programming and Hill-Climbing Techniques for Constrained Two-Dimensional Cutting Stock Problems. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2004, v:8, n:1, pp:65-84 [Journal]
   
6. Bo Chen, Xiaotie Deng, Wenan Zang
   On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2004, v:8, n:1, pp:85-95 [Journal]
   
7. Xiao Zhou, Takao Nishizeki
   Algorithm for the Cost Edge-Coloring of Trees. [Citation Graph (0, 0)][DBLP]
   J. Comb. Optim., 2004, v:8, n:1, pp:97-108 [Journal]