|
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
10 results found
| no | title | author | magazine | year | volume | issue | page(s) | type |
| 1 | A decomposition algorithm for the single machine total tardiness problem |
Potts, C.N |
1982 |
1 | 5 |
p. 177-181 5 p. |
article |
|
| 2 | A good submatrix is hard to find |
Bartholdi III, John J. |
1982 |
1 | 5 |
p. 190-193 4 p. |
article |
|
| 3 | An efficient mixture method |
Samorodnitsky, G. |
1982 |
1 | 5 |
p. 198-200 3 p. |
article |
|
| 4 | An O(K·n 4) algorithm for finding the k best cuts in a network |
Hamacher, Horst |
1982 |
1 | 5 |
p. 186-189 4 p. |
article |
|
| 5 | Approximate algorithms for the travelling purchaser problem |
Ong, Hoon Liong |
1982 |
1 | 5 |
p. 201-205 5 p. |
article |
|
| 6 | A simple, all primal branch and bound approach to pure and mixed integer binary programs |
Kochenberger, Gary A. |
1982 |
1 | 5 |
p. 182-185 4 p. |
article |
|
| 7 | Call for nominations |
1982 |
1 | 5 |
p. 206- 1 p. |
article |
||
| 8 | Computational algorithms for hierarchically structured project networks |
Ancona, M. |
1982 |
1 | 5 |
p. 170-176 7 p. |
article |
|
| 9 | On the complexity of locating linear facilities in the plane |
Megiddo, Nimrod |
1982 |
1 | 5 |
p. 194-197 4 p. |
article |
|
| 10 | Refining diffusion approximations for queues |
Whitt, Ward |
1982 |
1 | 5 |
p. 165-169 5 p. |
article |
10 results found