Cutting plane methods for solving nonconvex programming problems

  • Ferenc Forgó

Downloads

Download data is not yet available.
Published
1972-01-01
How to Cite
Forgó, F. (1972). Cutting plane methods for solving nonconvex programming problems. Acta Cybernetica, 1(3), 171-192. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3085
Issue
Vol 1 No 3 (1972)
Section
Regular articles

Most read articles by the same author(s)

  • Gabor T. Herman, Zoltán M. Hantos, Lajos Klukovits, Imre Pávó, András Ádám, U. Kling, A. Máté, J. Szűcs, K. Bellmann, Michael Gössel, Ferenc Móricz, Dániel Muszka, Attila Sára, János Bagyinszki, György Révész, F. Ferenczy, András Pellionisz, Ferenc Forgó, Annamária G. Varga, Rózsa Péter, János Demetrovics, B. Papp, Pál Dömösi, Wilhelm Kämmerer, E. Vida, Lubomir Georgiev Iliev, Rezûm statej pervogo toma Acta Cybernetica , Acta Cybernetica: Vol 1 No 4 (1972)