Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DM_2013_25_2_a1,
author = {V. A. Emelichev and K. G. Kuz'min},
title = {Estimating the stability radius of the vector {MAX-CUT} problem},
journal = {Diskretnaya Matematika},
pages = {5--12},
publisher = {mathdoc},
volume = {25},
number = {2},
year = {2013},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2013_25_2_a1/}
}
V. A. Emelichev; K. G. Kuz'min. Estimating the stability radius of the vector MAX-CUT problem. Diskretnaya Matematika, Tome 25 (2013) no. 2, pp. 5-12. http://geodesic.mathdoc.fr/item/DM_2013_25_2_a1/
[1] Emelichev V. A., Krichko V. N., Podkopaev D. P., “O radiuse ustoichivosti vektornoi zadachi lineinogo buleva programmirovaniya”, Diskretnaya matematika, 12:2 (2000), 25–30 | DOI | MR | Zbl
[2] Emelichev V. A., Girlich E., Nikulin Yu. V., Podkopaev D. P., “Stability and regularization of vector problems of integer linear programming”, Optimization, 51:4 (2002), 645–676 | DOI | MR | Zbl
[3] Bukhtoyarov S. E., Emelichev V. A., “Mera ustoichivosti konechnoi koalitsionnoi igry s parametricheskim (“ot Pareto ot Nesha”) printsipom optimalnosti”, Zhurnal vychisl. matem. i matem. fiziki, 46:7 (2006), 1258–1264 | MR
[4] Emelichev V. A., Kuzmin K. G., “Ob odnom tipe ustoichivosti mnogokriterialnoi zadachi tselochislennogo lineinogo programmirovaniya v sluchae monotonnoi normy”, Izvestiya RAN. Teoriya i sistemy upravleniya, 2007, no. 5, 45–51 | MR
[5] Emelichev V. A., Kuzmin K. G., “O radiuse ustoichivosti vektornoi zadachi tselochislennogo lineinogo programmirovaniya v sluchae v sluchae regulyarnosti normy v kriterialnom prostranstve”, Kibernetika i sistemnyi analiz, 2010, no. 1, 82–89 | Zbl
[6] Emelichev V., Podkopaev D., “Quantitative stability analysis for vector problems of 0-1 programming”, Discrete Optimization, 7 (2010), 48–63 | DOI | MR | Zbl
[7] Emelichev V. A., Krichko V. N., “Formula radiusa ustoichivosti vektornoi $l_\infty$-ekstremalnoi traektornoi zadachi”, Diskretnaya matematika, 16:1 (2004), 14–20 | DOI | MR | Zbl
[8] Emelichev V., Korotkov V., “On stability radius of the multicriteria variant of Markowitz's investment portfolio problem”, Buletinul Academiei de ştiinţe a Respublicii Moldova. Matematica, 2011, no. 1, 83–94 | MR | Zbl
[9] Emelichev V. A., Korotkov V. V., “O radiuse ustoichivosti vektornoi investitsionnoi zadachi s kriteriyami minimaksnogo riska Sevidzha”, Kibernetika i sistemnyi analiz, 2012, no. 3, 68–77 | MR
[10] Emelichev V. A., Korotkov V. V., “Ustoichivost vektornoi investitsionnoi bulevoi zadachi s kriteriyami Valda”, Diskretnaya matematika, 24:3 (2012), 3–16 | DOI | MR | Zbl
[11] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, Moskva, 1982 | MR
[12] Burer S., Monteiro R. D. C., Zhang Y., “Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs”, SIAM Journal on Optimization, 12 (2001), 503–521 | DOI | MR | Zbl
[13] Barahona F., Grotschel M., Junger M., Reinelt G., “An application of combinatorial optimization to statistical physics and circuit layout design”, Operations Research, 36:3 (1988), 493–513 | DOI | MR | Zbl
[14] Chang K. C., Du D. H.-C., “Efficient algorithms for layer assignment problem”, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 6 (1987), 67–78 | DOI
[15] Poljac S., Tuza Z., “Maximum cuts and large bipartite subgraphs”, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 20 (1995), 181–244 | MR
[16] Emelichev V. A., Melnikov O. I., Sarvanov V. I., Tyshkevich R. I., Lektsii po teorii grafov, LIBROKOM, Moskva, 2009
[17] Khardi G., Littlvud Dzh. E., Polia G., Neravenstva, LKI, Moskva, 2008
[18] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, FIZMATLIT, Moskva, 2007