default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Ejov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j14]Pouya Baniasadi, Mehdi Foumani
, Kate Smith-Miles, Vladimir Ejov:
A transformation technique for the clustered generalized traveling salesman problem with applications to logistics. Eur. J. Oper. Res. 285(2): 444-457 (2020)
2010 – 2019
- 2019
- [j13]Konstantin Avrachenkov, Vladimir Ejov, Jerzy A. Filar, Amir Moghaddam:
Zero-Sum Stochastic Games over the Field of Real Algebraic Numbers. Dyn. Games Appl. 9(4): 1026-1041 (2019) - [i6]Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine:
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian Cycle Problem. CoRR abs/1902.10337 (2019) - 2018
- [j12]Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, John F. Roddick, Serguei Rossomakhine:
A note on using the resistance-distance matrix to solve Hamiltonian cycle problem. Ann. Oper. Res. 261(1-2): 393-399 (2018) - [i5]Pouya Baniasadi, Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine:
A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem. CoRR abs/1806.09285 (2018) - 2017
- [i4]Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine:
Using a Hamiltonian cycle problem algorithm to assist in solving difficult instances of Traveling Salesman Problem. CoRR abs/1705.06855 (2017) - [i3]Maria Kleshnina, Jerzy A. Filar, Vladimir Ejov, Jody C. McKerral:
Evolutionary games under incompetence. CoRR abs/1710.09499 (2017) - 2015
- [j11]Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine:
A linear-size conversion of HCP to 3HCP. Australas. J Comb. 62: 45-58 (2015) - 2014
- [j10]Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Serguei Rossomakhine:
Deterministic "Snakes and Ladders" Heuristic for the Hamiltonian cycle problem. Math. Program. Comput. 6(1): 55-75 (2014) - 2013
- [i2]Vladimir Ejov, Michael Haythorpe, Serguei Rossomakhine:
A Linear-size Conversion of HCP to 3HCP. CoRR abs/1305.4729 (2013) - 2012
- [j9]Justin D. Beck, Vladimir Ejov, Jerzy A. Filar:
Incompetence and impact of training in bimatrix games. Autom. 48(10): 2400-2408 (2012) - [i1]Pouya Baniasadi, Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe:
Genetic Theory for Cubic Graphs. CoRR abs/1209.5514 (2012)
2000 – 2009
- 2009
- [j8]Nelly Litvak, Vladimir Ejov:
Markov Chains and Optimality of the Hamiltonian Cycle. Math. Oper. Res. 34(1): 71-82 (2009) - [j7]Vladimir Ejov, Jerzy A. Filar, Michael Haythorpe, Giang T. Nguyen:
Refined MDP-Based Branch-and-Fix Algorithm for the Hamiltonian Cycle Problem. Math. Oper. Res. 34(3): 758-768 (2009) - [j6]Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar:
On the Hamiltonicity Gap and doubly stochastic matrices. Random Struct. Algorithms 34(4): 502-519 (2009) - 2008
- [j5]Vladimir Ejov, Jerzy A. Filar, Walter Murray, Giang T. Nguyen:
Determinants and Longest Cycles of Graphs. SIAM J. Discret. Math. 22(3): 1215-1225 (2008) - 2006
- [j4]Vladimir Ejov, Jerzy A. Filar:
Gröbner bases in Asymptotic Analysis of Perturbed Polynomial Programs. Math. Methods Oper. Res. 64(1): 1-16 (2006) - 2004
- [j3]Vladimir Ejov, Jerzy A. Filar, Jacek Gondzio:
An Interior Point Heuristic for the Hamiltonian Cycle Problem via Markov Decision Processes. J. Glob. Optim. 29(3): 315-334 (2004) - [j2]Vladimir Ejov, Jerzy A. Filar, Minh-Tuan Nguyen:
Hamiltonian Cycles and Singularly Perturbed Markov Chains. Math. Oper. Res. 29(1): 114-131 (2004) - [j1]Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar:
Directed graphs, Hamiltonicity and doubly stochastic matrices. Random Struct. Algorithms 25(4): 376-395 (2004) - 2003
- [c1]Phil G. Howlett, Vladimir Ejov, Konstantin Avrachenkov:
Inversion of perturbed linear operators that are singular at the origin. CDC 2003: 5628-5631
Coauthor Index
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-04-25 05:44 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:
