Add to ORKGFor a distributive flow programming optimization problem of a special structure direct and dual algorithms are constructed. These algorithms are based on a research of the theoretical and graph properties of the solution space bases. Optimality conditions are received, that allow to calculate a part of the components of the Lagrange vector. Algorithms that decompose calculation systems for pseudo-plans of the problem are presented. Suitable directions for change of the dual criterion function are constructed
In this paper, we propose the mathematical models of the inverse optimization for modeling parameter...
We propose the theory of decomposition, methods, technologies, applications and pseudocodes of algor...
abstract: this book reports on the state of the art in application of deterministic network optimiza...
The direct and the dual methods of constructing optimal and suboptimal solutions of one inhomogeneou...
For a distributive flow programming optimization problem of a special structure direct and dual algo...
This thesis deals with optimization of flows in a network with focus on solutions based on linear pr...
The goal of this paper is to provide a basic overview of several different operations research probl...
A new algorithm for generating structured, minimum cost network flow problems (transshipment, transp...
15.082J/6.855J is an H-level graduate subject in the theory and practice of network flows and its ex...
International audienceCombinatorial Optimization is one of the fields in mathematics with an impress...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
For an linear non-homogeneous flow programming problem with additional constraints of general kind a...
When it comes to maximization of effectively or minimizing of cost, optimization represents the key ...
In this thesis, a number of optimization problems are presented from algorithmic graph theory. This ...
There are a number of large networks which occur in many problems dealing with the flow of power, co...
In this paper, we propose the mathematical models of the inverse optimization for modeling parameter...
We propose the theory of decomposition, methods, technologies, applications and pseudocodes of algor...
abstract: this book reports on the state of the art in application of deterministic network optimiza...
The direct and the dual methods of constructing optimal and suboptimal solutions of one inhomogeneou...
For a distributive flow programming optimization problem of a special structure direct and dual algo...
This thesis deals with optimization of flows in a network with focus on solutions based on linear pr...
The goal of this paper is to provide a basic overview of several different operations research probl...
A new algorithm for generating structured, minimum cost network flow problems (transshipment, transp...
15.082J/6.855J is an H-level graduate subject in the theory and practice of network flows and its ex...
International audienceCombinatorial Optimization is one of the fields in mathematics with an impress...
We consider the problem of finding the minimum cost of a feasible flow in directed networks. We allo...
For an linear non-homogeneous flow programming problem with additional constraints of general kind a...
When it comes to maximization of effectively or minimizing of cost, optimization represents the key ...
In this thesis, a number of optimization problems are presented from algorithmic graph theory. This ...
There are a number of large networks which occur in many problems dealing with the flow of power, co...
In this paper, we propose the mathematical models of the inverse optimization for modeling parameter...
We propose the theory of decomposition, methods, technologies, applications and pseudocodes of algor...
abstract: this book reports on the state of the art in application of deterministic network optimiza...