VERY GOOD STUDENTS:

1. Yuri V. Baida (group 412; 11/14), lab. works: 1(good applied example: Web-based monitoring and control system, to discuss, a material to prepare a paper), 2, 3, 4(good example), 5(good example), 6(very good example), 7, 9(Hungarian algorithm for assignment problem, good report), 8&10(very good applied example), 11&12(good report, Ant optimization algorithm for TSP)

2. Alexey O. Merzlyakov (group 412; 13/13), lab. works: 1(good applied example for game industry; very good algorithmic study of two design methods: (a) method of morphological analysis & revelation of Pareto-effective solutions, (b) hierarchical morphological design based on morphological clique problem), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11(good applied example for routing in Tokyo), 12(excellent work at the level of very good submission: plan for testing of processors SPEC-2006; composite solving scheme: clustering, multiple choice problem, assignment)

3. Pavel V. Prikhodko (group 411; 5/11), lab. works: 1(good applied example: hierarchical design of computer), 2, 3, 4, 5, 6, 7, 8, 9(good example: allocation of servers), 10, 11(greedy algorithm and fractal-based algorithm for TSP; excellent work and report), 12(Ant-colony optimization algorithm for routing in wireless network; excellent work and report; material for paper)

4. Alexander I. Titov (group 412; 10/9), lab. works; 1(good example: design of team for start-up), 2(good applied example, very good report), 3(good applied example), 4, 5(very good applied example, good report), 6(good example, good report), 7(excellent applied example: server system, very good report; after extension the material may be considered for publication), 9(excellent applied example, very good report), 8&10(excellent example for transportation/logistic firm), 11(excellent applied example: design of robot route), 12(good example)

5. Evgeny M. Khorov (group 411; 4/9), lab. works: 1(hierarchical morphological design of TFT monitor), 2(good example), 3, 4(good example), 5, 6(good applied example), 7, 9, 8&10, 11&12(algorithms for TSP: enumerative algorithm, greedy algorithm, Branch&Bound algorithm; analysis of application for bi-connected networks)

6. Michael V. Zolotukhin (group 412; 14/14), lab. works: 1(hierarchical design of sport team), 2(good example), 3(good example), 4(good example), 5(good example, very good report), 6(good applied example: design of car), 7(very good example: evaluation of apartment), 9(good applied example: allocation of computing tasks into several computers of a computer cluster; to discuss), 8&10(example for sport team), 11&12(TSP: genetic algorithm, greedy algorithm, partial backtracking algorithm; good example for a set of sites in Russia & Europe)

7. Maxim V. Petukhov (group 417; 2/11), lab. works: 1(good applied example for vacation plan), 2, 3, 4, 5(good applied example: clustering of 21 notebooks), 6, 7, 9(good realistic applied example), 8&10(excellent applied example: private investment in Russia), 11(excellent applied example), 12(multicriteria assignment problem: allocation of routes in a hierarchical network)

8. Andrey A. Velichkin (group 412; 13/13), lab. works: 1(hierarchical design of innovative project), 2(good applied example), 3, 4(good example), 5(good applied example: custering of 28 digital cameras), 6(good applied example: modular design of digital camera), 7(good example), 9(Hungarian algorithm, very good logistic real workd application), 8&10(good applied example), 11(genetic algorithm for TSP), 12(as 11)

9. Dmitry I. Fedorov (group 416; 3/10), lab. works: 1, 2, 3, 4(very good work), 5(good educational example), 6(excellent work as problem formulation, solving, report, & presentation; transformation of oil-pipeline; material for paper/presentation), 7, 8, 9, 10, 11, 12(Ant-colony optimization for QAP)

10. Alexander N. Biryukov (group 416; 5/8), lab. works: 1(good example for design of a business; morphological synthesis is not understandable; material for a paper), 2, 3, 4, 5, 6, 7, 9, 8&10(excellent real-world application for multi-project management in IT-company; very good report; material to prepare a paper/presentation), 11, 12(TSP: 'space-filling curve' algorithm, genetic algorithm, combined 'space filling curve & evolution' algorithm, comparision of the algorithms; very good report, excellent work; to prepare article/presentation)

11. Nikolay A. Shcherbina (group 415; 12/11), lab. works: 1(design of music group; excellent work; morphological synthesis is not used), 2, 3, 4, 5(good example: clustering of micrprocessors), 6, 7, 9, 8&10(very good realistic example for airplanes), 11, 12(genetic algorithm)

12. Michail P. Ryzov (group 415; 14/13), lab. works: 1(design of certain user's application set; good example), 2, 3(good algorithmic study), 4, 5(to discuss: intersection of clusters), 7(applied example for network security), 6(good report), 9, 8&10, 11(enumerative and greedy algorithms, very good), 12(formulation of problem for CPU verification by test generator; graph comparison/matching, evolutionary algorithm for key parameters extraction)

REPORTS ON LAB. WORKS:

13. Kirill V. Andreev (group 411; 5/7), lab. works: 1(design of trip), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross entropy method for 8 queens problem)

14. Vitaly V. Bashlykov (group 411; 10/11), lab. works: 1(good sport example), 2, 3, 4, 5(good sport example), 6, 7, 9(good applied example: Russian export strategy), 8&10(very good real-world example for 14 processors as Intel, AMD; a material for presentation), 11, 12(cross entropy method for TSP)

15. Denis N. Fahriev (group 411; 3/7), lab. works: 1(morphological design of car; good example), 2, 3, 4, 5, 6, 7, 9(good sport example), 8&10(good applied example for team design), 11&12(three algorithms for TSP: greedy algorithm, genetic algorithm, partial backtracking algorithm; good work; good report)

16. Alexey V. Golovin (group 411; 0/4), lab. works: 1(example for enterprise computer system), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross entropy method for TSP)

17. Irina T. Kobozeva (group 411; 11/8), lab. works: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross-entropy method for TSP)

18. Vadim O. Kovalev (group 411; 5/5), lab. works: 1(with student Renyov; excellent example: design of football club), 2(good report), 3, 4, 5, 6, 7, 8(good report), 9, 10, 11, 12(cross entropy method for TSP)

19. Anna I. Kluchnikova (group 411; 8/7), lab. works: 1(the solving method for synthesis is a primitive one - for teenagers), 2, 3(realistic example for food), 4, 5(good applied example for sport), 6(realistic example for food), 7, 8, 9(excellent applied example: load balancing as traffic allocation in wireless communication mesh network, very prospective work; material to prepare a presentation/article), 10, 11, 12(cross entropy method for TSP; good example as design of a route for vacation in Egypt, good report)

20. Artem N. Krasilov (group 411; 0/11), lab.works: 1(excellent example: design of football team; synthesis method is not understandable), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11(TSP: greedy algorithm, space filling curve method), 12(Ant colony optimization for QAP)

21. Alexander Yu. Leonov (group 411; 2/9), lab. works: 1(morphological synthesis is not used), 2, 3, 4, 5, 6(good example), 7, 8, 9(good example), 10, 11(two methods: greedy algorithm, space-filling curve method; very good), 12(Ant colony optimization in wireless network routing/IEEE 802.11s mesh network; very good/prospective material for presentation/paper; to add other models)

22. Andrey I. Mazo (group 411; 11/11), lab. works: 1(design of an environment for software develompent; good example), 2(multicriteria comparison of notebooks; good example), 3(example for weapon equipments), 4, 5, 6, 7, 8, 9, 11, 12(cross entropy method for 8 queens problem)

23. Vadim V. Petrochenkov (group 411; 3/1), lab. works: 1(intersting example: design of vacation trip), 2, 3, 4, 5(example-material for communication dynamic network), 6, 7, 9(good applied example), 10, 11(two algorithms for TSP: greedy algorithm, space filling curve based algorithm)

24. Dmitry O. Samuylov (group 411; 0/4), lab. works: 1(modular design of PC), 2, 3, 4, 5, 6, 7, 8(good example), 9, 10, 11, 12(Cross-entropy method for TSP)

25. Peter A. Sergeev (group 411; 0/8), lab. works: 1(good example: staff motivation, to discuss) 2, 3, 4, 5, 6, 7, 9, 8&10(plan to make a block-buster), 11, 12(genetic algorithm for TSP; very good report)

26. Maxim V. Sorokin (group 411; 5/9), lab. works: 1(design of wireless station), 2, 3, 4, 5, 6(good applied realistic example for team design), 7, 8(good applied example for food), 9, 10, 11, 12("genetic" modification of greedy algorithm for TSP; very prospective work)

27. Igor V. Zarubinsky (group 411; 0/1), lab. works: 1(very good applied example: business solution for Internet company), 2, 3, 4, 5, 6, 7, 8(good applied example: communication equipments), 9, 10, 11(good applied example: communication equipments) 12(TSP: genetic algorithm, Boltsman machine algorithm, comparison; good report)

28. Dmitry Yu. Braznikov (group 412; 0/7), lab. works: 1(excellent realistic applied example: design of personal motivation strategy; synthesis method is not understandable), 2, 3, 4, 5, 6, 7, 8, 9, 10(good report), 11, 12(genetic algorithm for TSP; good report)

29. Alexander D. Gryaznov (group 412; 0/1), lab. works: 1(not finalized), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross entropy method for TSP)

30. Grigory S. Rechistov (group 412; 3/2), lab. works: 1(design of software, to discuss), 2, 3, 4, 5(good example: image segmentation), 6, 7, 8(clustering of computer network nodes, assignment of computing tasks into computer clusters as multiple choice problem; a material to prepare a paper), 9(good example: office space allocation), 10(good example: organization of Hi-Tech Fair), 11(3 algorithms: enumerative algorithm, greedy algorithm, ant colony alorithm), 12(genetic algorithm for placement of interconnected electronic components onto a PCB as QAP, excellent)

31. Anton N. Zarikov (group 412; 2/12), lab. works: 1(excellent art example: design of a dancing team), 2, 3, 4, 5, 6, 7, 8&10, 9, 11&12(three algorithms for TSP: genetic algorithm, greedy algorithm, partial backtracking algorithm)

32. Vladimir V. Amninov (group 415; 0/1), lab. works: 1(synthesis method is a primitive one), 2(good report), 3, 4, 5(good report), 6, 7, 8, 9, 10, 11, 12(Ant colony optimization for QAP)

33. Sergey N. Artuhin (group 415; 0/1), lab. works: 1(design of vacation/mounting sky; very good work), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross entropy method for TSP)

34. Anton S. Astafjev (group 415; 0/1), lab. works: 1(synthesis method is a primitive one), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross entropy method for TSP)

35. Sergey N. Boldyrev (group 415; 0/1), lab. works: 1(synthesis method is a primitive one), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(Ant colony optimization for QAP)

36. Pavel V. Frolov (group 415; 10/12), lab. works: 1(synthesis method is a primitive one), 2&4, 3(multicriteria knapsack: heuristic, dynamic programming algorithm), 5, 6, 7, 9(Hungarian algorithm), 8&10, 11&12(TSP: corss entropy method)

37. Konstantin S. Kiryukhin (group 415; 0/6), lab. works: 1(very good example, good report), 2, 3, 4, 5, 6, 7, 8, 9, 10(good example), 11, 12(cross-entropy method for eight queens problem)

38. Igor A. Kupriyanov (group 415; 0/1), lab. works: 1(hierarchical design of composite project), 2, 3(good report), 4, 5(good report), 6, 7, 9, 8&10(close to report of A. Fimin), 11, 12(topological sorting)

39. Anton V. Maltsev (group 415; 0/12), lab.works: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(good applied example for air-traffic control)

40. Vasily A. Morzakov (group 415; 4/5), lab. works: 1(good applied example: modular design of a laser-based machine for mechanical manufacturing; material to prepare a presentation/aricle; synthesis mehtod is a primitive one), 2, 3, 4, 5, 6, 7, 9, 10, 11, 12(optimization for nesting problem; very good application)

41. Alexander V. Muravjev (group 415; 0/2), lab. works: 1(good applied example for turism, very good report), 2, 3, 4, 5(good report), 6, 7, 8, 9, 10, 11, 12(Ant Optimization algorithm for QAP)

42. Alex G. Renyov (group 415; 0/0), lab. works: 1(together with student Kovalev), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(interesting applied example: detection of air targets as assignment problem)

43. Petr A. Saharov (group 415; 0/1), lab. works: 1(design of server), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(assignment problem for air-control)

44. Dmitry N. Slinkov (group 415; 0/1), lab. works: 1(very good aplied example: design of strategy for selection of personnel for software engneering; synthesis method is a primitive one), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross entropy method for TSP)

45. Andrey A. Tolstov (grop 415; 1/9), lab. works: 1(modular design of an application set for PC: several applied examples for various users; synthesis method is not understandable); 2, 3, 4, 5, 6, 7, 8(good sport example), 9, 10, 11, 12(heuristic for multicriteria TSP; excellent material to prepare a presentation, etc.)

46. Maxim A. Ulyumdziev (group 415; 3/12), lab. works: 1(good example: hierarchical plan for teenager), 2, 3, 4, 5, 6, 7, 9, 10, 11, 12(multicriteria scheduling problem)

47. Dmitry A. Zvir (group 415; 0/1), lab. works: 1(synthesis method is a primitive one), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross entropy method for TSP)

48. Maxim V. Alekseev (group 416; 1/1), lab. works: 1(good example for design of PDA), 2, 3(report & desription of knapsack-based encoding algorithm), 4, 5(good example for wireless network - devices; to discuss), 6, 7, 8(good example for retail chain), 9(good applied example), 10, 11, 12 (geneic algorithm for TSP; good work and good report)

49. Sergey G. Barkalov (group 416; 0/2), lab. works: 1(good example for mobile phone), 2, 3, 4, 5, 6(example for home electronic devices), 7, 8(good report), 9, 10, 11, 12(cross entropy mehtod for TSP)

50.

51.

52. Andrey A. Haratsidi (group 416; 0/0), lab. works: 1(synthesis method is a primitive one), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross entropy method for TSP)

53. Maxim S. Grabarnik (group 416; 0/3), lab. works: 1(morphological synthesis is not used), 2, 3, 4 (student Slobodchikov is the author of program), 5, 6, 7, 8, 9, 10, 11, 12(cross-entropy methof for TSP)

54. Irina A. Krohaleva (group 416; 6/7), lab.works: 1, 2, 3, 4, 5(very nice example: clustering a set of Moscow's restaurants), 6(good applied example), 7, 8, 9, 10, 11(excellent example for metro transportation system in Moscow; good report), 12(cross-entropy method for TSP)

55. Grigory A. Levchenko (group 416; 0/1), lab. works: 1(example for design of Pocket PC), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(assignment problem for air traffic management)

56. Ilia S. Slobodchikov (group 416; 1/6), lab. works: 1(very good realistic example - team design; morphological synthesis is not used), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(usage of solving framework from lab. work 10; excelent real-world applicaiton, research material for future)

57. Ivan S. Sunchugashev (group 416; 8/10), lab. works: 1(design of sport team), 2, 3, 4, 5(good applied example), 6(composing of M4A1 Carbine SOPMOD), 7, 8, 9(very good applied example), 10, 11(good example), 12(Ant-algorithm for QAP)

58. Dmitry I. Telpuhovsky (group 416; 2/4), lab. works: 1(synthesis method is a primitive one), 2, 3, 4, 5, 6, 7, 8(good applied example for motherboards), 9, 10, 11, 12(cross entropy method for TSP, good report)

59. Anatoly A. Turzansky (group 416; 1/2), lab. works: 1(synthesis method is a primitive one), 2, 3(the program without multicriteria extension), 4, 5, 6(to discuss), 7, 8, 9, 10, 11, 12(cross entropy method for TSP)

60. Denis M. Vorobjev (group 416; 0/12), lab. works: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross-entropy method for TSP)

61. Michail E. Elfimov (goup 417; 0/7), lab. works: 1(example for private life, synthesis method is absent), 2, 3, 4, 5, 6, 7, 9, 8&10, 11&12(excellent applied example: travelling in China, good report)

62. Evgeny O. Fedotov (group 417; 5/8), lab. works: 1(very good applied example: Russian football premier league; design method is not understandable), 2, 3, 4, 5(good example: clustering of 28 cars), 6, 7, 9(good football example), 8&10(very good applied example for PC), 11, 12(cross entropy method for TSP)

63. Alexander A. Linenko (group 417; 0/1), lab. works: 1(design of a corporative communication network; together with student Yurkov; very good work), 2, 3, 4, 5, 6, 7, 8, 9, 10(design of a block buster; good report), 11, 12(genetic algorithm for TSP)

64. Artem Yu. Makarov (group 417; 0/3), lab. works: 1(morphological synthesis is not used), 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12(cross-entropy method for TSP)

65. Rustem I. Nuriahmetov (group 417; 2/11), lab. works: 1(design of a "game/intelligence system" strategy), 2, 3, 4, 5, 6, 7, 8&9, 11, 12("minimal" spanning tree problem and its modifications; new composite heuristric scheme, very prospective work)

66. Vladimir G. Tilipan (group 417; 0/4), lab. works: 1(good example), 2, 3, 4, 5(good example), 6, 7, 9(example for allocation of firm departments), 8&10(excellent application: investment for mobile provider; a material for paper), 11&12(TSP; example to search for "minimal" route in Moscow metro system)

67. Alexander V. Yurkov (group 417; 0/8), lab. works: 1(hierarchical design of corporative communication network; excellent example, a material to prepare an article/presentation; synthesis method is not understandable), 2, 3, 4, 5, 6, 7, 8(very good example: personnel selection for IT company), 9, 10, 11, 12(genetic algorithm for TSP)

68. Andrey V. Yudin (group 417; 5/6), lab. works:

69. Ilya A. Zarov (group 417; 4/12), lab. works: 1&2 (good example for civil engineering), 3&6(good example), 4, 7(very good educational example), 9(good example; personnel management: allocation of students), 5&8&10(example: civil engineering), 11&12(TSP: greedy algorihtm, Ant-colony optimization)

70. Marat S. Alyautdinov (group 418; 1/1), lab. works:

71. Fedor O. Barinov (group 418; 0/1), lab. works:

72. Alexander V. Breger (group 418; 2/1), lab. works:

73. Alexander V. Fedorov (group 418; 2/1), lab. works:

74. Ilya N. Stepanov (group 418; 0/1), lab. works: 1(good example, to discuss the solving scheme)