( en | de | ru )

 

Disambiguation of "Kilby, Philip"

Author of the publication

copydeleteadd this publication to your clipboard
Vehicle Dynamics in Pickup-And-Delivery Problems Using Electric Vehicles.

, , , and . CP, volume 210 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

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.

Philip Eckardt

Experimentelle Isolierung und Charakterisierung eines lockwirksamen Stoffes der Süßwasserschnecke Biomphalaria glabrata für den Zwischenwirtsfindungsprozess von Schistosoma-mansoni-Mirazidien. TU München, (2009)

Philip Olaolu

Philip Osofisan

Philip Sztulman

Philip Ashon

 

Other publications of authors with the same name

Informed Heuristics for Guiding Stem-and-Cycle Ejection Chains, and . CoRR, (2011)A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints., , and . Constraints An Int. J., 5 (4): 389-414 (2000)Solving the integrated bin allocation and collection routing problem for municipal solid waste: a Benders decomposition approach., , and . Ann. Oper. Res., 322 (1): 441-465 (March 2023)Planning Habitat Restoration with Genetic Algorithms., , and . GECCO, page 861-868. ACM, (2016)Scheduling patrol boats and crews for the Royal Australian Navy., , and . JORS, 58 (10): 1284-1293 (2007)TRANSIT Routing on Video Game Maps., , , and . AIIDE, The AAAI Press, (2012)Agent Coordination with Regret Clearing., , , , , , and . AAAI, page 101-107. AAAI Press, (2008)A model-based genetic algorithm framework for constrained optimisation problems., , and . GECCO (Companion), page 111-112. ACM, (2017)CP methods for scheduling and routing with time-dependent task costs., , and . EURO J. Comput. Optim., 2 (3): 147-194 (2014)CP Methods for Scheduling and Routing with Time-Dependent Task Costs., , and . CPAIOR, volume 7874 of Lecture Notes in Computer Science, page 111-127. Springer, (2013)