( en | de | ru )

 

Disambiguation of "Vilím, Petr"

Author of the publication

copydeleteadd this publication to your clipboard
Route Finder: Efficiently Finding k Shortest Paths Using Constraint Programming.

, , and . CP, volume 6876 of Lecture Notes in Computer Science, page 42-53. Springer, (2011)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Roman Vilimek

Andreas Petr

Petr Rudenko

Petr Obrdlik

Petr Hyspecký

 

Other publications of authors with the same name

Max Energy Filtering Algorithm for Discrete Cumulative Resources.. CPAIOR, volume 5547 of Lecture Notes in Computer Science, page 294-308. Springer, (2009)Batch Processing with Sequence Dependent Setup Times.. CP, volume 2470 of Lecture Notes in Computer Science, page 764. Springer, (2002)IBM ILOG CP optimizer for scheduling - 20+ years of scheduling with constraints at IBM/ILOG., , , and . Constraints An Int. J., 23 (2): 210-250 (2018)Reasoning with Conditional Time-Intervals. Part II: An Algebraical Model for Resources., , , and . FLAIRS, AAAI Press, (2009)Edge Finding Filtering Algorithm for Discrete Cumulative Resources in O(kn log n)O(kn log n).. CP, volume 5732 of Lecture Notes in Computer Science, page 802-816. Springer, (2009)Unary Resource Constraint with Optional Activities., , and . CP, volume 3258 of Lecture Notes in Computer Science, page 62-76. Springer, (2004)Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources.. CPAIOR, volume 6697 of Lecture Notes in Computer Science, page 230-245. Springer, (2011)Computing Explanations for the Unary Resource Constraint.. CPAIOR, volume 3524 of Lecture Notes in Computer Science, page 396-409. Springer, (2005)Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities., , and . Constraints An Int. J., 10 (4): 403-425 (2005)Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times., and . AIPS, page 312-321. AAAI, (2002)