|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
9 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A note on generalizing the maximum lateness criterion for scheduling |
Hall, Leslie A. |
1993 |
47 | 2 |
p. 129-137 9 p. |
article |
|
| 2 | Directed Steiner problems with connectivity constraints |
Dahl, Geir |
1993 |
47 | 2 |
p. 109-128 20 p. |
article |
|
| 3 | Efficient labelling algorithms for the maximum noncrossing matching problem |
Malucelli, Federico |
1993 |
47 | 2 |
p. 175-179 5 p. |
article |
|
| 4 | Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs |
Winter, Pawel |
1993 |
47 | 2 |
p. 187-206 20 p. |
article |
|
| 5 | On the complexity of a special basis problem in LP |
Murty, Katta G. |
1993 |
47 | 2 |
p. 181-185 5 p. |
article |
|
| 6 | On the Euclidean two paths problem |
Kellerer, Hans |
1993 |
47 | 2 |
p. 165-173 9 p. |
article |
|
| 7 | Parallel machine scheduling to minimize costs for earliness and number of tardy jobs |
Kahlbacher, H.G. |
1993 |
47 | 2 |
p. 139-164 26 p. |
article |
|
| 8 | Preface |
Akgül, Mustafa |
1993 |
47 | 2 |
p. 85- 1 p. |
article |
|
| 9 | The complexity of one-machine batching problems |
Albers, Susanne |
1993 |
47 | 2 |
p. 87-107 21 p. |
article |
9 results found