Geodesic
The discrete $\Psi$-transformation method in integer programming
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 2, pp. 231-242 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

A new method is proposed for solving integer and mixed integer programming problems – the discrete $\Psi$-transformation method. One of the features of the proposed method is its ability to predict the global extremum value of the objective function and correspondingly the error of the solution. 
@article{ZVMMF_1990_30_2_a5,
     author = {D. V. Ofitserov},
     title = {The discrete $\Psi$-transformation method in integer programming},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {231--242},
     year = {1990},
     volume = {30},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_2_a5/}
}
TY  - JOUR
AU  - D. V. Ofitserov
TI  - The discrete $\Psi$-transformation method in integer programming
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1990
SP  - 231
EP  - 242
VL  - 30
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_2_a5/
LA  - ru
ID  - ZVMMF_1990_30_2_a5
ER  - 
%0 Journal Article
%A D. V. Ofitserov
%T The discrete $\Psi$-transformation method in integer programming
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1990
%P 231-242
%V 30
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_2_a5/
%G ru
%F ZVMMF_1990_30_2_a5
D. V. Ofitserov. The discrete $\Psi$-transformation method in integer programming. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 2, pp. 231-242. http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_2_a5/

[1] Geri M. G., Dzhonson D. S., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR

[2] Ofitserov D. V., Tanaev V. S., “Computer-aided production planning in the integrated control system of an automatic factory”, Algorithms Production Control and Scheduling, v. 1, Karlovy Vary, 1988, 131–136

[3] Chichinadze V. K., Reshenie nevypuklykh nelineinykh zadach optimizatsii: Metod $\Psi$-preobrazovaniya, Nauka, M., 1983 | MR

[4] Svirin Yu. P., Ofitserov D. V., “Modelirovanie zadachi raspredeleniya v sisteme operativno-kalendarnogo planirovaniya avtomatizirovannogo proizvodstva”, Vopr. radioelektroniki. Ser. ASUPR, 1985, no. 1, 106–110

[5] Ofitserov D. V., Svirin Yu. P., “Metod resheniya zadachi operativno-kalendarnogo planirovaniya avtomatizirovannogo proizvodstva”, Izv. AN BSSR. Ser. fiz.-tekhn. nauk, 1985, no. 3, 78–83

[6] Smirnov A. I., Svirin Yu. P., Revotyuk M. P. i dr., “Matematicheskoe obespechenie integrirovannoi sistemy upravleniya gibkogo avtomatizirovannogo proizvodstva”, APMS-COMPCONTROL-85, v. 3, Budapest, 1985, 808–822

[7] Ofitserov D. V., “Algoritm mnogoekstremalnoi diskretnoi optimizatsii”, Avtomatika i vychisl. tekhn., 15, Minsk, 1986, 58–60 | MR

[8] Balagin V., Dolgij A., Kowaltschuk G. et al., “Zur simulation flexibler Fertigungssysteme”, Simulationstechn., Proc. 4 Symp. Simulationstechn. (Zürich, 9–11 Sept. 1987.), Berlin etc., 1987, 548–556

[9] Sysoev V. V., Perov V. A., “Razrabotka programmy optimizatsii mnogoekstremalnykh funktsii metodom $\Psi$-preobrazovaniya”, Ekonomika i matem. metody, 12:12 (1976), 178–183

[10] Sysoev V. V., Avtomatizirovannoe proektirovanie linii i komplektov oborudovaniya poluprovodnikovogo i mikroelektronnogo proizvodstva, Radio i svyaz, M., 1982

[11] Gadakhabadze I. G., Dzhibladze N. I., Chichinadze V. K., “Optimalnoe proektirovanie elektronnykh skhem metodom $\Psi$-preobrazovaniya”, Avtomatika i telemekhan., 1978, no. 4, 86–94 | Zbl

[12] Tsarfin E. L., “Ob odnom algoritme resheniya nevypukloi zadachi nelineinogo programmirovaniya”, Differents. ur-niya i ikh prilozh., Izd-vo DGU, Dnepropetrovsk, 1985, 51–54

[13] Archetti F., Frontini F., “A global optimization method and its applications to dry cooling tower design”, Energia Nucl., 22:5 (1975), 260–264

[14] Finkelshtein Yu. Yu., Priblizhennye metody i prikladnye zadachi diskretnogo programmirovaniya, Nauka, M., 1976

[15] Sergienko I. V., Matematicheskie modeli i metody resheniya zadach diskretnoi optimizatsii, Nauk. dumka, Kiev, 1985 | MR

[16] Boender C. G. E., Rinnooy Kan A. H. G., Timmer G. T., Stougie L., “A stochastic method for global optimization”, Math. Program., 22:2 (1982), 125–140 | DOI | MR

[17] Lasserre J. B., “An analytical expression and an algorithm for the volume of a convex polyhedron in $R^n$”, J. Optimizat. Theory and Appl., 39:3 (1983), 363–377 | DOI | MR | Zbl

[18] Vapnik V. H., Vosstanovlenie zavisimostei po empiricheskim dannym, Nauka, M., 1979 | MR | Zbl

[19] Vapnika V. N. (red.), Algoritmy i programmy vosstanovleniya zavisimostei, Nauka, M., 1984 | MR

[20] Alekseev O. G., Kompleksnoe primenenie metodov diskretnoi optimizatsii, Nauka, M., 1987 | MR

[21] Lyuis K. D., Metody prognozirovaniya ekonomicheskikh pokazatelei, Finansy i statistika, M., 1986

[22] Mikhalevich V. S., Volkovich V. L., Vychislitelnye metody issledovaniya i proektirovaniya slozhnykh sistem, Nauka, M., 1982 | MR | Zbl

[23] Sukharev A. G., Timokhov A. V., Fedorov V. V., Kurs metodov optimizatsii, Nauka, M., 1986 | MR | Zbl

[24] Selyutin V. A., Mashinnoe konstruirovanie elektronnykh ustroistv, Sov. radio, M., 1977

[25] Burkard R. E., Stratmann K. H., “Numerical investigations on quadratic assignment problems”, Naval Res. Logist. Quart., 25:1 (1978), 129–148 | DOI | Zbl

[26] Sokolovskii V. Z., Kukharenok M. A., “Metod suzhayuschikhsya okrestnostei: realizatsiya, testirovanie, prilozheniya”, Ekonomika i matem. metody, 21:6 (1985), 1092–1101 | MR

[27] Feigin L. I., “Statisticheskaya otsenka optimuma v obschei zadache teorii raspisanii”, Izv. AN SSSR. Tekhn. kibernetika, 1982, no. 2, 221–224

[28] Khodzinskii A. N., “Posledovatelnyi algoritm resheniya zadach kombinatornoi optimizatsii na perestanovkakh”, Kibernetika, 1985, no. 6, 56–60 ; 76 | MR