From post

The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints.

, , и . INFORMS J. Comput., 20 (2): 222-233 (2008)

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.

 

Другие публикации лиц с тем же именем

Branch-and-Bound Algorithms for TotalWeighted Tardiness., , и . Handbook of Scheduling, Chapman and Hall/CRC, (2004)Polynomial-time algorithms for minimum energy scheduling., , и . ACM Trans. Algorithms, 8 (3): 26:1-26:29 (2012)Polynomial Time Algorithms for Minimum Energy Scheduling., , и . ESA, том 4698 из Lecture Notes in Computer Science, стр. 136-150. Springer, (2007)Constraint-Based Schedulers, Do They Really Work?. CP, том 5732 из Lecture Notes in Computer Science, стр. 1. Springer, (2009)Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks., , , и . COCOA, том 5165 из Lecture Notes in Computer Science, стр. 225-234. Springer, (2008)Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems., и . Constraints An Int. J., 5 (1/2): 119-139 (2000)The K King Problem, an Abstract Model for Computing Aircraft Landing Trajectories: On Modeling a Dynamic Hybrid System with Constraints., , и . INFORMS J. Comput., 20 (2): 222-233 (2008)On Minimizing Total Tardiness in a Serial Batching Problem., и . RAIRO Oper. Res., 35 (1): 107-115 (2001)Polynomial Time Algorithms for Minimum Energy Scheduling., , и . Scheduling, том 10071 из Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)On preemption redundancy in scheduling unit processing time jobs on two parallel machines., и . IPDPS, стр. 200. IEEE Computer Society, (2001)