Journals in DBLP

Discrete Applied Mathematics
1993, volume: 42, number: 2

1. Giulia Galbiati, Francesco Maffioli
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:119- [Journal]
   
2. Francesco Maffioli
   In Memoriam Paolo M. Camerini. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:121-122 [Journal]
   
3. Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello
   Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:123-138 [Journal]
   
4. Sung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, Katta G. Murty
   Note on Combinatorial Optimization with Max-Linear Objective Functions. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:139-145 [Journal]
   
5. Brenda L. Dietrich, Laureano F. Escudero, F. Chance
   Efficient Reformulation for 0-1 Programs - Methods and Computational Results. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:147-175 [Journal]
   
6. Giorgio Gallo, Giustino Longo, Stefano Pallottino
   Directed Hypergraphs and Applications. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:177-201 [Journal]
   
7. Dorit S. Hochbaum
   Why Should Biconnected Components be Identified First. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:203-210 [Journal]
   
8. Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh
   Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:211-225 [Journal]
   
9. Mario Lucertini, Yehoshua Perl, Bruno Simeone
   Most Uniform Path Partitioning and its Use in Image Processing. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:42, n:2, pp:227-256 [Journal]
   
10. Philippe Michelon, Nelson Maculan
    Lagrangean Methods for 0-1 Quadratic Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:257-269 [Journal]
    
11. Christos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis
    Computing the Throughput of a Network with Dedicated Lines. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:271-278 [Journal]
    
12. A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis
    A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:279-290 [Journal]
    
13. Leen Stougie
    A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:42, n:2, pp:291-303 [Journal]