Journals in DBLP

Discrete Applied Mathematics
2004, volume: 145, number: 1

1. Michel Gendreau, Alain Hertz, Frédéric Semet, Marino Widmer
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:1-2 [Journal]
   
2. Vladimir E. Alekseev, Vadim V. Lozin
   Augmenting graphs for independent sets. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:3-10 [Journal]
   
3. Gabriela Alexe, Sorin Alexe, Yves Crama, Stephan Foldes, Peter L. Hammer, Bruno Simeone
   Consensus algorithms for the generation of all maximal bicliques. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:11-21 [Journal]
   
4. Shoshana Anily, Julien Bramel
   An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:22-39 [Journal]
   
5. Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak, Wojciech T. Markiewicz
   Sequencing by hybridization with isothermic oligonucleotide libraries. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:40-51 [Journal]
   
6. Endre Boros, Isabella Lari, Bruno Simeone
   Block linear majorants in quadratic 0-1 optimization. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:52-71 [Journal]
   
7. Teresa Cáceres, M. Cruz López-de-los-Mozos, Juan A. Mesa
   The path-variance problem on tree networks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:72-79 [Journal]
   
8. Jacques Carlier, Eric Pinson
   Jackson's pseudo-preemptive schedule and cumulative scheduling problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:80-94 [Journal]
   
9. Krzysztof Giaro, Marek Kubale
   Compact scheduling of zero-one time operations in multi-stage systems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:95-103 [Journal]
   
10. Horst W. Hamacher, Martine Labbé, Stefan Nickel, Tim Sonneborn
    Adapting polyhedral properties from facility to hub location problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:104-116 [Journal]
    
11. Pierre Hansen, Nenad Mladenovic, Dragan Urosevic
    Variable neighborhood search for the maximum clique. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:117-125 [Journal]
    
12. Hipólito Hernández-Pérez, Juan José Salazar González
    A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:145, n:1, pp:126-139 [Journal]