Cutting plane methods for solving nonconvex programming problems

Forgó Ferenc: Cutting plane methods for solving nonconvex programming problems. In: Acta cybernetica, (1) 3. pp. 171-192. (1972)

[thumbnail of cybernetica_001_fasc_003_171-192.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_001_fasc_003_171-192.pdf

Download (1MB) | Preview
Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 1972
Volume: 1
Number: 3
ISSN: 0324-721X
Page Range: pp. 171-192
Language: English
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/38459/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 191-192.
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:27
Last Modified: 2022. Jun. 01. 13:35
URI: http://acta.bibl.u-szeged.hu/id/eprint/12185

Actions (login required)

View Item View Item