default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJaroslav Janácek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c28]Marek Kvet, Jaroslav Janácek:
Multi-Criteria Service System Designing Using Tabu Search Method. ICORES 2024: 193-199- [c27]Jaroslav Janácek, Marek Kvet:
Pareto Front Approximation by Ant Colony Optimization. ICORES 2024: 200-206 - [c26]Jaroslav Janácek:
A Bug in Linux ACL Implementation. ITAT 2024: 216-222 - 2023
- [c25]Marek Kvet, Jaroslav Janácek:
Hyperheuristics for Determination of Non-dominated Set of Public Service System Designs. FRUCT 2023: 155-160 - 2021
- [j9]Jaroslav Janácek
, René Fabricius:
Public Service System Design With Conflicting Criteria. IEEE Access 9: 130665-130679 (2021) - [j8]Jaroslav Janácek, Marek Kvet:
Efficient incrementing heuristics for generalized p-location problems. Central Eur. J. Oper. Res. 29(3): 989-1000 (2021) - [c24]Marek Kvet, Jaroslav Janácek, Michal Kvet:
Selected Approximate Approaches to Robust Emergency Service System Design. ICORES (Selected Papers) 2021: 56-82 - [c23]Jaroslav Janácek, Marek Kvet:
Customization of Uniformly Deployed Set Kit for Path-relinking Method. IDT 2021: 19-23 - 2020
- [c22]Jaroslav Janácek, Marek Kvet:
Efficiency of Meme Usage in Evolutionary Algorithm. ICORES 2020: 165-171 - [c21]Marek Kvet, Jaroslav Janácek:
Robust Emergency System Design using Reengineering Approach. ICORES 2020: 172-178
2010 – 2019
- 2019
- [c20]Marek Kvet, Jaroslav Janácek:
Usage of Uniform Deployment for Heuristic Design of Emergency System. OR 2019: 309-314 - [c19]Jaroslav Janácek, Marek Kvet:
Uniform Deployment of the p-Location Problem Solutions. OR 2019: 315-321 - 2018
- [j7]Marek Kvet, Jaroslav Janácek:
Fair emergency system design under uncertainty. Central Eur. J. Oper. Res. 26(3): 599-609 (2018) - [c18]Jaroslav Janácek, Marek Kvet:
Online Learning Search for Stackelberg Game Strategy. COMPENG 2018: 1-4 - [c17]Marek Kvet, Jaroslav Janácek:
Comprehensive Network Arc Characteristic Relative to Public Service System. COMPENG 2018: 1-4 - [c16]Marek Kvet, Jaroslav Janácek:
Reengineering of the Emergency Service System under Generalized Disutility. ICORES 2018: 85-93 - [c15]Marek Kvet, Jaroslav Janácek, Michal Kvet:
Computational Study of Emergency Service System Reengineering Under Generalized Disutility. ICORES (Selected Papers) 2018: 198-219 - [c14]Jaroslav Janácek, Marek Kvet:
Reengineering of the Emergency Service System from the Point of Service Provider. ICORES 2018: 224-231 - 2017
- [j6]Jaroslav Janácek, Marek Kvet:
Semi-fair design of emergency service system with failing centers. Central Eur. J. Oper. Res. 25(3): 665-677 (2017) - [c13]Jaroslav Janácek, Marek Kvet:
Convex Approach with Sub-gradient Method to Robust Service System Design. OR 2017: 421-427 - [c12]Marek Kvet, Jaroslav Janácek:
Iterative approaches to design of robust emergency system. SOLI 2017: 13-16 - [c11]Jaroslav Janácek, Marek Kvet:
Efficient robust design of public rescue service system. SOLI 2017: 17-20 - [c10]Michal Koháni, Jaroslav Janácek:
Acceleration strategies of the column generation method for the crew scheduling problem. SOLI 2017: 54-57 - 2016
- [j5]Jaroslav Janácek, Marek Kvet:
Sequential approximate approach to the p-median problem. Comput. Ind. Eng. 94: 83-92 (2016) - [c9]Jaroslav Janácek, Marek Kvet:
Min-Max Fair Emergency System with Randomly Occupied Centers. OR 2016: 307-312 - 2015
- [j4]Jaroslav Janácek:
Public service system design with fuzzy parameters of perceived utility. Central Eur. J. Oper. Res. 23(3): 595-606 (2015) - [c8]Jaroslav Janácek, Marek Kvet:
Public Service System Design by Radial Formulation with Dividing Points. ICCS 2015: 2277-2286 - [c7]Marek Kvet, Jaroslav Janácek:
Composed Min-Max and Min-Sum Radial Approach to the Emergency System Design. OR 2015: 41-47 - 2014
- [j3]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) - [c6]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
- [c5]Jaroslav Janácek, Marek Kvet:
Relevant Network Distances for Approximate Approach to Large p-Median Problems. OR 2012: 123-128 - [c4]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
- [c3]Jaroslav Janácek, Marek Kvet:
Sequential Zone Adjustment for Approximate Solving of Large p-Median Problems. OR 2011: 269-274 - 2010
- [c2]Jaroslav Janácek:
Two Dimensional Labelled Security Model with Partially Trusted Subjects and Its Enforcement Using SELinux DTE Mechanism. NDT (1) 2010: 259-272
2000 – 2009
- 2008
- [j2]Jaroslav Janácek, Lubos Buzna:
An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem. Ann. Oper. Res. 164(1): 97-109 (2008) - 2002
- [j1]Jaroslav Janácek, Richard Ostertág:
Problems in practical use of electronic signatures. Informatica (Slovenia) 26(2) (2002) - [c1]Jaroslav Janácek:
Optimal Sorting Machine Allocation in the Postal Distribution Network. OR 2002: 144-149
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-10-25 21:15 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:
