z-logo
open-access-imgOpen Access
Solving of the linear optimization problem on polyarrangements with the constant sum of coordinates in the arrangements
Author(s) -
O. O. Iemets,
Oleksandra Yemets,
Ivan Polyakov
Publication year - 2018
Publication title -
vìsnik zaporìzʹkogo nacìonalʹnogo unìversitetu. fìziko-matematičnì nauki
Language(s) - English
Resource type - Journals
eISSN - 2518-1785
pISSN - 2413-6549
DOI - 10.26661/2413-6549-2018-1-01
Subject(s) - constant (computer programming) , mathematics , mathematical optimization , optimization problem , computer science , mathematical economics , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here