Geodesic
The complexity of short schedules for uet bipartite graphs
RAIRO - Operations Research - Recherche Opérationnelle, Tome 33 (1999) no. 3, pp. 367-370 Cet article a éte moissonné depuis la source Numdam

Voir la notice de l'article

@article{RO_1999__33_3_367_0,
     author = {Bampis, Evripidis},
     title = {The complexity of short schedules for uet bipartite graphs},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {367--370},
     year = {1999},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {3},
     mrnumber = {1721640},
     zbl = {0953.68019},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RO_1999__33_3_367_0/}
}
TY  - JOUR
AU  - Bampis, Evripidis
TI  - The complexity of short schedules for uet bipartite graphs
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 1999
SP  - 367
EP  - 370
VL  - 33
IS  - 3
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/item/RO_1999__33_3_367_0/
LA  - en
ID  - RO_1999__33_3_367_0
ER  - 
%0 Journal Article
%A Bampis, Evripidis
%T The complexity of short schedules for uet bipartite graphs
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 1999
%P 367-370
%V 33
%N 3
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/item/RO_1999__33_3_367_0/
%G en
%F RO_1999__33_3_367_0
Bampis, Evripidis. The complexity of short schedules for uet bipartite graphs. RAIRO - Operations Research - Recherche Opérationnelle, Tome 33 (1999) no. 3, pp. 367-370. http://geodesic.mathdoc.fr/item/RO_1999__33_3_367_0/