Geodesic
The structure of the Pareto set of some vector scheduling problems
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 7 (2002), pp. 81-83.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{IVM_2002_7_a10,
     author = {A. B. Zinchenko},
     title = {The structure of the {Pareto} set of some vector scheduling problems},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {81--83},
     publisher = {mathdoc},
     number = {7},
     year = {2002},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2002_7_a10/}
}
TY  - JOUR
AU  - A. B. Zinchenko
TI  - The structure of the Pareto set of some vector scheduling problems
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2002
SP  - 81
EP  - 83
IS  - 7
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2002_7_a10/
LA  - ru
ID  - IVM_2002_7_a10
ER  - 
%0 Journal Article
%A A. B. Zinchenko
%T The structure of the Pareto set of some vector scheduling problems
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2002
%P 81-83
%N 7
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2002_7_a10/
%G ru
%F IVM_2002_7_a10
A. B. Zinchenko. The structure of the Pareto set of some vector scheduling problems. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 7 (2002), pp. 81-83. http://geodesic.mathdoc.fr/item/IVM_2002_7_a10/

[1] E. G. Koffan (red.), Teoriya raspisanii i vychislitelnye mashiny, Nauka, M., 1984, 334 pp. | MR

[2] Gimadi E. Kh., Zalyubovskii V. V., Sharygin P. I., “Zadacha upakovki v polosu: asimptoticheski tochnyi podkhod”, Izv. vuzov. Matematika, 1997, no. 12, 34–44 | MR | Zbl

[3] Zinchenko A. B., “Polinomialnaya razreshimost spetsialnykh zadach diz'yunktivnogo programmirovaniya”, Zhurn. vychisl. matem. i matem. fiz., 39:2 (1999), 341–345 | MR | Zbl

[4] Kozyrev V. P., “Opisanie i porozhdenie vsekh minimalnykh raskrasok intervalnogo grafa i reshenie smezhnykh zadach”, Zhurn. vychisl. matem. i matem. fiz., 36:5 (1996), 146–152 | MR | Zbl

[5] Kravtsov M. K., “Nerazreshimost zadach vektornoi diskretnoi optimizatsii v klasse algoritmov lineinoi svertki kriteriev”, Diskret. matem., 8:2 (1996), 89–96 | Zbl

[6] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, Nauka, M., 1982, 254 pp. | MR

[7] Peler Itsik, Shamir Ron, “Realizing interval graphs with size and distance constraints”, SIAM J. Discrete Math., 10:4 (1997), 662–687 | DOI | MR

[8] Korte N., Mohring R. H., “An incremental linear-time algorithm for recognizing interval graphs”, SIAM J. Comput., 18:1 (1989), 68–81 | DOI | MR | Zbl