 |
Petr Vilím
|
E-mail: pvilim (at) vilim (dot) eu
Publications:
2015:
Failure-directed Search for Constraint-based Scheduling
[PDF]
[BibTeX]
[Experimental Results]
Petr Vilím, Philippe Laborie, Paul Shaw
Proceedings of CPAIOR 2015, Barcelona, Spain
© Springer-Verlag, LNCS
2011:
Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
[PS]
[PDF]
[BibTeX]
[Experimental Results]
Petr Vilím
Proceedings of CPAIOR 2011, Berlin, Germany
Note: This version of the paper slightly differers from the original - it includes fixes for few mistakes.
© Springer-Verlag, LNCS
2009:
Edge finding filtering algorithm for discrete cumulative resources in O(kn log n)
[PS]
[PDF]
[BibTeX]
Petr Vilím
Proceedings of CP 2009, Lisbon, Portugal
Note: This version of the paper slightly differers from the original - it includes fixes for few mistakes.
© Springer-Verlag, LNCS
Max Energy Filtering Algorithm for Discrete Cumulative Resources
[PS]
[PDF]
[BibTeX]
Petr Vilím
Proceedings of CPAIOR 2009, Pittsburgh, USA
© Springer-Verlag, LNCS
2008:
Filtering Algorithms for the Unary Resource Constraint
[BibTeX]
Petr Vilím
Archives of Control Sciences, Volume 18, No. 2, 2008
2007:
Global Constraints in Scheduling
[PS]
[PDF]
[BibTeX]
Petr Vilím
PhD Thesis, KTIML MFF UK, 2007
2005:
Extension of O(n log n) Filtering Algorithms for the Unary
Resource Constraint to Optional Activities
[PS]
[PDF]
[BibTeX]
Petr Vilím, Roman Barták, Ondřej Čepek
Constraints Journal,
10(4), 2005
Computing Explanations for the Unary Resource Constraint
[PS]
[PDF]
[BibTeX]
Petr Vilím
Proceedings of CPAIOR 2005, Prague, Czech Republic,
© Springer-Verlag, LNCS,
ISBN 3-540-26152-4.
2004:
Unary Resource Constraint with Optional Activities
[PS]
[PDF]
[BibTeX]
Petr Vilím, Roman Barták, Ondřej Čepek,
Proceedings of CP 2004, Toronto, Canada,
© Springer-Verlag, LNCS,
ISBN 3-540-23241-9.
O(n log n) Filtering Algorithms for Unary Resource Constraint
[PS]
[PDF]
[BibTeX]
Petr Vilím
In proceedings of CPAIOR 2004, Nice, France, April 2004,
© Springer-Verlag, LNCS,
ISBN 3-540-21836-X.
2003:
Computing Explanations for Global Scheduling Constraints
[PS][PDF]
Petr Vilím
Doctoral programme of CP2003, Kinsale, Ireland. October 2003.
2002:
Batch Processing with Sequence Dependent Setup Times:
Using Precedence Graph
[PS]
[PDF]
Petr Vilím
Doctoral programme of CP2002, Ithaca, US, September 2002.
A Filtering Algorithm Sequence Composition for Batch Processing with Sequence
Dependent Setup Times
[PS]
[PDF]
[BibTeX]
Petr Vilím, Roman Barták,
Technical Report 2002/1, Charles University, Faculty of Mathematics and Physics, 2002.
Batch Processing with Sequence Dependent Setup Times: New Results
[PS]
[PDF]
[BibTeX]
Petr Vilím
In proceedings of the 4th Workshop of Constraint Programming for Decision and
Control, CPDC'02, Gliwice.
Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times
[PS]
[PDF]
[BibTeX]
Petr Vilím, Roman Barták,
in Proceedings of AIPS 2002, Toulouse, Apr. 2002,
AAAI Press
Automatic Testing of Homeworks in Programming (in Czech)
[PS]
[PDF]
Tomáš Tichý, Petr Vilím,
In proceedings of E-learning workshop, Prague, May 2002, ISBN 80-01-02538-1.
2001:
A Benchmark Set for Batch Processing with Sequence Dependent Setup Times
[ZIP]
Petr Vilím
Randomly generated benchmark instancies, 2001.
Global Constraints (in Czech)
[PS]
[PDF]
Petr Vilím
Master Thesis, KTIML MFF UK, 2001