Lozovanu Dmitrii
 |
|
Domeniul de cercetare
Optimizarea discretă, analiza şi proiectarea algoritmilor, teoria jocurilor şi controlul optimalLucrări importante
- Optimal Dynamic Multicommodity Flows in Networks.
CTWO6 Workshop on Graphs and Combinatorial Optimization, Germany (2006). (with M. Fonoberova). - Nash Equilibria for Multiobjective Control of Time-Discrete Systems and Polynomial-Time Algorithm for k-partite Networks.
Central European Journal of Operation Research 13(2) (2005), pp. 127--146. (with S. Pickl). - Parametrical approach for studying and solving bilinear programming problem.
Proceedings of the International Workshop on Global Optimization, San Jose, Almeria, Spain (2005), pp. 165-170. - Optimization, monotonicity and the determination of Nash equilibrium – an algorithmic analysis.
Computing Anticipatory Systems: Conference Proceedings CASYS’03 ISBN 0-7354-0198-5 (2004), pp. 351-361. (with S. Pickl, G.-W. Weber). - Polynomial time algorithm for determining optimal strategies in cyclic games.
IPCO 2004 Conference Proceedings, New York, Springer (2004), pp. 74-85. - Polynomial time algorithm for determining optimal strategies.
Electronic Notes in Discrete Mathematics, 13, (2003), pp. 32-41. (with S. Pickl). - Optimal flow in dynamic networks with nonlinear cost functions on edges.
Analysis and optimization of differential systems. (Edited by V.Barbu, I.Lasiecka), ISBN 1-4020-7439-5. Kluwer Academic Publishers, (2003), pp. 247-258. (with D. Stratila). - Networks models of discrete optimal control and dynamic games with p players.
Discrete Mathematics and Applications, 13, 4, (2001), pp. 126-143. - Optimal paths in network games with p players.
Discrete Applied Mathematics, 99, 1-3, (2000), pp. 339-348. (with R. Boliac, D. Solomon).
Apartenenţa la societăţi, redacţii
- Membru Consiliului ştiinţific INTAS (2003-2006).
- Societatea Matematică din Republica Moldova (SMRM).
- Membru Colegiului de Redacţie a revistei „Buletinul Academiei de ştiinţe al Republicii Moldova. Matematica”.
- Membru Colegiului de Redacţie a revistei „Computer Science Journal of Moldova”.
Distincţii
- Premiu de Stat in Domeniul ştiinţei, Tehnicii şi Producţiei (1998).
- Premiu „Best Paper Award” la simposionul „Computing Systems, Discrete Models, Algorithm, Simulation, Information Systems, Networks” pentru contribuţia „Optimization, Monotonicity and the Determination of Nash Equilibria – An Algorithmic Analysis”, CASYS’03 Liege, Belgium, August 11-16, 2003.
- Laureat al premiului academicianului Sibirsky (2004).
- Premiu Academiei de Ştiinţe a Moldovei (2006).
Publicaţii în Computer Science Journal of Moldova şi Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica
- 2010 An Approach for Determining the Matrix of Limiting State Probabilities in Discrete Markov Processes.
- 2009 Dynamic Programming Algorithms for Solving Stochastic Discrete Control Problems.
- 2008 Discrete Optimal Control Problem with Varying Time of States Transactions of Dynamical System and Algorithm for its solving.
- 2007 Parametrical Approach for Bilinear Programming and its Application for solving Integer and Combinatorial Optimization Problems.
- 2007 Minimum Cost Multicommodity Flows in Dynamic Networks and Algorithms for their Finding.
- 2006 A Linear Parametrical Programming Approach for Studying and Solving Bilinear Programming Problem.
- 2006 Dynamic Programming Approach for Solving Discrete Optimal Control Problem and its Multicriterion Version.
- 2005 Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
- 2005 Multiobjective Games and Determining Pareto-Nash Equilibria.
- 2005 Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks
- 2005 The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
- 2005 Optimal multicommodity flows in dynamic networks and algorithms for their finding.
- 2004 The maximum flow in dynamic networks
- 2004 The optimal flow in dynamic networks with nonlinear cost functions on edges. (English)
- 2004 Discrete optimal control problems on networks and dynamic games with p players.
- 2003 Polynomial time algorithm for solving cyclic games
- 2002 Algorithms for finding the optimal strategies in dynamic games on networks. (English)
- 2002 Algorithms for solving discrete control problems on networks
- 2002 An algorithm for solving the transport problem on network with concave cost functions of flow on edges
- 2002 Discrete Control Processes, Dynamic Games and Multicriterion Control
- 2002 A generalization of the knapsack problem and finding the k-optimal tree in a weighted digraph. (English)
- 2002 A note on the colorability of mixed hypergraph using k colors
- 2001 The minimum-cost flow problem on dynamic networks and an algorithm for its solving.
- 2001 A generalization of the optimality for multicriterion problems
- 2000 An extension of the optimality notion for multicriterion problems. (English)
- 2000 Integer programming models for colorings of mixed hypergraphs
- 2000 Dynamic games with $p$ players on networks. (English)
- 1999 Optimal paths in dynamic networks. (English)
- 1998 Algorithms for finding the minimum cycle mean in the weighted directed graph
- 1997 Algorithms for finding optimal paths in network games with p players
- 1996 A network transportation problem with concave cost functions of the flow on network edges, and its applications. (Russian)
- 1996 Determination of the tree of minimax paths in a weighted digraph. (Russian)
- 1995 The problem of the synthesis of a transport network with a single source and the algorithm for its solution
- 1994 Algorithms of choice of optimal configurations in weighted digraphs. (Russian)
- 1993 On solution of problems of integer programming. (Russian)
- 1992 On a parametrical method for solving bicriterion max-min fractional problems. (English)
- 1991 On the search for minimax paths in networks. (Russian)
- 1990 Use of the embeddability properties of polyhedral sets in the study and solution of some special classes of problems. (Russian)
- 1990 Maximin linear problems with connected variables and their applications to the study and solution of cyclic games. (Russian)
