Topics
optimizationCultivar (cultivated variety)
Полный текст статьи можно найти по адресу: http://ijpam.eu/contents/2013-82-2/9/index.htmlHere we consider the linear-fractional non-homogeneous flow programming optimization problem with additional constraints of general kind. We obtain the increment of the objective function using network properties of the problem and principles of decomposition of a support. In the received formulas for calculation of reduced costs only the part of system of potentials is used
This thesis deals with optimization of flows in a network with focus on solutions based on linear pr...
Fractional programming consists in optimizing a ratio of two functions subject to some constraints. ...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
Полный текст статьи можно найти по адресу: http://www.ijpam.eu/contents/2016-109-3/18/index.htmlFor...
For an linear non-homogeneous flow programming problem with additional constraints of general kind a...
Полный текст статьи можно найти по адресу: http://proceedings.aip.org/resource/2/apcpcs/1410/1/346_...
Primal support relaxation algorithm is considered for the network problem of the fractional programm...
Abstract: For the one linear-fractional network programming problem with additional constraints of g...
We consider one extremal linear non-homogeneous problem of flow programming with additional constrai...
В статье рассматривается математическая модель экстремальной задачи потокового программирования с др...
A direct exact relaxation algorithm is considered for the network problem of the fractional programm...
In this paper, we propose the mathematical models of the inverse optimization for modeling parameter...
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by addi...
We construct a general solution for a system of linear equations corresponding to the system of main...
Полный текст статьи можно найти по адресу: http://ijpam.eu/contents/2013-82-2/9/index.htmlHere we c...
This thesis deals with optimization of flows in a network with focus on solutions based on linear pr...
Fractional programming consists in optimizing a ratio of two functions subject to some constraints. ...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
Полный текст статьи можно найти по адресу: http://www.ijpam.eu/contents/2016-109-3/18/index.htmlFor...
For an linear non-homogeneous flow programming problem with additional constraints of general kind a...
Полный текст статьи можно найти по адресу: http://proceedings.aip.org/resource/2/apcpcs/1410/1/346_...
Primal support relaxation algorithm is considered for the network problem of the fractional programm...
Abstract: For the one linear-fractional network programming problem with additional constraints of g...
We consider one extremal linear non-homogeneous problem of flow programming with additional constrai...
В статье рассматривается математическая модель экстремальной задачи потокового программирования с др...
A direct exact relaxation algorithm is considered for the network problem of the fractional programm...
In this paper, we propose the mathematical models of the inverse optimization for modeling parameter...
Michael Holzhauser discusses generalizations of well-known network flow and packing problems by addi...
We construct a general solution for a system of linear equations corresponding to the system of main...
Полный текст статьи можно найти по адресу: http://ijpam.eu/contents/2013-82-2/9/index.htmlHere we c...
This thesis deals with optimization of flows in a network with focus on solutions based on linear pr...
Fractional programming consists in optimizing a ratio of two functions subject to some constraints. ...
AbstractThe linear fractional programming (LFP) algorithms attempt to optimize a quotient of two lin...
Add to ORKG