nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A class of generalized greedy algorithms for the multi-knapsack problem
|
Rinnooy Kan, A.H.G. |
|
1993 |
42 |
2-3 |
p. 279-290 12 p. |
artikel |
2 |
A fast randomized algorithm for partitioning a graph into paths of fixed length
|
Stougie, Leen |
|
1993 |
42 |
2-3 |
p. 291-303 13 p. |
artikel |
3 |
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
|
Błazewicz, J. |
|
1993 |
42 |
2-3 |
p. 123-138 16 p. |
artikel |
4 |
Author index
|
|
|
1993 |
42 |
2-3 |
p. 305-306 2 p. |
artikel |
5 |
Computing the throughput of a network with dedicated lines
|
Papadimitriou, Christos H. |
|
1993 |
42 |
2-3 |
p. 271-278 8 p. |
artikel |
6 |
Directed hypergraphs and applications
|
Gallo, Giorgio |
|
1993 |
42 |
2-3 |
p. 177-201 25 p. |
artikel |
7 |
Efficient reformulation for 0–1 programs — methods and computational results
|
Dietrich, B.L. |
|
1993 |
42 |
2-3 |
p. 147-175 29 p. |
artikel |
8 |
In memoriam Paolo M. Camerini
|
Maffioli, Francesco |
|
1993 |
42 |
2-3 |
p. 121-122 2 p. |
artikel |
9 |
Lagrangean methods for 0–1 quadratic problems
|
Michelon, Philippe |
|
1993 |
42 |
2-3 |
p. 257-269 13 p. |
artikel |
10 |
Most uniform path partitioning and its use in image processing
|
Lucertini, Mario |
|
1993 |
42 |
2-3 |
p. 227-256 30 p. |
artikel |
11 |
Note on combinatorial optimization with max-linear objective functions
|
Chung, Sung-Jin |
|
1993 |
42 |
2-3 |
p. 139-145 7 p. |
artikel |
12 |
Preface
|
Galbiati, Giulia |
|
1993 |
42 |
2-3 |
p. 119- 1 p. |
artikel |
13 |
Sequential and parallel local search for the time-constrained traveling salesman problem
|
Kindervater, Gerard |
|
1993 |
42 |
2-3 |
p. 211-225 15 p. |
artikel |
14 |
Why should biconnected components be identified first
|
Hochbaum, Dorit S. |
|
1993 |
42 |
2-3 |
p. 203-210 8 p. |
artikel |