RO EN
An algorithm for solving the transport problem on network with concave cost functions of flow on edges
Authors: Lozovanu Dmitrii, T. Pasha
– 0.14 Mb
Abstract
We study the transport problem on network with concave cost function of flow on edges. An heuristic algorithm for solving this problem is proposed, and an implementation for solving allocation problem is given.Dumitru Lozovanu
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5, Academy str.,Chisinau
MD2028, Moldova
Phone: 73-35-83
E-mail:
Tatiana Pasha
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5, Academy str.,Chisinau
MD2028, Moldova
E-mail:
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5, Academy str.,Chisinau
MD2028, Moldova
Phone: 73-35-83
E-mail:
Tatiana Pasha
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5, Academy str.,Chisinau
MD2028, Moldova
E-mail:
Fulltext
– 0.14 Mb
Contents
- Nine Universal Circular Post Machines
- On enhanced time-varying distributed H systems
- Biocomputing system of living cells
- The splitting method and Poincare's theorem: (I) - the geometric part
- Sensitivity analysis of efficient solution in vector MINMAX boolean programming problem
- Algorithms for solving discrete control problems on networks
- An algorithm for solving the transport problem on network with concave cost functions of flow on edges
- Abstracts of Dr.hab. Theses
- The CSJM's 10th anniversary
