RO EN
Algorithms for solving discrete control problems on networks
Authors: A. Iusiumbeli, Lozovanu Dmitrii
– 0.15 Mb
Abstract
We consider the discrete optimal problem on networks with integral-time cost criterion by a trajectory when the starting and final states of the system are fixed. A polynomial-time algorithm for solving this problem is proposed.A. Iusiumbeli
The Department of Mathematics and Computer Science
The State University of Moldova
60, Mateevici str.,
277709, Chisinau, Moldova
E-mail:
D. Lozovanu
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5, Academy str.,Chisinau
MD2028, Moldova.
Phone: 73-35-83
E-mail:
The Department of Mathematics and Computer Science
The State University of Moldova
60, Mateevici str.,
277709, Chisinau, Moldova
E-mail:
D. Lozovanu
Institute of Mathematics and Computer Science
Academy of Sciences of Moldova
5, Academy str.,Chisinau
MD2028, Moldova.
Phone: 73-35-83
E-mail:
Fulltext
– 0.15 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
