default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Y. Krylatov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Alexander Y. Krylatov
, Anastasiya Raevskaya, Petr Ageev:
Optimization strategies for the bilevel network design problem with affine cost functions. Ann. Math. Artif. Intell. 91(2-3): 329-347 (2023)- [j7]Alexander Y. Krylatov:
Sequential path-equilibration algorithm for highly accurate traffic flow assignment in an urban road network. Optim. Methods Softw. 38(5): 1081-1104 (2023) - 2022
- [j6]Alexander Y. Krylatov, Yu. E. Lonyagina:
Equilibrium Flow Assignment in a Network of Homogeneous Goods. Autom. Remote. Control. 83(5): 805-827 (2022) - [j5]Alexander Y. Krylatov:
Column generation for the equilibrium route-flow traffic assignment problem. Ann. Math. Artif. Intell. 90(7-9): 697-713 (2022) - [c9]Alexander Y. Krylatov, Yu. E. Lonyagina, Anastasiya Raevskaya:
Competitive Supply Allocation in a Distribution Network Under Overproduction. LION 2022: 220-231 - 2021
- [c8]Alexander Y. Krylatov, Anastasiya Raevskaya:
Travel Demand Estimation in a Multi-subnet Urban Road Network. LION 2021: 183-197 - [c7]Alexander Y. Krylatov:
Equilibrium Traffic Flow Assignment in a Multi-subnet Urban Road Network. MOTOR 2021: 3-16 - 2020
- [c6]Alexander Y. Krylatov, Anastasiya Raevskaya:
Travel Times Equilibration Procedure for Route-Flow Traffic Assignment Problem. LION 2020: 68-79
2010 – 2019
- 2017
- [j4]Ivan Popov, Alexander Y. Krylatov, Victor V. Zakharov, Dmitry A. Ivanov:
Competitive energy consumption under transmission constraints in a multi-supplier power grid system. Int. J. Syst. Sci. 48(5): 994-1001 (2017) - [c5]Alexander Y. Krylatov, Anastasiya P. Shirokolobova:
Projection Approach Versus Gradient Descent for Network's Flows Assignment Problem. LION 2017: 345-350 - 2016
- [j3]Victor V. Zakharov, Alexander Yu. Krylatov:
Competitive routing of traffic flows by navigation providers. Autom. Remote. Control. 77(1): 179-189 (2016) - [j2]Alexander Y. Krylatov, Victor V. Zakharov:
Competitive Traffic Assignment in a Green Transit Network. IGTR 18(2): 1640003:1-1640003:14 (2016) - [j1]Alexander Y. Krylatov, Anastasiya P. Shirokolobova, Victor V. Zakharov:
OD-matrix estimation based on a dual formulation of traffic assignment problem. Informatica (Slovenia) 40(4) (2016) - [c4]Ivan Popov, Alexander Y. Krylatov, Victor V. Zakharov:
Integrated Smart Energy System Based on Production-Oriented Consumption. PRO-VE 2016: 265-273 - 2015
- [c3]Victor V. Zakharov, Alexander Y. Krylatov:
Transit Network Design for Green Vehicles Routing. MCO (2) 2015: 449-458 - 2014
- [c2]Victor V. Zakharov, Alexander Y. Krylatov:
Equilibrium Assignments in Competitive and Cooperative Traffic Flow Routing. PRO-VE 2014: 641-648 - 2013
- [c1]Victor V. Zakharov, Alexander Y. Krylatov, Dmitry A. Ivanov:
Equilibrium Traffic Flow Assignment in Case of Two Navigation Providers. PRO-VE 2013: 156-163
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-06-10 20:31 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:
