( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
On-Line Dial-a-Ride Problems Under a Restricted Information Model.

, , , , и . Algorithmica, 40 (4): 319-329 (2004)

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.

René Berndt

Einfluss eines diabaten Turboladermodells auf die Gesamtprozess-Simulation abgasturboaufgeladener PKW-Dieselmotoren. TU Berlin, (2009)

Horst Renemann

Ekkehart Renesse

Dorothea Renesse

Thomas Renette

 

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

Approximability of average completion time scheduling on unrelated machines.. Math. Program., 161 (1-2): 135-158 (2017)A priori TSP in the scenario model., , , и . Discret. Appl. Math., (2018)Complexity of preemptive minsum scheduling on unrelated parallel machines.. J. Algorithms, 57 (1): 37-48 (2005)Connected Feedback Vertex Set in Planar Graphs., и . WG, том 5911 из Lecture Notes in Computer Science, стр. 143-153. (2009)Competitive analysis of preemptive single-machine scheduling.. Oper. Res. Lett., 38 (6): 585-588 (2010)The generalized work function algorithm is competitive for the generalized 2-server problem. CoRR, (2011)Fixed-Order Scheduling on Parallel Machines., , , , и . IPCO, том 11480 из Lecture Notes in Computer Science, стр. 88-100. Springer, (2019)Efficient Algorithms for Average Completion Time Scheduling.. IPCO, том 6080 из Lecture Notes in Computer Science, стр. 411-423. Springer, (2010)On the Complexity of Master Problems., и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 567-576. Springer, (2015)The A Priori Traveling Repairman Problem., и . Algorithmica, 80 (10): 2818-2833 (2018)