Geodesic
On Lagrangian relaxations for the problem of the choice of a series of goods with partial external financing and constraints on product volume
Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 2, pp. 69-93.

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

@article{DA_2004_11_2_a3,
     author = {D. S. Ivanenko and A. V. Plyasunov},
     title = {On {Lagrangian} relaxations for the problem of the choice of a series of goods with partial external financing and constraints on product volume},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {69--93},
     publisher = {mathdoc},
     volume = {11},
     number = {2},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2004_11_2_a3/}
}
TY  - JOUR
AU  - D. S. Ivanenko
AU  - A. V. Plyasunov
TI  - On Lagrangian relaxations for the problem of the choice of a series of goods with partial external financing and constraints on product volume
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2004
SP  - 69
EP  - 93
VL  - 11
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2004_11_2_a3/
LA  - ru
ID  - DA_2004_11_2_a3
ER  - 
%0 Journal Article
%A D. S. Ivanenko
%A A. V. Plyasunov
%T On Lagrangian relaxations for the problem of the choice of a series of goods with partial external financing and constraints on product volume
%J Diskretnyj analiz i issledovanie operacij
%D 2004
%P 69-93
%V 11
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2004_11_2_a3/
%G ru
%F DA_2004_11_2_a3
D. S. Ivanenko; A. V. Plyasunov. On Lagrangian relaxations for the problem of the choice of a series of goods with partial external financing and constraints on product volume. Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 2, pp. 69-93. http://geodesic.mathdoc.fr/item/DA_2004_11_2_a3/

[1] Beresnev V. L., Gimadi E. Kh., Dementev V. T., Ekstremalnye zadachi standartizatsii, Nauka, Novosibirsk, 1978 | MR

[2] Ivanenko D. S., Plyasunov A. V., “Polinomialno razreshimaya zadacha vybora ryada izdelii s chastichnym vneshnim finansirovaniem”, Matematicheskoe programmirovanie i prilozheniya, Ekaterinburg, 2003, 120–121

[3] Kochetov Yu. A., “Veroyatnostnye metody lokalnogo poiska dlya zadach diskretnoi optimizatsii”, Diskretnaya matematika i ee prilozheniya, Sbornik lektsii molodezhnykh nauchnykh shkol po diskretnoi matematike i ee prilozheniyam. Chast I, MGU, M., 2001, 87–117

[4] Kochetov Yu. A., Plyasunov A. V., “Polinomialno razreshimyi klass zadach dvukhurovnevogo lineinogo programmirovaniya”, Diskret. analiz i issled. operatsii. Ser. 2, 4:2 (1997), 23–33 | MR

[5] Kochetov Yu. A., Plyasunov A. V., “Zadacha vybora ryada izdelii s chastichnym vneshnim finansirovaniem”, Diskret. analiz i issled. operatsii. Ser. 2, 9:2 (2002), 78–96 | MR | Zbl

[6] Paschenko M. G., “Lagranzhevy evristiki dlya zadachi razmescheniya s ogranicheniyami na moschnosti”, Trudy XI mezhdunarodnoi Baikalskoi shkoly-seminara “Metody optimizatsii i ikh prilozheniya”, Irkutsk, 1998, 175–178

[7] Elektronnaya biblioteka testovykh primerov “Diskretnye zadachi razmescheniya”, http://math.nsc.ru/AP/benchmarks/index.html

[8] Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M., Complexity and approximation, Springer-Verlag, Berlin, 1999 | MR | Zbl

[9] Cornuejols G., Sridharan R., Thizy J. M., “A comparison of heuristics and relaxations for the capacitated plant location problem”, European J. Oper. Res., 50:3 (1991), 280–297 | DOI | MR | Zbl

[10] Geoffrion A., “Lagrangean relaxation for integer programming”, Math. Programming Study, 2 (1974), 82–114 | MR | Zbl

[11] Guha S., Khuller S., “Greedy strikes back: improved facility location algorithms”, Proceedings of the ninth annual ACM-SIAM symposium on discrete algorithms, ACM, New York, 1998, 649–657 | MR | Zbl

[12] Hirsch W. M., Dantzig G. B., “The fixed charge problem”, Naval Res. Logist. Quart., 15:3 (1968), 413–424 | MR | Zbl

[13] Kochetov Yu., Ivanenko D., “Computationally difficult instances for the uncapacitated facility location problem”, Proceedings of the 5th Metaheuristics international conference, Kioto, 2003, 41.1–41.6

[14] Krarup J., Pruzan P. M., “The Simple plant locatoin problem”, European J. Oper. Res., 12:1 (1983), 36–81 | DOI | MR | Zbl

[15] Nemhauser G., Wolsey L., Integer and combinatorial optimization, John Wiley Sons, New York, 1988 | MR

[16] Essays and surveys in metaheuristics, Kluwer Academic Publishers, Boston, 2001

[17] Sridharam R., “The capacitated plant location problem”, European J. Oper. Res., 87 (1995), 203–213 | DOI