Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Petr Vilím
2010 – today
- 2011
[c11]Michel P. Lefebvre, Jean-François Puget, Petr Vilím: Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming. CP 2011: 42-53- [c10]Petr Vilím: Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources. CPAIOR 2011: 230-245
2000 – 2009
- 2009
- [c9]Petr Vilím: Edge Finding Filtering Algorithm for Discrete Cumulative Resources in O(kn log n){\mathcal O}(kn {\rm log} n). CP 2009: 802-816
- [c8]
- [c7]Philippe Laborie, Jerome Rogerie, Paul Shaw, Petr Vilím: Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources. FLAIRS Conference 2009
- 2005
- [j1]Petr Vilím, Roman Barták, Ondrej Cepek: Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints 10(4): 403-425 (2005)
- [c6]
- 2004
- [c5]Petr Vilím, Roman Barták, Ondrej Cepek: Unary Resource Constraint with Optional Activities. CP 2004: 62-76
- [c4]
- 2003
- [c3]
- 2002
- [c2]Petr Vilím, Roman Barták: Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. AIPS 2002: 312-321
- [c1]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-14 16:48 CET by the dblp team