From post

A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem.

, , , и . MOTOR (2), том 1090 из Communications in Computer and Information Science, стр. 438-451. Springer, (2019)

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.

 

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

Preface: Baikal Conference on Optimization Methods and Their Applications., и . Stud. Inform. Univ., 9 (3): 3-6 (2011)A Local Branching MIP Heuristic for a Real-World Curriculum-Based Course Timetabling Problem., , , и . MOTOR (2), том 1090 из Communications in Computer and Information Science, стр. 438-451. Springer, (2019)Integer Programming Approach to the Data Traffic Paths Recovering Problem., , и . MOTOR, том 12095 из Lecture Notes in Computer Science, стр. 455-469. Springer, (2020)Valid Inequalities for Time-Indexed Formulations of the Runway Scheduling Problem., , , и . DOOR (Supplement), том 1623 из CEUR Workshop Proceedings, стр. 787-790. CEUR-WS.org, (2016)Generalized multiple strip packing problem: Formulations, applications, and solution algorithms., , , и . Comput. Ind. Eng., (2023)Locating Facilities Under Deliberate Disruptive Attacks., и . MOTOR, том 12095 из Lecture Notes in Computer Science, стр. 359-372. Springer, (2020)A Computational Comparison of Parallel and Distributed K-median Clustering Algorithms on Large-Scale Image Data., и . MOTOR (2), том 1090 из Communications in Computer and Information Science, стр. 119-130. Springer, (2019)The p-median Problem with Order for Two-Source Clustering., , и . DOOR (Supplement), том 1623 из CEUR Workshop Proceedings, стр. 536-544. CEUR-WS.org, (2016)A three-stage p-median based exact method for the optimal diversity management problem., , , и . Networks, 74 (2): 174-189 (2019)A parallel heuristic for a k-medoids clustering problem with unfixed number of clusters., и . MIPRO, стр. 1116-1120. IEEE, (2019)