nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A note on dominance relation in unbounded knapsack problems
|
DudziĆski, Krzysztof |
|
1991 |
|
7 |
p. 417-419 3 p. |
artikel |
2 |
A theorem connecting utility function optimization and compromise programming
|
Ballestero, Enrique |
|
1991 |
|
7 |
p. 421-427 7 p. |
artikel |
3 |
Baseball playoff eliminations: An application of linear programming
|
Robinson, Lawrence W. |
|
1991 |
|
7 |
p. 429- 1 p. |
artikel |
4 |
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
|
Gerards, A.M.H. |
|
1991 |
|
7 |
p. 377-382 6 p. |
artikel |
5 |
Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
|
Kaliski, John A. |
|
1991 |
|
7 |
p. 389-393 5 p. |
artikel |
6 |
Cosine: A new graph coloring algorithm
|
Hertz, A. |
|
1991 |
|
7 |
p. 411-415 5 p. |
artikel |
7 |
General economic equilibrium and variational inequalities
|
Zhao, Lan |
|
1991 |
|
7 |
p. 369-376 8 p. |
artikel |
8 |
Improved complexity bounds for location problems on the real line
|
Hassin, R. |
|
1991 |
|
7 |
p. 395-402 8 p. |
artikel |
9 |
On-line and off-line vertex enumeration by adjacency lists
|
Chen, Pey-Chun |
|
1991 |
|
7 |
p. 403-409 7 p. |
artikel |
10 |
On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
|
Goldfarb, Donald |
|
1991 |
|
7 |
p. 383-387 5 p. |
artikel |