Journals in DBLP

Discrete Applied Mathematics
2001, volume: 112, number: 1-3

1. Martine Labbé, Gilbert Laporte, Silvano Martello
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:1- [Journal]
   
2. Mourad Baïou
   On the dominant of the Steiner 2-edge connected subgraph polytope. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:3-10 [Journal]
   
3. Ralf Borndörfer, Robert Weismantel
   Discrete relaxations of combinatorial programs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:11-26 [Journal]
   
4. Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey
   Scheduling projects with labor constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:27-52 [Journal]
   
5. Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani
   An approximation result for a periodic allocation problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:53-72 [Journal]
   
6. Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron
   Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:73-99 [Journal]
   
7. Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub
   Steiner trees and polyhedra. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:101-120 [Journal]
   
8. Samuel Fiorini
   Determining the automorphism group of the linear ordering polytope. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:121-128 [Journal]
   
9. Luis Gouveia, Jose Manuel Pires
   The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:129-145 [Journal]
   
10. Mark E. Hartmann, Özgür Özlük
    Facets of the p-cycle polytope. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:147-178 [Journal]
    
11. Johann Hurink, Jens Keuchel
    Local search algorithms for a single-machine scheduling problem with positive and negative time-lags. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:179-197 [Journal]
    
12. Johann Hurink, Sigrid Knust
    Makespan minimization for flow-shop problems with transportation times and a single robot. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:199-216 [Journal]
    
13. Brigitte Jaumard, Odile Marcotte, Christophe Meyer, Tsevi Vovor
    Comparison of column generation models for channel assignment in cellular networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:217-240 [Journal]
    
14. Tobias Polzin, Siavash Vahdati Daneshmand
    A comparison of Steiner tree relaxations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:241-261 [Journal]
    
15. Tobias Polzin, Siavash Vahdati Daneshmand
    Improved algorithms for the Steiner problem in networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:263-300 [Journal]
    
16. H. Edwin Romeijn, Dolores Romero Morales
    A probabilistic analysis of the multi-period single-sourcing problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:301-328 [Journal]