Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2003_10_2_a1, author = {V. T. Dement'ev and Yu. V. Shamardin}, title = {A two-level assignment problem with a generalized {Monge} condition}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {19--28}, publisher = {mathdoc}, volume = {10}, number = {2}, year = {2003}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2003_10_2_a1/} }
TY - JOUR AU - V. T. Dement'ev AU - Yu. V. Shamardin TI - A two-level assignment problem with a generalized Monge condition JO - Diskretnyj analiz i issledovanie operacij PY - 2003 SP - 19 EP - 28 VL - 10 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DA_2003_10_2_a1/ LA - ru ID - DA_2003_10_2_a1 ER -
V. T. Dement'ev; Yu. V. Shamardin. A two-level assignment problem with a generalized Monge condition. Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 2, pp. 19-28. http://geodesic.mathdoc.fr/item/DA_2003_10_2_a1/
[1] Dinits E. A., Kronrod M. A., “Odin algoritm resheniya zadachi o naznachenii”, Dokl. AH SSSR, 189:1 (1969), 23–25 | Zbl
[2] Larin R. M., Pyatkin A. V., “Dvukhurovnevaya zadacha o naznacheniyakh”, Diskret. analiz i issled. operatsii. Ser. 2, 8:2 (2001), 42–51 | MR | Zbl
[3] Shamardin Yu. V., “O dvukhurovnevoi zadache razmescheniya pri ogranicheniyakh na ob'em proizvodstva”, Diskret. analiz i issled. operatsii. Ser. 2, 7:2 (2000), 114–118 | MR | Zbl
[4] Burkard R. E., “Efficiently solvable special cases of hard combinatorial optimization problems”, Math. Programming. Ser. B, 79:1–3 (1997), 55–70 | MR
[5] Derigs U., Goecke O., Schrader R., “Monge sequences and a simple assignment algorithm”, Discrete Appl. Math., 15:2–3 (1986), 241–248 | DOI | MR | Zbl