|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
21 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A fast algorithm for strongly correlated knapsack problems |
Pisinger, David |
1998 |
89 | 1-3 |
p. 197-212 16 p. |
artikel |
|
| 2 | A note on spanning local tournaments in locally semicomplete digraphs |
Huang, Jing |
1998 |
89 | 1-3 |
p. 277-279 3 p. |
artikel |
|
| 3 | Approximation algorithms for min-sum p-clustering |
Guttmann-Beck, Nili |
1998 |
89 | 1-3 |
p. 125-142 18 p. |
artikel |
|
| 4 | Author index |
1998 |
89 | 1-3 |
p. 287- 1 p. |
artikel |
||
| 5 | Disjunctive programming: Properties of the convex hull of feasible points |
Balas, Egon |
1998 |
89 | 1-3 |
p. 3-44 42 p. |
artikel |
|
| 6 | d-minimal languages |
Yu, S.S. |
1998 |
89 | 1-3 |
p. 243-262 20 p. |
artikel |
|
| 7 | Editorial Board |
1998 |
89 | 1-3 |
p. v-vi nvt p. |
artikel |
||
| 8 | Efficient broadcasting with linearly bounded faults |
Ciebiera, Krzysztof |
1998 |
89 | 1-3 |
p. 99-105 7 p. |
artikel |
|
| 9 | Foreword |
Cornuéjols, Gérard |
1998 |
89 | 1-3 |
p. 1-2 2 p. |
artikel |
|
| 10 | Fringe thickness and maximum path length of binary trees |
Cameron, Helen |
1998 |
89 | 1-3 |
p. 75-97 23 p. |
artikel |
|
| 11 | How good are branching rules in DPLL? |
Ouyang, Ming |
1998 |
89 | 1-3 |
p. 281-286 6 p. |
artikel |
|
| 12 | Large generalized cycles |
Gómez, J. |
1998 |
89 | 1-3 |
p. 107-123 17 p. |
artikel |
|
| 13 | Linking discrete orthogonality with dilation and translation for incomplete sigma-pi neural networks of Hopfield-type |
Lenze, Burkhard |
1998 |
89 | 1-3 |
p. 169-180 12 p. |
artikel |
|
| 14 | Median hyperplanes in normed spaces — a survey |
Martini, Horst |
1998 |
89 | 1-3 |
p. 181-195 15 p. |
artikel |
|
| 15 | Minimal vertex separators of chordal graphs |
Kumar, P.Sreenivasa |
1998 |
89 | 1-3 |
p. 155-168 14 p. |
artikel |
|
| 16 | On perfect switching classes |
Hertz, Alain |
1998 |
89 | 1-3 |
p. 263-267 5 p. |
artikel |
|
| 17 | On the average Hamming distance for binary codes |
Shutao, Xia |
1998 |
89 | 1-3 |
p. 269-276 8 p. |
artikel |
|
| 18 | Partial and perfect path covers of cographs |
Kirkpatrick, D.G. |
1998 |
89 | 1-3 |
p. 143-153 11 p. |
artikel |
|
| 19 | The complexity of multidimensional periodic scheduling |
Verhaegh, W.F.J. |
1998 |
89 | 1-3 |
p. 213-242 30 p. |
artikel |
|
| 20 | The complexity of some problems related to Graph 3-colorability |
Brandstädt, Andreas |
1998 |
89 | 1-3 |
p. 59-73 15 p. |
artikel |
|
| 21 | Triangulating graphs with few P 4's |
Babel, Luitpold |
1998 |
89 | 1-3 |
p. 45-57 13 p. |
artikel |
21 gevonden resultaten