Geodesic
A continuous timetable with~$m$, $m-2$, or~$2$ instructor's class hours
Diskretnaya Matematika, Tome 24 (2012) no. 2, pp. 37-45.

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

@article{DM_2012_24_2_a3,
     author = {A. M. Magomedov},
     title = {A continuous timetable with~$m$, $m-2$, or~$2$ instructor's class hours},
     journal = {Diskretnaya Matematika},
     pages = {37--45},
     publisher = {mathdoc},
     volume = {24},
     number = {2},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2012_24_2_a3/}
}
TY  - JOUR
AU  - A. M. Magomedov
TI  - A continuous timetable with~$m$, $m-2$, or~$2$ instructor's class hours
JO  - Diskretnaya Matematika
PY  - 2012
SP  - 37
EP  - 45
VL  - 24
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2012_24_2_a3/
LA  - ru
ID  - DM_2012_24_2_a3
ER  - 
%0 Journal Article
%A A. M. Magomedov
%T A continuous timetable with~$m$, $m-2$, or~$2$ instructor's class hours
%J Diskretnaya Matematika
%D 2012
%P 37-45
%V 24
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2012_24_2_a3/
%G ru
%F DM_2012_24_2_a3
A. M. Magomedov. A continuous timetable with~$m$, $m-2$, or~$2$ instructor's class hours. Diskretnaya Matematika, Tome 24 (2012) no. 2, pp. 37-45. http://geodesic.mathdoc.fr/item/DM_2012_24_2_a3/

[1] Sachkov V. N., Vvedenie v kombinatornye metody diskretnoi matematiki, Nauka, Moskva, 1982 | MR | Zbl

[2] Ford L. R., Falkerson D. R., Potoki v setyakh, Mir, Moskva, 1963

[3] Magomedov A. M., “O vychislitelnoi slozhnosti chastnogo sluchaya zadachi postroeniya raspisaniya”, Tez. dokl. X Mezhdunarodnoi matem. konf., v. 5, In-t matematiki NAN Belarusi, Minsk, 2008, 92

[4] Magomedov A. M., “$NP$-polnota zadachi postroeniya nepreryvnogo raspisaniya dlya spetsializirovannykh protsessorov”, Trudy 8-i Mezhdunarodnoi konf. “Diskretnye modeli v teorii upravlyayuschikh sistem”, Moskva, 2009

[5] Cho Y., Sahni S., “Preemptive scheduling of independent jobs with release and due times on open, flow and job shops”, Oper. Res., 29 (1981), 511–512 | DOI | MR

[6] Tanaev V. S., Sotskov Yu. N., Strusevich V. A., Teoriya raspisanii. Mnogostadiinye sistemy, Nauka, Moskva, 1989 | MR | Zbl

[7] Magomedov A. M., “Uplotnenie raspisaniya s direktivnym srokom, kratnym kolichestvu zanyatii kazhdogo prepodavatelya”, Matem. zametki, 85:1 (2009), 65–72 | DOI | MR | Zbl

[8] Petersen J., “Die Theorie der regularen Graphen”, Acta Math., 15 (1891), 193–220 | DOI | MR

[9] Magomedov A. M., “K voprosu o rebernoi raskraske dvudolnogo grafa”, Diskretnaya matematika, 21:2 (2009), 153–158 | MR

[10] Reinhard D., Graph theory, Springer, New York, 2000 | MR

[11] Sahni S., “Computationally related problems”, SIAM J. Comput., 3 (1974), 262–279 | DOI | MR

[12] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, Moskva, 1982 | MR