default search action
Hana Rudová
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c31]Václav Sobotka, Hana Rudová:
Uncertainty in Real-World Vehicle Routing. ECAI 2024: 4311-4318 - 2023
- [c30]Vojtech Sassmann, Hana Rudová, Michal Gabonnay, Václav Sobotka:
Real-World Vehicle Routing Using Adaptive Large Neighborhood Search. EvoCOP 2023: 34-49 - [c29]Václav Sobotka, Hana Rudová:
Real-World Pickup and Delivery Problem with Transfers. SOCS 2023: 83-91
2010 – 2019
- 2019
- [j12]Quang-Vinh Dang, Cong Thanh Nguyen, Hana Rudová:
Scheduling of mobile robots for transportation and manufacturing tasks. J. Heuristics 25(2): 175-213 (2019) - [c28]Stanislav Murín, Hana Rudová:
Scheduling of Mobile Robots Using Constraint Programming. CP 2019: 456-471 - [c27]Quang-Vinh Dang, Hana Rudová, Cong Thanh Nguyen:
Adaptive large neighborhood search for scheduling of mobile robots. GECCO 2019: 224-232 - 2018
- [j11]Dzmitry Makatun, Jérôme Lauret, Hana Rudová:
Planning of distributed data production for High Energy and Nuclear Physics. Clust. Comput. 21(4): 1949-1965 (2018) - [j10]Pavel Troubil, Hana Rudová, Petr Holub:
Dynamic reconfiguration in multigroup multicast routing under uncertainty. J. Heuristics 24(3): 395-423 (2018) - [c26]Quang-Vinh Dang, Hana Rudová:
Enhanced Scheduling for Real-Time Traffic Control. SSCI 2018: 578-585 - 2016
- [j9]Tomás Müller, Hana Rudová:
Real-life curriculum-based timetabling with elective courses and course sections. Ann. Oper. Res. 239(1): 153-170 (2016) - [c25]Dzmitry Makatun, Jérôme Lauret, Hana Rudová, Michal Sumbera:
Network flows for data distribution and computation. SSCI 2016: 1-8 - 2015
- [c24]Dalibor Klusácek, Vaclav Chlumsky, Hana Rudová:
Planning and Optimization in TORQUE Resource Manager. HPDC 2015: 203-206 - [p1]Dalibor Klusácek, Hana Rudová:
A Metaheuristic for Optimizing the Performance and the Fairness in Job Scheduling Systems. Artificial Intelligence Applications in Information and Communication Technologies 2015: 3-29 - 2014
- [c23]Dalibor Klusácek, Hana Rudová:
Multi-resource Aware Fairsharing for Heterogeneous Systems. JSSPP 2014: 53-69 - [c22]Jiri Marek, Hana Rudová, Petr Holub:
Local Search Heuristics for Media Streams Planning with Transcoding. NCA 2014: 167-170 - [c21]Pavel Troubil, Hana Rudová, Petr Holub:
Media Streams Planning with Uncertain Link Capacities. NCA 2014: 197-204 - 2013
- [c20]Jiri Marek, Petr Holub, Hana Rudová:
Local Search Heuristics for Media Streams Planning Problem. AINA 2013: 945-953 - [c19]Dalibor Klusácek, Hana Rudová, Michal Jaros:
Multi Resource Fairness: Problems and Challenges. JSSPP 2013: 81-95 - [c18]Pavel Troubil, Hana Rudová, Petr Holub:
Media Streams Planning with Transcoding. NCA 2013: 41-48 - 2012
- [j8]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
A branch-and-cut procedure for the Udine Course Timetabling problem. Ann. Oper. Res. 194(1): 71-87 (2012) - [c17]Dalibor Klusácek, Hana Rudová:
Performance and Fairness for Users in Parallel Job Scheduling. JSSPP 2012: 235-252 - 2011
- [j7]Dalibor Klusácek, Hana Rudová:
Efficient grid scheduling through the incremental schedule-based approach. Comput. Intell. 27(1): 4-22 (2011) - [j6]Petr Holub, Hana Rudová, Milos Liska:
Data transfer planning with tree placement for collaborative environments. Constraints An Int. J. 16(3): 283-316 (2011) - [j5]Hana Rudová, Tomás Müller, Keith S. Murray:
Complex university course timetabling. J. Sched. 14(2): 187-207 (2011) - [c16]Dalibor Klusácek, Hana Rudová:
Efficient Data Representation of Large Job Schedules. MEMICS 2011: 103-113 - 2010
- [j4]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
A supernodal formulation of vertex colouring with applications in course timetabling. Ann. Oper. Res. 179(1): 105-130 (2010) - [j3]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
Decomposition, reformulation, and diving in university course timetabling. Comput. Oper. Res. 37(3): 582-597 (2010) - [j2]Roman Barták, Hana Rudová:
Special issue on applications and methodologies for planning and scheduling: editorial. J. Sched. 13(4): 299-300 (2010) - [c15]Dalibor Klusácek, Hana Rudová:
The Importance of Complete Data Sets for Job Scheduling Simulations. JSSPP 2010: 132-153 - [c14]Pavel Troubil, Hana Rudová:
Integer Programming for Media Streams Planning Problem. MEMICS 2010: 116-123 - [c13]Dalibor Klusácek, Hana Rudová:
Alea 2: job scheduling simulator. SimuTools 2010: 61
2000 – 2009
- 2009
- [i3]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
Decomposition, Reformulation, and Diving in University Course Timetabling. CoRR abs/0903.1095 (2009) - 2008
- [c12]Dalibor Klusácek, Hana Rudová, Ranieri Baraglia, Marco Pasquali, Gabriele Capannini:
Comparison Of Multi-Criteria Scheduling Techniques. CoreGRID Integration Workshop 2008: 173-184 - 2007
- [c11]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
Penalising Patterns in Timetables: Novel Integer Programming Formulations. OR 2007: 409-414 - [c10]Dalibor Klusácek, Ludek Matyska, Hana Rudová:
Alea - Grid Scheduling Simulation Environment. PPAM 2007: 1029-1038 - [e1]Edmund K. Burke, Hana Rudová:
Practice and Theory of Automated Timetabling VI, 6th International Conference, PATAT 2006, Brno, Czech Republic, August 30 - September 1, 2006, Revised Selected Papers. Lecture Notes in Computer Science 3867, Springer 2007, ISBN 978-3-540-77344-3 [contents] - [i2]Edmund K. Burke, Jakub Marecek, Andrew J. Parkes, Hana Rudová:
On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling. CoRR abs/0710.3603 (2007) - 2006
- [c9]Keith S. Murray, Tomás Müller, Hana Rudová:
Modeling and Solution of a Complex University Course Timetabling Problem. PATAT 2006: 189-209 - 2005
- [c8]Roman Barták, Hana Rudová:
Limited assignments: a new cutoff strategy for incomplete depth-first search. SAC 2005: 388-392 - 2004
- [c7]Tomás Müller, Hana Rudová, Roman Barták:
Minimal Perturbation Problem in Course Timetabling. PATAT 2004: 126-146 - 2003
- [c6]Roman Barták, Tomás Müller, Hana Rudová:
A New Approach to Modeling and Solving Minimal Perturbation Problems. CSCLP 2003: 233-249 - [c5]Hana Rudová:
Soft CLP (FD). FLAIRS 2003: 202-207 - 2002
- [c4]Hana Rudová, Keith S. Murray:
University Course Timetabling with Soft Constraints. PATAT 2002: 310-328 - 2001
- [i1]Hana Rudová:
Soft Scheduling. CoRR cs.AI/0106004 (2001)
1990 – 1999
- 1999
- [c3]Hana Rudová:
Over-Constrained Systems. AAAI/IAAI 1999: 954 - 1998
- [j1]Hana Rudová:
Constraint Programming on ECAI-98 - Student's View. AI Commun. 11(3-4): 225-228 (1998) - [c2]Hana Rudová:
Constraints with Variables' Annotations. ECAI 1998: 261-262 - [c1]Hana Rudová:
Constraints with Variables' Annotations and Constraint Hierarchies. SOFSEM 1998: 409-418
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-28 20:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint