| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A laminarity property of the polyhedron described by a weakly posi-modular set function
|
Fujishige, Satoru
|
|
2000
|
100 |
1-2 |
p. 123-126
4 p.
|
article
|
| 2 |
Algorithms and codes for dense assignment problems: the state of the art
|
Dell'Amico, Mauro
|
|
2000
|
100 |
1-2 |
p. 17-48
32 p.
|
article
|
| 3 |
A note on “parallel machine scheduling with non-simultaneous machine available time”
|
Lee, Chung-Yee
|
|
2000
|
100 |
1-2 |
p. 133-135
3 p.
|
article
|
| 4 |
A note on the generalized steiner tree polytope
|
Salazar, Juan José
|
|
2000
|
100 |
1-2 |
p. 137-144
8 p.
|
article
|
| 5 |
Computing orbit period in max–min algebra
|
Gavalec, Martin
|
|
2000
|
100 |
1-2 |
p. 49-65
17 p.
|
article
|
| 6 |
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
|
Resende, Mauricio G.C.
|
|
2000
|
100 |
1-2 |
p. 95-113
19 p.
|
article
|
| 7 |
Local symmetries in the period-doubling sequence
|
Damanik, David
|
|
2000
|
100 |
1-2 |
p. 115-121
7 p.
|
article
|
| 8 |
Maximum packing for biconnected outerplanar graphs
|
Kovacs, Tomas
|
|
2000
|
100 |
1-2 |
p. 85-94
10 p.
|
article
|
| 9 |
Naturally submodular digraphs and forbidden digraph configurations
|
Granot, D.
|
|
2000
|
100 |
1-2 |
p. 67-84
18 p.
|
article
|
| 10 |
On the complexity of minimizing the number of late jobs in unit time open shop
|
Kravchenko, Svetlana A.
|
|
2000
|
100 |
1-2 |
p. 127-132
6 p.
|
article
|
| 11 |
Optimal multiple message broadcasting in telephone-like communication systems
|
Bar-Noy, Amotz
|
|
2000
|
100 |
1-2 |
p. 1-15
15 p.
|
article
|
Journal description