![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Michal Koháni
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c11]Michal Koháni, Stanislav Babcan:
Variable Neighborhood Search for the Electric Bus Charging Stations Location Design Problem. ICORES 2024: 317-324 - 2021
- [c10]Dobroslav Grygar, Michal Koháni:
Simulated annealing metaheuristic with greedy improvement for road segments selection problem. IDT 2021: 189-193 - 2020
- [c9]Maros Janovec
, Michal Koháni:
Comparison of Continuous and Discontinuous Charging Models for the Electric Bus Scheduling Problem. ICORES 2020: 179-186 - [c8]Dobroslav Grygar, Michal Koháni:
Linear Model Adjustment and Approximate Approach for Creating Minimal Overhead Wires Network for Vehicle Schedules. ICORES 2020: 187-193
2010 – 2019
- 2019
- [c7]Maros Janovec
, Michal Koháni:
Data Reduction Algorithm for the Electric Bus Scheduling Problem. OR 2019: 805-812 - 2018
- [c6]Peter Czimmermann
, Michal Koháni:
Computation of Transportation Performance in Public Service Systems. COMPENG 2018: 1-5 - 2017
- [c5]Michal Koháni, Peter Czimmermann
, Michal Vána, Matej Cebecauer, LuboasBuzna:
Designing Charging Infrastructure for a Fleet of Electric Vehicles Operating in Large Urban Areas. ICORES 2017: 360-368 - [c4]Michal Koháni
, Jaroslav Janácek:
Acceleration strategies of the column generation method for the crew scheduling problem. SOLI 2017: 54-57 - 2015
- [c3]Michal Koháni:
OD Matrix Estimation Using Smart Card Transactions Data and Its Usage for the Tariff Zones Determination in the Public Transport. OR 2015: 231-236 - 2014
- [j2]Lubos Buzna, Michal Koháni
, Jaroslav Janácek:
An Approximation Algorithm for the Facility Location Problem with Lexicographic Minimax Objective. J. Appl. Math. 2014: 562373:1-562373:12 (2014) - [c2]Lubos Buzna, Michal Koháni, Jaroslav Janácek:
An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem. OR 2014: 71-76 - 2012
- [c1]Michal Koháni, Lubos Buzna, Jaroslav Janácek:
Impact of Utility Function to Service Center Location in Public Service System. OR 2012: 129-134 - 2011
- [j1]Peter Matis, Michal Koháni
:
Very large street routing problem with mixed transportation mode. Central Eur. J. Oper. Res. 19(3): 359-369 (2011)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint