default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitrii Lozovanu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c12]Dmitrii Lozovanu
, Stefan Pickl:
Determining Nash Equilibria for Stochastic Positional Games with Discounted Payoffs. ADT 2017: 339-343- 2016
- [j27]Dmitrii Lozovanu, Stefan Pickl:
Determining the Optimal Strategies for Zero-Sum Average Stochastic Positional Games. Electron. Notes Discret. Math. 55: 155-159 (2016) - 2015
- [j26]Dmitrii Lozovanu, Stefan Pickl:
Determining the optimal strategies for discrete control problems on stochastic networks with discounted costs. Discret. Appl. Math. 182: 169-180 (2015) - [c11]Dmitrii Lozovanu:
Determining the Optimal Strategies for Stochastic Positional Games with Discounted Payoffs. CSCS 2015: 393-396 - [i2]Dmitrii Lozovanu, Stefan Pickl:
Determining Nash Equilibria for Dynamic Positional Games on Networks. CTW 2015: 153-156 - 2013
- [i1]Dmitrii Lozovanu, Stefan Pickl:
Optimal paths in networks with rated transition time costs. CTW 2013: 165-168 - 2012
- [c10]Dmitrii Lozovanu, Stefan Pickl:
Nash Equilibria Conditions for Stochastic Cyclic Games on Networks. CTW 2012: 185-188 - 2011
- [j25]Dmitrii Lozovanu:
The game-theoretical approach to Markov decision problems and determining Nash equilibria for stochastic positional games. Int. J. Math. Model. Numer. Optimisation 2(2): 162-174 (2011) - [c9]Dmitrii Lozovanu, Stefan Pickl:
Discounted Markov Decision Processes and Algorithms for Solving Stochastic Control Problem on Networks. CTW 2011: 194-197 - [c8]Dmitrii Lozovanu, Stefan Pickl:
Determining the Optimal Strategies for Antagonistic Positional Games in Markov Decision Processes. OR 2011: 229-234 - 2010
- [c7]Dmitrii Lozovanu, Stefan Pickl:
Determining Optimal Stationary Strategies for Discounted Stochastic Optimal Control Problem on Networks. CTW 2010: 115-118 - [c6]Dmitrii Lozovanu, Stefan Pickl:
Optimal stationary control of discrete processes and a polynomial time algorithm for stochastic control problem on networks. ICCS 2010: 1417-1426
2000 – 2009
- 2009
- [j24]Dmitrii Lozovanu, Stefan Pickl:
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. Central Eur. J. Oper. Res. 17(3): 255-264 (2009) - [c5]Dmitrii Lozovanu, Stefan Pickl:
Algorithmic Solutions of Discrete Control Problems on Stochastic Networks. CTW 2009: 221-224 - 2008
- [j23]Dmitrii Lozovanu, Stefan Pickl:
A constructive algorithm for max-min paths problems on energy networks. Appl. Math. Comput. 204(2): 602-608 (2008) - 2007
- [j22]Dmitrii Lozovanu, Stefan Pickl:
Algorithms for solving multiobjective discrete control problems and dynamic c-games on networks. Discret. Appl. Math. 155(14): 1846-1857 (2007) - [j21]Dmitrii Lozovanu, Stefan Pickl:
Algorithms and the calculation of Nash equilibria for multi-objective control of time-discrete systems and polynomial-time algorithms for dynamic c. Eur. J. Oper. Res. 181(3): 1214-1232 (2007) - [c4]Dmitrii Lozovanu, Stefan Pickl:
Multiobjective hierarchical control of time-discrete systems and dtermining Stackelberg strategies. CTW 2007: 111-114 - 2006
- [j20]Dmitrii Lozovanu, Stefan Pickl:
An approach for an algorithmic solution of discrete optimal control problems and their game-theoretical extension. Central Eur. J. Oper. Res. 14(4): 357-375 (2006) - [j19]Dmitrii Lozovanu, Maria Fonoberova:
Optimal Dynamic Multicommodity Flows in Networks. Electron. Notes Discret. Math. 25: 93-100 (2006) - [j18]Dmitrii Lozovanu, Stefan Pickl:
Nash Equilibria Conditions for Cyclic Games with p Players. Electron. Notes Discret. Math. 25: 123-129 (2006) - 2005
- [j17]Maria Fonoberova, Dmitrii Lozovanu:
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving. Comput. Sci. J. Moldova 13(1): 29-36 (2005) - [j16]Dmitrii Lozovanu:
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games. Comput. Sci. J. Moldova 13(2): 115-130 (2005) - [j15]Maria Fonoberova, Dmitrii Lozovanu:
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks. Comput. Sci. J. Moldova 13(2): 168-176 (2005) - 2004
- [j14]Maria Fonoberova, Dmitrii Lozovanu:
The maximum flow in dynamic networks. Comput. Sci. J. Moldova 12(3): 387-396 (2004) - [j13]Dmitrii Lozovanu, Stefan Pickl:
A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks. Electron. Notes Discret. Math. 17: 209-214 (2004) - [c3]Dmitrii Lozovanu, Stefan Wolfgang Pickl:
A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks. CTW 2004: 184-188 - [c2]Dmitrii Lozovanu:
Polynomial Time Algorithm for Determining Optimal Strategies in Cyclic Games. IPCO 2004: 74-85 - 2003
- [j12]Dmitrii Lozovanu:
Polynomial time algorithm for solving cyclic games. Comput. Sci. J. Moldova 11(2): 107-123 (2003) - [j11]Dmitrii Lozovanu, Stefan Pickl:
Polynomial Time Algorithms for Determining Optimal Strategies. Electron. Notes Discret. Math. 13: 64-68 (2003) - 2002
- [j10]Dmitrii Lozovanu, Vitaly I. Voloshin, Alex Zelikovsky:
A note on the colorability of mixed hypergraph using k colors. Comput. Sci. J. Moldova 10(1): 92-95 (2002) - [j9]Dmitrii Lozovanu:
Discrete Control Processes, Dynamic Games and Multicriterion Control. Comput. Sci. J. Moldova 10(2): 125-135 (2002) - [j8]A. Iusiumbeli, Dmitrii Lozovanu:
Algorithms for solving discrete control problems on networks. Comput. Sci. J. Moldova 10(3): 333-340 (2002) - [c1]Dmitrii Lozovanu, Dan Stratila:
Optimal flow in dynamic networks with nonlinear cost functions on edges. Analysis and Optimization of Differential Systems 2002: 247-258 - 2001
- [j7]Dmitrii Lozovanu, O. Codreanu:
A generalization of the optimality for multicriterion problems. Comput. Sci. J. Moldova 9(1): 86-92 (2001) - [j6]Dmitrii Lozovanu:
Discrete optimal control problems and dynamic games with p players. Electron. Notes Discret. Math. 8: 58-61 (2001) - 2000
- [j5]Dmitrii Lozovanu, Vitaly I. Voloshin:
Integer programming models for colorings of mixed hypergraphs. Comput. Sci. J. Moldova 8(1): 64-74 (2000) - [j4]Rodica Boliac, Dmitrii Lozovanu, D. Solomon:
Optimal Paths in Network Games with P Players. Discret. Appl. Math. 99(1-3): 339-348 (2000)
1990 – 1999
- 1998
- [j3]Dmitrii Lozovanu, C. Petic:
Algorithms for finding the minimum cycle mean in the weighted directed graph. Comput. Sci. J. Moldova 6(1): 27-34 (1998) - 1997
- [j2]Rodica Boliac, Dmitrii Lozovanu:
Algorithms for finding optimal paths in network games with p players. Comput. Sci. J. Moldova 5(2): 236-247 (1997) - 1995
- [j1]Dmitrii Lozovanu, J. Solomon:
The problem of the synthesis of a transport network with a single source and the algorithm for its solution. Comput. Sci. J. Moldova 3(2): 161-167 (1995)
Coauthor Index
aka: Stefan Wolfgang Pickl
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
