Petr Vilím

17 papers A 6B 5Misc 1Journal 4Unranked 1
YearRankTypeTitle / Venue / Authors
2025 J jnl
Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks.
CoRR
Vilém Heinz, Petr Vilím, Zdenek Hanzálek
2025 J jnl
Reinforcement learning for search tree size minimization in Constraint Programming: New results on scheduling benchmarks.
Comput. Ind. Eng.
Vilém Heinz, Petr Vilím, Zdenek Hanzálek
2023 A conf
CP Solver Design for Maximum CPU Utilization (Invited Talk).
CP
Petr Vilím
2018 J jnl
IBM ILOG CP optimizer for scheduling - 20+ years of scheduling with constraints at IBM/ILOG.
Constraints An Int. J.
Philippe Laborie, Jerome Rogerie, Paul Shaw, Petr Vilím
2015 B conf
Failure-Directed Search for Constraint-Based Scheduling.
CPAIOR
Petr Vilím, Philippe Laborie, Paul Shaw
2011 A conf
Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming.
CP
Michel P. Lefebvre, Jean-François Puget, Petr Vilím
2011 B conf
Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources.
CPAIOR
Petr Vilím
2009 A conf
Edge Finding Filtering Algorithm for Discrete Cumulative Resources in
CP
Petr Vilím
2009 B conf
Max Energy Filtering Algorithm for Discrete Cumulative Resources.
CPAIOR
Petr Vilím
2009 Misc conf
Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources.
FLAIRS
Philippe Laborie, Jerome Rogerie, Paul Shaw, Petr Vilím
2005 B conf
Computing Explanations for the Unary Resource Constraint.
CPAIOR
Petr Vilím
2005 J jnl
Extension of
Constraints An Int. J.
Petr Vilím, Roman Barták, Ondrej Cepek
2004 B conf
O(n log n) Filtering Algorithms for Unary Resource Constraint.
CPAIOR
Petr Vilím
2004 A conf
Unary Resource Constraint with Optional Activities.
CP
Petr Vilím, Roman Barták, Ondrej Cepek
2003 A conf
Computing Explanations for Global Scheduling Constraints.
CP
Petr Vilím
2002 A conf
Batch Processing with Sequence Dependent Setup Times.
CP
Petr Vilím
2002 — conf
Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times.
AIPS
Petr Vilím, Roman Barták