The problem of the synthesis of a transport network with a single source and the algorithm for its solution. - Dmitrii Lozovanu; J. Solomon (Comput. Sci. J. Moldova, 1995)

Algorithms for finding optimal paths in network games with p players. - Rodica Boliac; Dmitrii Lozovanu (Comput. Sci. J. Moldova, 1997)

Algorithms for finding the minimum cycle mean in the weighted directed graph. - Dmitrii Lozovanu; C. Petic (Comput. Sci. J. Moldova, 1998)

Integer programming models for colorings of mixed hypergraphs. - Dmitrii Lozovanu; Vitaly I. Voloshin (Comput. Sci. J. Moldova, 2000)

Optimal Paths in Network Games with P Players. - Rodica Boliac; Dmitrii Lozovanu; D. Solomon (Discret. Appl. Math., 2000)

A generalization of the optimality for multicriterion problems. - Dmitrii Lozovanu; O. Codreanu (Comput. Sci. J. Moldova, 2001)

Discrete optimal control problems and dynamic games with p players. - Dmitrii Lozovanu (Electron. Notes Discret. Math., 2001)

Optimal flow in dynamic networks with nonlinear cost functions on edges. - Dmitrii Lozovanu; Dan Stratila (Analysis and Optimization of Differential Systems, 2002)

Algorithms for solving discrete control problems on networks. - A. Iusiumbeli; Dmitrii Lozovanu (Comput. Sci. J. Moldova, 2002)

Discrete Control Processes, Dynamic Games and Multicriterion Control. - Dmitrii Lozovanu (Comput. Sci. J. Moldova, 2002)

A note on the colorability of mixed hypergraph using k colors. - Dmitrii Lozovanu; Vitaly I. Voloshin; Alex Zelikovsky (Comput. Sci. J. Moldova, 2002)

Polynomial time algorithm for solving cyclic games. - Dmitrii Lozovanu (Comput. Sci. J. Moldova, 2003)

Polynomial Time Algorithms for Determining Optimal Strategies. - Dmitrii Lozovanu; Stefan Pickl (Electron. Notes Discret. Math., 2003)

Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games. - Dmitrii Lozovanu (IPCO, 2004)

The maximum flow in dynamic networks. - Maria Fonoberova; Dmitrii Lozovanu (Comput. Sci. J. Moldova, 2004)

A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks. - Dmitrii Lozovanu; Stefan Pickl (Electron. Notes Discret. Math., 2004)

The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving. - Maria Fonoberova; Dmitrii Lozovanu (Comput. Sci. J. Moldova, 2005)

Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks. - Maria Fonoberova; Dmitrii Lozovanu (Comput. Sci. J. Moldova, 2005)

Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games. - Dmitrii Lozovanu (Comput. Sci. J. Moldova, 2005)

An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension. - Dmitrii Lozovanu; Stefan Pickl (Central Eur. J. Oper. Res., 2006)

Optimal Dynamic Multicommodity Flows in Networks. - Dmitrii Lozovanu; Maria Fonoberova (Electron. Notes Discret. Math., 2006)

Nash Equilibria Conditions for Cyclic Games with p Players. - Dmitrii Lozovanu; Stefan Pickl (Electron. Notes Discret. Math., 2006)

Multiobjective hierarchical control of time-discrete systems and dtermining Stackelberg strategies. - Dmitrii Lozovanu; Stefan Pickl (CTW, 2007)

Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks. - Dmitrii Lozovanu; Stefan Pickl (Discret. Appl. Math., 2007)

Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic c. - Dmitrii Lozovanu; Stefan Pickl (Eur. J. Oper. Res., 2007)

A constructive algorithm for max-min paths problems on energy networks. - Dmitrii Lozovanu; Stefan Pickl (Appl. Math. Comput., 2008)

Algorithmic Solutions of Discrete Control Problems on Stochastic Networks. - Dmitrii Lozovanu; Stefan Pickl (CTW, 2009)

Algorithms for solving discrete optimal control problems with infinite time horizon and determining minimal mean cost cycles in a directed graph as decision support tool. - Dmitrii Lozovanu; Stefan Pickl (Central Eur. J. Oper. Res., 2009)

Determining Optimal Stationary Strategies for Discounted Stochastic Optimal Control Problem on Networks. - Dmitrii Lozovanu; Stefan Pickl (CTW, 2010)

Optimal stationary control of discrete processes and a polynomial time algorithm for stochastic control problem on networks. - Dmitrii Lozovanu; Stefan Pickl (ICCS, 2010)

Discounted Markov Decision Processes and Algorithms for Solving Stochastic Control Problem on Networks. - Dmitrii Lozovanu; Stefan Pickl (CTW, 2011)

Determining the Optimal Strategies for Antagonistic Positional Games in Markov Decision Processes. - Dmitrii Lozovanu; Stefan Pickl (OR, 2011)

The game-theoretical approach to Markov decision problems and determining Nash equilibria for stochastic positional games. - Dmitrii Lozovanu (Int. J. Math. Model. Numer. Optimisation, 2011)

Nash Equilibria Conditions for Stochastic Cyclic Games on Networks. - Dmitrii Lozovanu; Stefan Pickl (CTW, 2012)

Optimal paths in networks with rated transition time costs. - Dmitrii Lozovanu; Stefan Pickl (CTW, 2013)

Determining Nash Equilibria for Dynamic Positional Games on Networks. - Dmitrii Lozovanu; Stefan Pickl (CTW, 2015)

Determining the Optimal Strategies for Stochastic Positional Games with Discounted Payoffs. - Dmitrii Lozovanu (CSCS, 2015)

Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs. - Dmitrii Lozovanu; Stefan Pickl (Discret. Appl. Math., 2015)

Determining the Optimal Strategies for Zero-Sum Average Stochastic Positional Games. - Dmitrii Lozovanu; Stefan Pickl (Electron. Notes Discret. Math., 2016)

Determining Nash Equilibria for Stochastic Positional Games with Discounted Payoffs. - Dmitrii Lozovanu; Stefan Pickl (ADT, 2017)