Combinatorial optimization in system configuration design

  • M. Sh. Levin
Information Processes


The significance of systems configurations has been increased in many applied domains (e.g., software, hardware, manufacturing systems, communication systems, supply chain systems, solving strategies, modular planning, material engineering and combinatorial chemistry). Generally, the following kinds of systems under configuration (reconfiguration) can be examined: (a) initial data/infomation (or row materials); (b) processing systems (machines, computers, algorithms); (c) resultant decisions (e.g., products, plans); (d) applied support systems (e.g., network systems, services); (e) requirements; and (f) standards. In the paper several system configuration problems are investigated: (i) searching for (selection of) a set (structure) of system components, (ii) searching for a set of compatible system components, (iii) allocation of system components, (iv) reconfiguration of a system as redesign of the system structure, (v) multi-stage design and redesign of system configuration, (vi) design or redesign of the system configuration for multi-product systems, and (vii) design of system hierarchy. Combinatorial optimization models (including multicriteria statements) are under examination: multiple choice problem, allocation problem, graph coloring problems, morphological clique problem (with compatibility of system components), multipartite clique and their modifications, spanning trees problems.


Remote Control Knapsack Problem Channel Assignment Graph Coloring Short Path Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Agerfalk, P.J., Brinkkemper, S., Gonzalez, C., Henderson-Seller, B., Karlsson, F., Kelly, S., and Ralyte, J., Modularization Constructs in Method Engineering: Towards Common Ground? IFIP, 2007, vol. 244, pp. 359–368.Google Scholar
  2. 2.
    Agrawal, A., Klein, P., and Ravi, R., When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks, SIAM J. Computing, 1995, vol. 24, no. 3, pp. 440–456.zbMATHMathSciNetCrossRefGoogle Scholar
  3. 3.
    Ahuja, R.K., Magnanti, T.L., and Orlin, J.B., Network Flows, Theory, Algorithms, and Applications, Upper Saddle River: Prentice Hall, 1993.Google Scholar
  4. 4.
    Aizerman, M.A., Gusev, L.A., Petrov, S.V., and Smirnov, I.M., A Dynamic Approach to Analysis of Structured Representatives as Graphs (Fundamentals of Graph Dynamics). I, II, Avtomat. Telemekh., 1977, no. 7, pp. 135–151; no. 9, pp. 123–136.Google Scholar
  5. 5.
    Akella, M.R., Batta, R., Sudit, M., Rogerson, P., and Blatt, A., Cellular Network Configuration with Co-channel and Adjacent-channel Interference Constraints, Comput. Oper. Res., 2008, vol. 35, no. 12, pp. 3738–3757.zbMATHCrossRefGoogle Scholar
  6. 6.
    Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., and Naor, J., A General Approach to Online Network Optimization Problems, ACM Trans. Algorithms, 2006, vol. 2, no. 4, pp. 640–660.MathSciNetCrossRefGoogle Scholar
  7. 7.
    Formal Engineering Design Synthesis, Antonsson, E.K., Cagan, J., Eds., Cambridge: Camb. Univ. Press, 2001.Google Scholar
  8. 8.
    Applegate, L.M., Konsynski, B.R., and Nunamaker, J.F., Model Management Systems: Designs for Decision Support, DSS, 1986, vol. 2, no. 1, pp. 81–91.Google Scholar
  9. 9.
    Arroyo, J.E.C., Vieira, P.S., and Vianna, D.S., A GRAPS Algorithm for the Multi-criteria Minimum Spanning Tree Problem, Ann. Oper. Res., 2008, vol. 159, no. 1, pp. 125–133.zbMATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Artamonov, E.I. and Hachumov, V.M., Sintez structur spezialjnyh sredstv mashinnoy grafiki (Synthesis of Structures for Special Tools of Machine Graphics), Moscow: Inst. Probl. Upravlen., 1991.Google Scholar
  11. 11.
    Avanthay, C., Hertz, A., and Zufferey, N., A Variable Neighborhood Search for Graph Coloring, EJOR, 2003, vol. 151, no. 2, pp. 379–388.zbMATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Avella, P., Villacci, D., and Sforza, A., A Steiner Arborescence Model for the Feeder Reconfiguration in Electric Distribution Networks, EJOR, 2005, vol. 164, no. 2, pp. 505–509.zbMATHCrossRefGoogle Scholar
  13. 13.
    Awerbuch, B., Azar, Y., and Bartal, Y., On-line Generalized Steiner Problem, Theoretical Comput. Sci., 2004, vol. 324, nos. 2–3, pp. 313–324.zbMATHMathSciNetGoogle Scholar
  14. 14.
    Ayres, R.U., Technological Forecasting and Long-Time Planning, New York: McGraw-Hill, 1969.Google Scholar
  15. 15.
    Bachoore, E.H. and Boldaender, H.L., Convex Recoloring of Leaf-Colored Trees, TR UU-CS-2006-010, Dept. of Inform. & CS, Utrecht Univ., 2006.Google Scholar
  16. 16.
    Baligh, H.H., Organization Structures: Theory and Design, Analysis and Prescription, New York: Springer-Verlag, 2006.Google Scholar
  17. 17.
    Bang-Jensen, J. and Gutin, G., Alternating Cycles and Paths in Edge-Colored Multigraphs: A Survey, Discr. Math., 1997, vol. 167–168, pp. 101–114.MathSciNetCrossRefGoogle Scholar
  18. 18.
    Bar-Shalom, Y. and Fortmann, T., Tracking and Data Association, New York: Academic, 1988.zbMATHGoogle Scholar
  19. 19.
    Bar-Shalom, Y., Li, X.-R., Multitarget-Multisensor Tracking: Principles and Techniques, Connecticut: YBS Publishing, 1995.Google Scholar
  20. 20.
    Bar-Yehuda, R., Fekdman, I., and Rawitz, D., Improved Approximation Algorithm for Convex Recoloring of Trees, Theory Computing Systems, 2008, vol. 43, no. 1, pp. 3–18.zbMATHCrossRefGoogle Scholar
  21. 21.
    Barbosa, P.R., Chong, E.K.P., Suvorova, S., and Moran, B., Multitarget-multisensor Tracking in an Urban Environment: A Closed-loop Approach, Proc. of SPIE, 2008, vol. 6969, no. 69690W.Google Scholar
  22. 22.
    Barbosa, V.C., Asis, C.A.G., and Do Nascimento, J.O., Two Novel Evolutionary Formulations of the Graph Coloring Problem, J. Combin. Optimiz., 2004, vol. 8, no. 1, pp. 41–63.zbMATHCrossRefGoogle Scholar
  23. 23.
    Barker, V. and O’Connor, D., Expert System for Configuration at Digital: Xcon and Beyond, Commun. ACM, 1989, vol. 32, no. 3, pp. 298–318.CrossRefGoogle Scholar
  24. 24.
    Basu, A., Blanning, R.W., and Shtub, A., Metagraphs in Hierarchical Modeling, Manag. Sci., 1997, vol. 43, no. 5, pp. 623–639.zbMATHCrossRefGoogle Scholar
  25. 25.
    Batista, T.V., Joolia, A., and Coulson, G., Managing Dynamic Reconfiguration in Component-based Systems, Proc. of the 2nd Eur. Workshop on Software Architecture EWSA’05, 2005, pp. 1–17.Google Scholar
  26. 26.
    Belaziz, M., Bouras, A., and Brun, J.M., Morphological Analysis for Product Design, CAD, 2000, vol. 32, no. 5, pp. 377–388.Google Scholar
  27. 27.
    Benatallah, B., Sheng, Q.Z., and Dumas, M., The Self-serv Environment for Web Services Composition, IEEE Internet Computing, 2003, vol. 7, no. 6, pp. 40–48.CrossRefGoogle Scholar
  28. 28.
    Berman, P. and Ramaiyer, V., Improved Approximations for the Steiner Tree Problem, J. Algorithms, 1994, vol. 17, no. 3, pp. 381–408.zbMATHMathSciNetCrossRefGoogle Scholar
  29. 29.
    Bertsimas, D. and Sim, M., Robust Discrete Optimization, Working Paper, Oper. Res. Center, MIT, 2002.Google Scholar
  30. 30.
    Bhatnagar, S., Ganguly, S., and Izmailov, R., Design of IEEE 802.16-based Multi-hop Wireless Backhaul Network, Proc. 1st Int. Conf. on Access Networks, Greece, 2006, Article no. 5.Google Scholar
  31. 31.
    Bi, Z.M., Gruver, W.A., and Lang, S.Y.T., Analysis and Synthesis of Reconfigurable Robotic Systems, Concurrent Eng.: Res. Appl., 2004, vol. 12, no. 2, pp. 145–153.CrossRefGoogle Scholar
  32. 32.
    Binbasioglu, M., Key Features for Model Building Decision Support Systems, EJOR, 1995, vol. 82, no. 3, pp. 422–437.zbMATHCrossRefGoogle Scholar
  33. 33.
    Birmingham, W.P., Brennan, A., Gupta, A.P., and Siewiorek, D.P., Micon: A Single Board Computer Synthesis Tool, IEEE Circuits Devices Magazine, 1988, vol. 4, no. 1, pp. 37–46.CrossRefGoogle Scholar
  34. 34.
    Blake, M.B., Agent-based Workflow Configuration and Management of On-line Services, Proc. Int. Conf. on Electronic Commerce Res. (ICECR-4), Dallas, 2001, pp. 567–588.Google Scholar
  35. 35.
    Blake, M.B. and Gomaa, H., Agent-oriented Compositional Approaches to Services-based Cross-organizational Workflow, DSS, 2005, vol. 40, no. 1, pp. 31–50.Google Scholar
  36. 36.
    Blackman, S.S., Multiple-Target Tracking with Radar Applications, Dedham: Artech House, 1986.Google Scholar
  37. 37.
    Bless, P.N., Kapoor, S.G., DeVor, R.E., and Klabjan, D., An Algorithmic Strategy for Automated Generation of Multicomponent Software Tools for Virtual Manufacturing, J. Manufact. Sci. Eng., 2005, vol. 127, no. 4, pp. 866–874.CrossRefGoogle Scholar
  38. 38.
    Bless, P.N., Klabjan, D., and Chang, S.Y., Heuristics for Automated Knowledge Source Integration and Service Composition, Comput. Oper. Res., 2008, vol. 35, no. 4, pp. 1292–1314.zbMATHCrossRefGoogle Scholar
  39. 39.
    Blomqvist, E., Levashova, T., Ohgren, A., Sandkuhl, K., Smirnov, A., and Tarassov, V., Configuration of Dynamic SME Supply Chains Based on Ontologies, in Holonic and Multi-Agent Systems for Manufacturing, Marik, V., Brennan R.W., Pechoucek M., Eds., Berlin: Springer-Verlag, 2005, pp. 246–256.Google Scholar
  40. 40.
    Blum, A., New Approximation Algorithms for Graph Coloring, J. ACM, 1994, vol. 41, no. 3, pp. 470–516.zbMATHMathSciNetCrossRefGoogle Scholar
  41. 41.
    Bodlaender, H.L., Kloks, T., Tan, R.B., and Van Leeuwen, J., Approximations for lambda-Coloring of Graphs, Computer J., 2004, vol. 47, no. 2, pp. 193–204.zbMATHCrossRefGoogle Scholar
  42. 42.
    Bondalapati, K. and Prasanna, V.K., Reconfigurable Computing Systems, Proc. IEEE, 2002, vol. 90, no. 7, pp. 1201–1217.CrossRefGoogle Scholar
  43. 43.
    Boon, B. and Park, Y., A Systematic Approach for Identifying Technology Opportunities: Keyword-based Morphology Analysis, Technol. Forecasting & Social Change, 2005, vol. 72, no. 2, pp. 145–160.CrossRefGoogle Scholar
  44. 44.
    Bordetsky, A.B., Peltsverger, B., Peltsverger, S., and Statnikov, R.B., Multi-criteria Approach in Configuration of Energy Efficient Sensor Networks, Proc. 43rd ACM Southeast Reg. Conf., 2005, vol. 2, pp. 28–29.CrossRefGoogle Scholar
  45. 45.
    Bouhmala, N. and Granmo, O.-C., Solving Graph Coloring Problems Using Learning Automata, in Proc. of 8th Eur. Conf. on Evolutionary Computation in Combinatorial Optimization EvoCOP 2008, van Hemert, J. and Cotta, C., Eds., Berlin: Springer-Verlag, 2008, pp. 277–288.CrossRefGoogle Scholar
  46. 46.
    Braha, D., Design-as-Satisfiability: A New Approach to Automated Synthesis, AI EDAM, 2001, vol. 15, no. 5, pp. 385–399.zbMATHGoogle Scholar
  47. 47.
    Brelaz, D., New Methods to Color the Vertices of a Graph, Commun. ACM, 1979, vol. 22, no. 4, pp. 251–256.zbMATHMathSciNetCrossRefGoogle Scholar
  48. 48.
    Briggs, P., Cooper, K.D., and Torczon, L., Improvements to Graph Coloring Register Allocation, ACM Trans. Program. Languag. Syst., 1994, vol. 16, no. 3, pp. 428–455.CrossRefGoogle Scholar
  49. 49.
    Brinkkemper, S., Method Engineering: Engineering of Information Systems Development Methods and Tools, Inform. Software Technol., 1996, vol. 38, no. 4, pp. 275–280.CrossRefGoogle Scholar
  50. 50.
    Brooks, R.L., On Coloring the Nodes of Network, Proc. Cambridge Phil. Soc., 1940, vol. 37, pp. 194–197.MathSciNetCrossRefGoogle Scholar
  51. 51.
    Brown, D.C., Defining Configuring, AI EDAM, 1998, vol. 12, no. 4, pp. 301–305.Google Scholar
  52. 52.
    Bui, T.N. and Nguyen, T.H., An Agent-based Algorithm for Generalized Graph Colorings, in Proc. 8th Ann. Conf. on Genetic and Evolutionary Computation GECCO’06, Seattle, 2006, pp. 19–28.Google Scholar
  53. 53.
    Bui, T.N., Nguyen, T.H., Patel, C.M., and Phan, K.-A.T., An Ant-based Algorithm for Coloring Graphs, Discr. Appl. Math., 2008, vol. 156, no. 2, pp. 190–200.zbMATHMathSciNetCrossRefGoogle Scholar
  54. 54.
    Cagan, J., Campbell, M.I., Finger, S., and Tomiyama, T., A Framework for Computational Design Synthesis: Model and Applications, J. Comput. Inform. Sci. Eng., 2005, vol. 5, no. 3, pp. 171–181.CrossRefGoogle Scholar
  55. 55.
    Campbell, M.I., Cagan, J., and Kotovsky, K., Agent-based Synthesis of Electromechanical Design Configurations, J. Mechanical Design, 2000, vol. 122, no. 1, pp. 61–69.CrossRefGoogle Scholar
  56. 56.
    Campbell, M.I., Cagan, J., and Kotovsky, K., The A-design Approach to Managing Automated Design Synthesis, Res. Eng. Des., 2003, vol. 14, no. 1, pp. 12–24.Google Scholar
  57. 57.
    Canuto, S.A., Resende, M.G.C., and Ribeiro, C.C., Local Search with Perturbations for the Prize-collecting Steiner Tree Problem in Graphs, Networks, 2001, vol. 38, no. 1, pp. 50–58.zbMATHMathSciNetCrossRefGoogle Scholar
  58. 58.
    Caramia, M. and Dell’Olmo, P., Bounding Vertex Coloring by Truncated Multistage Branch and Bound, Networks, 2004, vol. 44, no. 4, pp. 231–242.zbMATHMathSciNetCrossRefGoogle Scholar
  59. 59.
    Caramia, M., Dell’Olmo, P., and Italiano, G.F., CHECKGOL: Improved Local Search for Graph Coloring, J. Discrete Algorithms, 2006, vol. 4, no. 2, pp. 277–298.zbMATHMathSciNetCrossRefGoogle Scholar
  60. 60.
    Caramia, S.A. and Dell’Olmo, P., Embedding a Novel Objective Funciton in a Two-phase Local Search for Robust Vertex Coloring, EJOR, 2008, vol. 189, no. 3, pp. 1358–1380.zbMATHMathSciNetCrossRefGoogle Scholar
  61. 61.
    Caramia, S.A. and Dell’Olmo, P., Coloring Graphs by Iterated Local Search Transversing Feasible and Infeasible Solutions, Discr. Appl. Math., 2008, vol. 156, no. 2, pp. 201–217.zbMATHMathSciNetCrossRefGoogle Scholar
  62. 62.
    Experimental Design for Combinatorial and High Throughput Material Development, Cawse, J.N., Ed., New York: Wiley, 2002.Google Scholar
  63. 63.
    Cela, E., The Quadratic Assignment Problem, Dordrecht: Kluwer, 1998.zbMATHGoogle Scholar
  64. 64.
    Chams, M., Hertz, A., and de Werra, D., Some Experiments with Simulated Annealing for Coloring Graphs, EJOR, 1987, vol. 32, no. 2, pp. 260–266.zbMATHCrossRefGoogle Scholar
  65. 65.
    Chang G.J., and Lu, C., Distance-two Labelings of Graphs, Eur. J. Comb., 2003, vol. 24, no. 1, pp. 53–58.zbMATHMathSciNetCrossRefGoogle Scholar
  66. 66.
    Chang, G.J., Chen, J.-J., Kuo, D., and Liaw, S.-C., Distance-two Labelings of Graphs, Discr. Appl. Math., 2007, vol. 155, no. 8, pp. 1007–1013.zbMATHMathSciNetCrossRefGoogle Scholar
  67. 67.
    Chari, K., Model Composition Using Filter Spaces, Inform. Syst. Res., 2002, vol. 13, no. 1, pp. 15–35.CrossRefGoogle Scholar
  68. 68.
    Chari, K., Model Composition in a Distributed Environment, DSS, 2003, vol. 35, no. 3, pp. 399–413.Google Scholar
  69. 69.
    Charicar, M., Chekuri, C., Cheung, T.-Y., Dai, Z., Goel, A., Guha, S., and Li, M., Approximation Algorithms for Directed Steiner Problems, J. Algorithms, 1999, vol. 33, no. 1, pp. 73–91.MathSciNetCrossRefGoogle Scholar
  70. 70.
    Chandra, C. and Grabis, J., Supply Chain Configuration, New York: Springer-Verlag, 2007.Google Scholar
  71. 71.
    Charon, I. and Hudry, O., Optimal Clustering of Multipartite Graphs, Discr. Appl. Math., 2008, vol. 156, no. 8, pp. 1330–1347.zbMATHMathSciNetCrossRefGoogle Scholar
  72. 72.
    Chekuri, C., Even, G., and Kortsarz, G., A Greedy Approximation Algorithm for the Group Steiner Problem, Discr. Appl. Math., 2006, vol. 154, no. 1, pp. 15–34.zbMATHMathSciNetCrossRefGoogle Scholar
  73. 73.
    Chen, G. and Hong, L., A Genetic Algorithm Based Multi-dimensional Data Association Algorithm for Sensor-multi-target Tracking, Math. Comput. Modelling, 1997, vol. 26, no. 4, pp. 57–69.MathSciNetCrossRefGoogle Scholar
  74. 74.
    Chen, G., Chen, S., Guo, W., and Chen, W., The Multicriteria Minimum Spanning Tree Problem Based Genetic Algorithm, Inform. Sci., 2007, vol. 177, no. 22, pp. 5050–5063.zbMATHMathSciNetCrossRefGoogle Scholar
  75. 75.
    Chen, X. and Simons, M., A Component Framework for Dynamic Reconfiguration of Distributed Systems, in Proc. of the IFIP/ACM Working Conf. on Component Deployment, Bisshop, J., Ed., Berlin: Springer-Verlag, 2002, pp. 82–96.Google Scholar
  76. 76.
    Cheng, X. and Du, D.-Z., Steiner Trees in Industries, Dordrecht: Kluwer, 2001.Google Scholar
  77. 77.
    Cheng, J., Ke, Y., and Ng, W., A Survey on Algorithms for Mining Frequent Itemsets over Data Streams, Knowledge Inf. Systems, 2008, vol. 16, no. 1, pp. 1–127.CrossRefMathSciNetGoogle Scholar
  78. 78.
    Chong, C.-Y., Mori, S., Barker, W.H., and Chang, K.-C., Architectures and Algorithms for Track Association and Fusion, IEEE Aerospace Electronic Syst. Magazine, 2000, vol. 15, no. 1, pp. 5–13.CrossRefGoogle Scholar
  79. 79.
    Chorpa, S., Gorres, E.R., and Rao, M.R., Solving the Steiner Tree Problem on a Graph Using Branch and Cut, ORSA J. Comput., 1992, vol. 4, no. 3, pp. 320–355.Google Scholar
  80. 80.
    Ciuksys, D. and Caplinkas, A., Reusing Ontological Knowledge about Business Processes in IS Engineering: Process Configuration Problem, Informatica, 2007, vol. 18, no. 4, pp. 585–602.zbMATHGoogle Scholar
  81. 81.
    Coble, J., Cook, D.J., and Holder, L.B., Structure Discovery in Sequentially-connected Data Streams, Int. J. Artif. Intell. Tools, 2006, vol. 15, no. 6, pp. 917–944.CrossRefGoogle Scholar
  82. 82.
    Colombo, G., Mosca, A., and Sartori, F., Towards the Design of Intelligent CAD Systems: An Ontological Approach, Adv. Eng. Informatics, 2007, vol. 21, no. 2, pp. 153–168.CrossRefGoogle Scholar
  83. 83.
    Conradi, R. and Westfechtel, B., Versions Models for Software Configuration Management, ACM Comput. Surv., 1998, vol. 30, no. 2, pp. 232–282.CrossRefGoogle Scholar
  84. 84.
    Corbett, B. and Rosen, D.W., A Configuration Design Based Method of Platform Commonization for Product Families, AI EDAM, 2004, vol. 18, no. 1, pp. 21–39.CrossRefGoogle Scholar
  85. 85.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C., Introduction to Algorithms, Boston: MIT Press, 2001.zbMATHGoogle Scholar
  86. 86.
    Costa, D. and Hertz, A., Ants Can Color Graphs, J. ORS, 1997, vol. 48, no. 3, pp. 295–305.zbMATHGoogle Scholar
  87. 87.
    Costa, A.M., Cordeau, J.-F., and Laporte, G., Steiner Tree Problems with Profits, INFOR, 2006, vol. 44, no. 2, pp. 99–115.MathSciNetGoogle Scholar
  88. 88.
    Costa, A.M., Cordeau, J.-F., and Laporte, G., Fast Heuristics for the Steiner Tree Problem with Revenues, Budget and Hop Contraints, EJOR, 2008, vol. 190, no. 1, pp. 68–78.zbMATHMathSciNetCrossRefGoogle Scholar
  89. 89.
    Couch, A., System Configuration Management, in Handbook on Network and System Administration, Bergstra, J. and Burgess, M., Eds., Amsterdam: Elsevier, 2008, pp. 75–133.CrossRefGoogle Scholar
  90. 90.
    Couch, A. and Sun, Y., On Observed Reproducibility in Network Configuration Management, Sci. Computer Program., 2004, vol. 53, no. 2, pp. 215–253.zbMATHMathSciNetCrossRefGoogle Scholar
  91. 91.
    Current, J., Min, H., and Schilling, D., Multiobjective Analysis of Facility Location Decisions, EJOR, 1990, vol. 49, no. 3, pp. 295–300.zbMATHCrossRefGoogle Scholar
  92. 92.
    Current, J. and Marsh, M., Multiple Transportation Network Design and Routing Problems: Taxonomy and Annotation, EJOR, 1993, vol. 65, no. 1, pp. 4–19.zbMATHCrossRefGoogle Scholar
  93. 93.
    Daskin, M.S., Networks and Discrete Location. Models, Algorithms, and Applications, New York: Wiley, 1995.Google Scholar
  94. 94.
    Dawande, M., Keskinocak, P., Swaminathan, J.M., and Tayur, S., On Bipartite and Multipartite Clique Problems, J. Algorithms, 2001, vol. 41, no. 2, pp. 388–403.zbMATHMathSciNetCrossRefGoogle Scholar
  95. 95.
    de Aragao, M.P., Uchoa, E., and Werneck, R.F., Dual Heuristics on the Exact Solution of Large Steiner Problems, Electronic Notes Discr. Math., 2001, vol. 7, pp. 150–153.CrossRefGoogle Scholar
  96. 96.
    de Werra, D., An Introduction to Timetabling, EJOR, 1985, vol. 19, no. 2, pp. 151–162.zbMATHCrossRefGoogle Scholar
  97. 97.
    Deb, S., Yeddanapudi, M., Pattipati, L., and Bar-Shalom, Y., A Generalized s-d Assignment Algorithm for Multisensor-multitarget State Estimation, IEEE Trans. Aerospace Electronic Syst., 1997, vol. 33, no. 2, part 1, pp. 523–538.CrossRefGoogle Scholar
  98. 98.
    Dell’Amico, M. and Maffioli, F., Combining Linear and Non-linear Objectives in Spanning Tree Problems, J. Combin. Optimiz., 2000, vol. 4, no. 2, pp. 253–269.zbMATHMathSciNetCrossRefGoogle Scholar
  99. 99.
    Dietmar, K., Channel Assignment for Cellular Radio Using Neural Networks, IEEE Trans. Vehicular Technol., 1991, vol. 40, no. 1–2, pp. 188–193.Google Scholar
  100. 100.
    Dijkstra, E.W., A Note on Two Problems in Connection with Graphs, in Numerische Mathematics, Amsterdam: Mathematisch Centrum, 1956, vol. 1, pp. 269–271.Google Scholar
  101. 101.
    Diveev, A.I., Managed Networks and Their Applications, J. Comput. Math. Math. Physics, 2008, vol. 48, no. 8, pp. 1510–1525.MathSciNetGoogle Scholar
  102. 102.
    Dorne, R. and Hao, J.-K., Tabu Search for Graph Coloring, T-coloring and Set T-coloring, in Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Voss S.A., Martello S., Osman I.H., and Roucairol C., Eds., Boston: Kluwer, 1999, pp. 77–92.Google Scholar
  103. 103.
    Dror, M. and Haouari, M., Generalized Steiner Problems and Other Variants, J. Combin. Optimiz., 2000, vol. 4, no. 4, pp. 415–436.zbMATHMathSciNetCrossRefGoogle Scholar
  104. 104.
    Dror, M., Haouari, M., and Chaouachi, J., Generalized Spanning Trees, EJOR, 2000, vol. 120, no. 3, pp. 583–592.zbMATHMathSciNetCrossRefGoogle Scholar
  105. 105.
    Dubov, Y.A., Travkin, S.I., and Iakimets, V.N., Mnogokriterialjnye modeli postroenia variantov vybora system (Multicriteria Models for Building of System Choice Variants), Moscow: Nauka, 1986.Google Scholar
  106. 106.
    Du, D.-Z, Smith, J.M., and Rubinstein, J.H., Advances in Steiner Trees, Dordrecht: Kluwer, 2000.zbMATHGoogle Scholar
  107. 107.
    Du, D.-Z. and Hu, X., Steiner Tree Problems in Computer Communication Networks, Singapore: World Sci., 2008.zbMATHGoogle Scholar
  108. 108.
    Duff, I.S., On Algorithms for Obtaining a Maximum Transversal, ACM Trans. Math. Software, 1981, vol. 7, no. 3, pp. 315–330.CrossRefGoogle Scholar
  109. 109.
    Duin, C.W., Volgenant, A., and Voss, S., Solving Group Steiner Problems as Steiner Problem, EJOR, 2004, vol. 154, no. 1, pp. 323–329.zbMATHMathSciNetCrossRefGoogle Scholar
  110. 110.
    Eiben, A.E., Van Der Hauw, J.K., and Van Hemert, J.I., Graph Coloring with Adaptive Evolutionary Algorithms, J. Heuristics, 1998, vol. 4, no. 1, pp. 25–46.zbMATHCrossRefGoogle Scholar
  111. 111.
    Eiter, T. and Gottlob, G., Identifying the Minimal Transversals of Hypergraph and Related Problems, SIAM J. Computing, 1995, vol. 24, no. 6, pp. 1278–1304.zbMATHMathSciNetCrossRefGoogle Scholar
  112. 112.
    Eiter, T. and Gottlob, G., Hypergraph Transversal Computation and Related Problems in Logic and AI, in Proc. Eur. Conf. on Logics in AI JELIA 2002, Berlin: Springer-Verlag, 2002, pp. 549–564.Google Scholar
  113. 113.
    Emelyanov, S.V., Ozernoy, V.M., Larichev, O.I. et al., Choice of Rational Variants of Technological Mines upon Multiple Criteria, Mining J., 1972, no. 5, pp. 62–71.Google Scholar
  114. 114.
    Ensen, T.R. and Toft, B., Graph Coloring Problems, New York: Wiley, 1995.Google Scholar
  115. 115.
    Estublier, J., Leblang, D., Van Der Hoek, A., Conradi, R., Clemm, G., Tichy, W., and Wiborg-Weber, D., Impact of Software Engineering Research on the Practice of Software Configuration Management, ACM Trans. Software Eng. Methodology, 2005, vol. 14, no. 5, pp. 383–430.CrossRefGoogle Scholar
  116. 116.
    Even, S., Itai, A., and Shamir, A., On the Comlexity of Timetable and Multicommodity Flow Problems, SIAM J. Comput., 1976, vol. 5, no. 4, pp. 691–703.zbMATHMathSciNetCrossRefGoogle Scholar
  117. 117.
    Even, G., Lotker, Z., Ron, D., and Smorodinsky, S., Conflict-free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks, SIAM J. Computing, 2003, vol. 33, no. 1, pp. 94–136.zbMATHMathSciNetCrossRefGoogle Scholar
  118. 118.
    Even, S., Kortsarz, G., and Slany, W., On Network Design Problems: Fixed Cost Flows and the Covering Steiner Problem, ACM Trans. Algorithms, 2005, vol. 1, no. 1, pp. 74–101.MathSciNetCrossRefGoogle Scholar
  119. 119.
    Combinatorial Chemistry and Technologies: Methods and Applications, Fassina, G. and Miertus, S., Eds., Boca Raton: CRC Press, 2005.Google Scholar
  120. 120.
    Feder, T., Motwani, R., O’Callaghan, L., Olston, C., and Panigrahy, R., Computing Shortest Paths with Uncertainty, J. Algorithms, 2007, vol. 62, no. 1, pp. 1–16.zbMATHMathSciNetCrossRefGoogle Scholar
  121. 121.
    Feldman, S.I., Software Configuration Management: Past Uses and Future Challenges, Proc. 3rd Eur. Software Eng. Conf. ESEC’91, Berlin: Springer-Verlag, 1991, pp. 1–6.Google Scholar
  122. 122.
    Fleischanderl, G., Friedrich, G.E., Haselbock, A., Schreiner, H., and Stumptmer, M., Configuring Large Systems Using Generative Constraint Satisfaction, IEEE Intell. Syst. Appl., 1998, vol. 13, no. 4, pp. 59–68.CrossRefGoogle Scholar
  123. 123.
    Fleurent, C. and Ferland, J.A., Genetic and Hybrid Algorithms for Graph Coloring, Annals Oper. Res., 1996, vol. 63, no. 3, pp. 437–461.zbMATHCrossRefGoogle Scholar
  124. 124.
    Fredman, M.L. and Tarjan, R.E., Fobinacci Heaps and Their Uses in Improved Network Optimization Algorithms, J. ACM, 1987, vol. 34, no. 3, pp. 596–615.MathSciNetCrossRefGoogle Scholar
  125. 125.
    Funabiki, N. and Takefuji, Y., Neural Network Parallel Algorithm for Channel Assignment in Cellular Radio Networks, IEEE Trans. Vehicular Technol., 1992, vol. 41, no. 4, pp. 430–437.CrossRefGoogle Scholar
  126. 126.
    Gabow, H.N., Two Algorithms for Generating Weighted Spanning Trees in Order, SIAM J. Computing, 1977, vol. 6, no. 1, pp. 139–150.zbMATHMathSciNetCrossRefGoogle Scholar
  127. 127.
    Gabow, H.N., Galil, Z., Spencer, T., and Tarjan, R.E., Efficient Algorithms for Finding Minimum Spanning Trees in Undirected and Directed Graphs, Combinatorica, 1986, vol. 6, no. 2, pp. 109–122.zbMATHMathSciNetCrossRefGoogle Scholar
  128. 128.
    Gaft, M.G., Milovidov, N.N., Serov, V.I., and Gusev, E.D., Decision Making Method for Choice of Rational Configurations of Car, in Problems and Methods of Decision Making in Organizational ManagementSystems, Moscow: Inst. Sist. Anal., 1982, pp. 77–82.Google Scholar
  129. 129.
    Galbraith, J.R., Designing Organizations: An Executive Guide to Strategy, Structure, and Process Revised, New York: Jossey-Bass, 2001.Google Scholar
  130. 130.
    Galinier, P. and Hao, J.-K., Hybrid Evolutionary Algorithms for Graph Coloring, J. Combin. Optimiz., 1999, vol. 3, no. 4, pp. 379–397.zbMATHMathSciNetCrossRefGoogle Scholar
  131. 131.
    Galinier, P. and Hertz, A., A Survey of Local Search Methods for Graph Coloring, Comput. Oper. Res., 2006, vol. 33, no. 9, pp. 2547–2562.zbMATHMathSciNetCrossRefGoogle Scholar
  132. 132.
    Gao, J. and Lu, M., Fuzzy Quadratic Minimum Spanning Tree Problem, Appl. Math. Comput., 2005, vol. 164, no. 3, pp. 773–788.zbMATHMathSciNetCrossRefGoogle Scholar
  133. 133.
    Garey, M.R. and Johnson, D.S., Computers and Intractability. The Guide to the Theory of NP-Completeness, San Francisco: Freeman, 1979.Google Scholar
  134. 134.
    Gen-Huey, C., Houle, M.E., and Ming-Ter, K., The Steiner Problem in Distributed Computing Systems, Inform. Sci., 1993, vol. 74, nos. 1–2, pp. 73–96.zbMATHMathSciNetCrossRefGoogle Scholar
  135. 135.
    Georgas, J.C. and Taylor, R.N., Towards a Knowledge-based Approach to Architectural Adaptation Management, Proc. 1st ACM SIGSOFT Workshop of Self-managed Systems, New Beach, California, 2004, pp. 39–43.Google Scholar
  136. 136.
    Georgas, J.C., van der Hoek, A., and Taylor, R.N., Architectural Runtime Configuration Management in Support of Dependable Self-adaptaion software, ACM SIGSOFT Software Eng. Notes, 2005, vol. 30, no. 4, pp. 1–6.Google Scholar
  137. 137.
    Gerlach, J. and Kuo, F.-Y., An Approach to Dialog Management for Presentation and Manipulation of Composite Models in Decision Support Systems, DSS, 1990, vol. 6, no. 3, pp. 227–242.Google Scholar
  138. 138.
    Geyer, P., Multidisciplinary Grammars Supporting Design Optimization of Buildings, Res. Eng. Design, 2008, vol. 18, no. 4, pp. 197–216.MathSciNetCrossRefGoogle Scholar
  139. 139.
    Gordeev, E.N. and Tarastsov, O.G., Steiner Problem. Survey, Discr. Math., 1993, vol. 5, no. 2, pp. 3–28.MathSciNetGoogle Scholar
  140. 140.
    Grebenuk, G.G. and Krygin, A.A., Algorithms for Optimization of the Number of Switchings in Heat Supply Network Reconfiguration, Autom. Remote Control, 2007, vol. 68, no. 12, pp. 2187–2197.MathSciNetCrossRefGoogle Scholar
  141. 141.
    Griggs, J.R. and Yeh, R.K., Labeling Graphs with a Condition at Distance 2, SIAM J. Discr. Math., 1992, vol. 5, no. 4, pp. 586–595.zbMATHMathSciNetCrossRefGoogle Scholar
  142. 142.
    Grishicheva, J.V. and Selivestrov, A.V., A Note on Cliques in Multipartite Graph, archiv: math/0404125v1 [math.Co], 2004.Google Scholar
  143. 143.
    Grosh, D. and Agarwal, R., Model Selection and Sequencing in Decision Support Systems, OMEGA, 1991, vol. 19, nos. 2–3, pp. 157–167.Google Scholar
  144. 144.
    Grotschel, M., Martin, A., and Weismantel, R., The Steiner Tree Packing Problem in VLSI Design, Math. Program., Ser. B, 1997, vol. 78, no. 2, pp. 2675–281.MathSciNetCrossRefGoogle Scholar
  145. 145.
    Gubko, M.V., The Search for Optimal Organizational Hierarchies with Homogeneous Manager Cost Functions, Autom. Remote Control, 2008, vol. 69, no. 1, pp. 89–104.zbMATHMathSciNetGoogle Scholar
  146. 146.
    Guha, S. and Khuller, S., Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets, Inform. Comput., 1999, vol. 150, no. 1, pp. 57–74.MathSciNetCrossRefGoogle Scholar
  147. 147.
    Gupta, A. and Pal, M., Stochastic Steiner Tree without Root, in Proc. of 32nd Int. Colloquium on Automata, Languages and Programming ICALP 2005, Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., and Yung, M., Eds., Berlin: Springer-Verlag, 2005, pp. 1051–1063.Google Scholar
  148. 148.
    Gupta, A., Hajiaghayi, M., and Kumar, A., Stochastic Steiner Tree with Non-unifirm Inflation, in Approx., Randomization, and Comb. Optim.: Algorithms and Techniques, APPROX-RANDOM 2007, Charikar, M., Jansen, K., Reingold, O., and Rolim, J.D.P., Eds., Berlin: Springer-Verlag, 2007, pp. 134–148.CrossRefGoogle Scholar
  149. 149.
    Gupta, A., Kumar, A., Pal, M., and Roughgarden, T., Approximation via Cost Sharing: Simpler and Better Approximation Algorithms for Network Design, J. ACM, 2007, vol. 54, no. 3, pp. 11–49.MathSciNetCrossRefGoogle Scholar
  150. 150.
    Gupta, D., Jalote, P., and Barua, G., A Formal Framewpork for On-line Software Version Change, IEEE Trans. Software Eng., 1996, vol. 22, no. 2, pp. 120–131.CrossRefGoogle Scholar
  151. 151.
    Gutin, G., Cycles and Paths in Semicomplete Multipartite Digraphs, Theorems and Algorithms: A Survey, J. Graph Theory, 1995, vol. 19, no. 4, pp. 481–505.zbMATHMathSciNetCrossRefGoogle Scholar
  152. 152.
    Gutner, S., Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems, in 2nd Annu. Int. Conf. on Combinatorial Optimization and Applications COCOA 2008, Yang, B., Du, D.-Z., and Wang, C.A., Eds., Berlin: Springer-Verlag, 2008, pp. 246–254.Google Scholar
  153. 153.
    Hack, S. and Goos, G., Copy Coalescing by Graph Recoloring, ACM SIGPLAN Notices, 2008, vol. 43, no. 6, pp. 227–237.CrossRefGoogle Scholar
  154. 154.
    Hale, W.K., Frequency Assignment: Theory and Applications, Proc. IEEE, 1980, vol. 68, no.12, pp. 1497–1514.CrossRefGoogle Scholar
  155. 155.
    Hall, M., Combinatorial Theory, New York: Wiley, 1986.zbMATHGoogle Scholar
  156. 156.
    Hamaher, H.W. and Ruhe, G., On Spanning Tree Problem with Multiple Objectives, Ann. Oper. Res., 1995, vol. 52, no. 4, pp. 209–230.CrossRefGoogle Scholar
  157. 157.
    Hamirez, J.-P. and Hao, J.-K., Scatter Search for Graph Coloring, in Selected Papers from the 5th Eur. Conf. on Artificial Evolution, 2001, pp. 168–179.Google Scholar
  158. 158.
    Harary, F., Graphs Theory, Readings: Addison-Wesley, 1964.Google Scholar
  159. 159.
    Graphs and Applications, Harary, F. and Maybee, J., Eds., New York: Wiley, 1985.zbMATHGoogle Scholar
  160. 160.
    Hazan, E., Safra, S., and Schwartz, O., On the Hardness of Approximating k-Dimensional Matching, ECCC, TR03-20, 2003.Google Scholar
  161. 161.
    Hebert, C., Bretto, A., and Cremilleux, B., A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation, Fundamenta Informaticae, 2007, vol. 80, no. 4, pp. 415–433.zbMATHMathSciNetGoogle Scholar
  162. 162.
    Hertz, A. and de Werra, D., Using Tabu Search Techniques for Graph Coloring, Computing, 1987, vol. 39, no. 4, pp. 345–351.zbMATHMathSciNetCrossRefGoogle Scholar
  163. 163.
    Heydon, A., Levin, R., Mann, T., and Yu, Y., Software Configuration Management System Using Vesta, New York: Springer-Verlag, 2006.Google Scholar
  164. 164.
    Hillman, J. and Warren, I., Open Framework for Dynamic Reconfiguration, Proc. 24 Int. Conf. on Software Engineering (ICSE 2004), Edinburgh, 2004, pp. 594–603.Google Scholar
  165. 165.
    Hoppner, F., Klawonn, F., Kruse, R., and Runkler, T., Fuzzy Cluster Analysis, New York: Wiley, 1999.Google Scholar
  166. 166.
    Hotz, L., Wolter, K., and Krebs, T., Configuration in Industrial Product Families, Amsterdam: IOS, 2006.Google Scholar
  167. 167.
    Hwang F.K., Richards D.S., and Winter P., The Steiner Tree Problem. Amsterdam: Elsevier, 1992.zbMATHGoogle Scholar
  168. 168.
    Iijima, J., Automatic Model Building and Solving for Optimization Software, DSS, 1996, vol. 18, no. 3–4, pp. 293–300.Google Scholar
  169. 169.
    Imase, M. and Waxman, B.M., Dynamic Steiner Tree Problem, SIAM J. Discr. Math., 1991, vol. 4, no. 3, pp. 369–384.zbMATHMathSciNetCrossRefGoogle Scholar
  170. 170.
    Ivanov, A.O. and Tuzhilin, A.A., Minimal Networks: The Steiner Problem and Its Generalizations, Boca Raton: CRC Press, 1994.zbMATHGoogle Scholar
  171. 171.
    Jain, A.K., Murty, M.N., and Flynn, P.J., Data Clustering: A Review, ACM Comput. Surv., 1992, vol. 31, no. 3, pp. 264–323.CrossRefGoogle Scholar
  172. 172.
    Janiak, A. and Kasperski, A., The Minimum Spanning Tree Problem with Fuzzy Costs, Fuzzy Optimiz. Decision Making, 2008, vol. 7, no. 2, pp. 105–118.MathSciNetCrossRefzbMATHGoogle Scholar
  173. 173.
    Jardine, N. and Sibson, R., Mathematical Taxonomy, London: Wiley, 1971.zbMATHGoogle Scholar
  174. 174.
    Jarke, M. and Rademacher, F.J., The AI Potential of Model Management and Its Central Role in Decision Support, DSS, 1998, vol. 4, no. 4, pp. 387–404.Google Scholar
  175. 175.
    Structure-based Drug Discovery, Jhoti, H. and Leach, A.R., Eds., New York: Springer-Verlag, 2007.Google Scholar
  176. 176.
    Johnson, D.S., Yannakakis, M., and Papadimitriou, C.H., On Generating All Maximal Independent Sets, Inform. Process. Lett., 1988, vol. 27, no. 3, pp. 119–123.zbMATHMathSciNetCrossRefGoogle Scholar
  177. 177.
    Johnson, D.S., Aragon, C.R., McGeoch, L.A., and Schevon, C., Optimization by Simulated Annealing: An Experimental Evaluation, Part II: Graph Coloring and Number Partitioning, Oper. Res., 1991, vol. 39, no. 3, pp. 378–406.zbMATHCrossRefGoogle Scholar
  178. 178.
    Cliques, Coloring, and Satisfiability, Johnson, D.S. and Trick, M.A., Eds., Providence: AMS, 1996.zbMATHGoogle Scholar
  179. 179.
    Johnston, S.L., An Efficient Decentralized Multiradar Multitarget Tracker for Air Surveillance, IEEE Trans. Aerospace Electronic Syst., 2008, vol. 44, no. 2, pp. 655–677.CrossRefGoogle Scholar
  180. 180.
    Jones, J.C., Design Methods, New York: Wiley, 1981.Google Scholar
  181. 181.
    Jonyer, I., Cook, D.J., and Holder, L.B., Graph-based Hierarchical Conceptual Clustering, J. Machine Learning Res., 2001, vol 2, pp. 19–43.CrossRefGoogle Scholar
  182. 182.
    Joobbani, R. and Siewiorek, D.P., WEAVER: A Knowledge-based Routing Expert, IEEE Design Test Computers, 1986, vol. 3, no. 1, pp. 12–23.CrossRefGoogle Scholar
  183. 183.
    Kabale, M. and Jaskowski, B., Generalized Implicit Enumeration Algorihtm for Graph Coloring, Commun. ACM, 1985, vol. 28, no. 4, pp. 412–418.CrossRefGoogle Scholar
  184. 184.
    Kannan, S. and Proebsting, T., Register Allocation in Structured Programs, J. Algorithms, 1998, vol. 29, no. 2, pp. 223–237.zbMATHMathSciNetCrossRefGoogle Scholar
  185. 185.
    Kapsalis, A., Rayward-Smith, V.J., and Smith, G.D., Solving the Graphical Steiner Tree Problem Using Genetic Algorithm, J. ORS, 1993, vol. 44, no. 4, pp. 397–406.zbMATHGoogle Scholar
  186. 186.
    Karam, N., Linckels, S., and Mainel, C., Semantic Composition of Lecture Subparts for a Personalized E-learning, in Proc. of 4th Eur. Semantic Web Conf. ESWC 2007, Franconi, E., Kifer, M., and May, W., Eds., Berlin: Springer-Verlag, 2007, pp. 716–728.Google Scholar
  187. 187.
    Karger, D., Motwani, R., and Sudan, M., Approximate Graph Coloring by Semidefinite Programming, J. ACM, 1998, vol. 45, no. 2, pp. 246–265.zbMATHMathSciNetCrossRefGoogle Scholar
  188. 188.
    Karp, R.M., Reducibility among Combinatorial Problems, in Complexity of Computer Computations, Miller R.E. and Thatcher J.W., Eds., New York: Plenum, 1972, pp. 85–103.Google Scholar
  189. 189.
    Kavvadias, D.J. and Stavropoulos, E.C., An Efficient Algorithm for the Transversal Hypergraph Generation, J. Graph Algorithms Appl., 2005, vol. 9, no. 2, pp. 239–264.zbMATHMathSciNetGoogle Scholar
  190. 190.
    Kellerer, H., Pferschy, U., and Pisinger, D., Knapsack Problems, Berlin: Springer-Verlag, 2004.zbMATHGoogle Scholar
  191. 191.
    Kemp, C. and Tenenbaum, J.B., The Discovery of Structural Form, PNAS, 2008, vol. 105, no. 31, pp. 10687–10692.CrossRefGoogle Scholar
  192. 192.
    Khachiyan, L., Boros, E., Elbassioni, K., and Gurvich, V., An Efficient Implementation of a Quasipolynomial Algorithm for Generating Hypergraph Transversals and Its Application in Joint Generation, Discr. Appl. Math., 2006, vol. 154, no. 16, pp. 2350–2372.zbMATHMathSciNetCrossRefGoogle Scholar
  193. 193.
    Khadke, K. and Gershenson, J.K., Technology Change Analysis for Product and Product Platform Design, 2007 Proc. ASME Int. Design Eng. Technical Conf. Comput. Inform. Eng. Conf. DETC2007, 2008, vol. 3, part A, pp. 461–470.Google Scholar
  194. 194.
    Khuller, S. and Zhu, A., The General Steiner Star Problem, Inf. Proc. Lett., 2002, vol. 84, no. 4, pp.215–220.zbMATHMathSciNetCrossRefGoogle Scholar
  195. 195.
    Kirkwood, C.W., Slaven, M.P., and Maltz, A., Reconfiguring Supply-chain Decision Making at IBM, Interfaces, 2005, vol. 35, no.6, pp. 460–473.CrossRefGoogle Scholar
  196. 196.
    Klein, P. and Ravi, R., A Nearly Best-possible Approximation Algorithm for Node-weighted Steiner Trees, J. Algorithms, 1995, vol. 19, no. 1, pp. 104–115.zbMATHMathSciNetCrossRefGoogle Scholar
  197. 197.
    Knowles, J.D. and Corne, D.W., Enumeration of Pareto Optimal Multi-criteria Spanning Trees — a Proof of the Incorrectness of Zhou and Gen’s Proposed Algorithm, EJOR, 2002, vol. 143, no. 3, pp. 543–547.zbMATHCrossRefGoogle Scholar
  198. 198.
    Knuth, D. and Ratghunathan, A., The Problem of Compatible Representatives, SIAM J. Discr. Math., 1992, vol. 5, no. 3, pp. 422–427.zbMATHCrossRefGoogle Scholar
  199. 199.
    Koch, T. and Martin, A., Solving Steiner Tree Problems in Graphs to Optimality, Networks, 1998, vol. 32, no. 3, pp. 207–232.zbMATHMathSciNetCrossRefGoogle Scholar
  200. 200.
    Koch, T., Martin, A., and Voss, S., SteinLib: An Updated Library on Steiner Problems in Graphs, ZIB-Report 00-37, 2000,
  201. 201.
    Konemann J., Leonardi, S., and Schafer, G., A Group-strategy Proof Mechanism for Steiner Forest. Proc. 16th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA), 2005, pp. 612–619.Google Scholar
  202. 202.
    Kou, L., Markowsky, G., and Berman, L., A Fast Algorithm for Steiner Trees, Acta Informatica, 1981, vol. 15, no. 2, pp. 141–145.zbMATHMathSciNetCrossRefGoogle Scholar
  203. 203.
    Kouvelis, P. and Yu, G., Robust Descrete Optimization and Its Applications, Dordrecht: Kluwer, 1997.Google Scholar
  204. 204.
    Kramer, J. and Magee, J., Dynamic Configuration for Distributed Systems, IEEE Trans. Software Eng., 1985, vol. 11, no. 4, pp. 424–436.CrossRefGoogle Scholar
  205. 205.
    Krikhaar, R. and Crnkovic, I., Software Configuration Management. Sci. Comp. Progr., 2007, vol. 65, no. 3, pp. 215–221.MathSciNetCrossRefGoogle Scholar
  206. 206.
    Krishnan, R., PDM: A knowledge-based Tool for Model Construction, DSS, 1991, vol. 7, no. 4, pp. 301–314.Google Scholar
  207. 207.
    Textbook of Drug Design and Discovery, Kroqsqaard, P., Liljefors, T., and Madsen, U., Eds., Boca Raton: CRC Press, 2002.Google Scholar
  208. 208.
    Kuhn, H.W., The Hungarian Method for the Assignment Problems, Nav. Res. Log., 1955, vol. 2, no. 1–2, pp. 83–97 (reprinted in Nav. Res. Log., 2005, vol. 52, no. 1, pp. 7–21).MathSciNetCrossRefGoogle Scholar
  209. 209.
    Kuntz, I.D., Structure-based Strategies for Drug Design and Discovery, Science, 1992, vol. 257, no. 5073, pp. 1078–1082.CrossRefGoogle Scholar
  210. 210.
    Lai, W.K. and Coghill, G.G., Channel Assignment through Evolutionary Optimization, IEEE Trans. Vehicular Technol., 1996, vol. 45, no. 1, pp. 91–96.CrossRefGoogle Scholar
  211. 211.
    Lange, S. and Middendorf, M., Multi Task Hyperreconfigurable Architectures: Models and Reconfiguration Problems, Int. J. Embedded Systems, 2005, vol. 1, nos. 3–4, pp. 154–164.CrossRefGoogle Scholar
  212. 212.
    Larichev, O.I. and Sternin, M., Man-computer Approaches to the Multicriteria Assignment Problem, Autom. Remote Control, 1998, vol. 59, no. 7, pp. 135–155.MathSciNetGoogle Scholar
  213. 213.
    Levin, M.Sh., Algorithms for Fusion of Information in Control System, Radio-Electronics, Ser. “Radio-Electronic Engineering,” 1973, no. 1, pp. 95–101Google Scholar
  214. 214.
    Levin, M.Sh., An Extremal Problem of Organization of Data, Eng. Cyb., 1981, vol. 19, no. 5, pp. 87–95.zbMATHGoogle Scholar
  215. 215.
    Levin, M.Sh., Primenenie modelei kombinatornoi optimizazii v avtomatizirovannyh systemah (Application of Combinatorial Optimization Models in Automated Systems), Moscow: VNIITEMR, 1986.Google Scholar
  216. 216.
    Levin, M.Sh., A Hierarchical Hypertext System, Aut. Doc. Math. Ling., 1989, vol. 23, no. 3, pp. 52–59.Google Scholar
  217. 217.
    Levin, M.Sh., Hierarchical Design of User Interfaces, in Selected Papers 4th Int. Conf. on Human-Computer Interaction EWHCI’94, Blumenthal, B., Gornostaev, J., and Unger, C., Eds., Berkin: Springer-Verlag, 1994, pp. 140–151.Google Scholar
  218. 218.
    Levin, M.Sh., Combinatorial Design in Hypertext, 5th Int. Conf on Inform. Syst. Development, Gdansk, 1996, pp. 255–263.Google Scholar
  219. 219.
    Levin, M.Sh., Combinatorial Engineering of Decomposable Systems, Dordrecht: Kluwer, 1998.zbMATHGoogle Scholar
  220. 220.
    Levin, M.Sh., Towards Combinatorial Analysis, Adaptation, and Planning of Human-computer Systems, Appl. Intell., 2002, vol. 16, no. 3, pp. 235–247.zbMATHCrossRefGoogle Scholar
  221. 221.
    Levin, M.Sh., Modular System Synthesis: Example for Composite Packaged Software, IEEE Trans. SMC, Part C, 2005, vol. 35, no. 4, pp. 544–553.CrossRefGoogle Scholar
  222. 222.
    Levin, M.Sh., Composite Systems Decisions, New York: Springer-Verlag, 2006.Google Scholar
  223. 223.
    Levin, M.Sh., Course “System Design: Structural Approach,” 18th Int. Conf. Design Meth. and Theory DTM2006, DETC2006-99547, 2006.Google Scholar
  224. 224.
    Levin, M.Sh., Combinatorial Technological Systems Models (Examples for Communication System), 2nd Int. Conf. on Syst. Eng. and Modeling, Haifa, 2007, pp. 24–32.Google Scholar
  225. 225.
    Levin, M.Sh., Towards Hierarchical Clustering, in CSR 2007, Diekert, V., Volkov, M., and Voronkov, A., Eds., Berlin: Springer-Verlag, 2007, pp. 205–215.Google Scholar
  226. 226.
    Levin, M.Sh., Towards Teaching of System Design, Inform. Technol. Comput. Syst., 2007, no. 2, pp. 89–94.Google Scholar
  227. 227.
    Levin, M.Sh., Towards System Configuration Design, Int. Conf. on Complex Systems ICCS 2007, InterJournal Complex Systems, 2007, Paper 2162.Google Scholar
  228. 228.
    Levin, M.Sh., Morphological Approach to Electronic Shopping, IEEE Region 8 Int. Conf. Sibircon-2008, Novosibirsk, 2008, pp. 280–285.Google Scholar
  229. 229.
    Levin, M.Sh., Selection of User’s Connection in Last Mile Problems, 2008.Google Scholar
  230. 230.
    Levin, M.Sh. and Mikhailov, A.A., Fragmenty tekhnologii stratifikazii mnozestva objektov (Fragments of Objects Set Stratification Technology), Moscow: Inst. Sist. Analiz., 1988.Google Scholar
  231. 231.
    Levin, M.Sh. and Nisnevich, M.L., Combinatorial Scheme for Management of Life Cycle: Example for Concrete Macrotechnology, J. Intell. Manuf., 2001, vol. 12, no. 4, pp. 393–401.CrossRefGoogle Scholar
  232. 232.
    Levin, M.Sh. and Elperin, T., Algorithm Scheme for Spatio-temporal Pattern Synthesis, Unpublished manusript, The Ben-Guriuon Univ., Israel, 2003.Google Scholar
  233. 233.
    Levin, M.Sh. and Sokolova, L.V., Hierarchical Combinatorial Planning of Medical Treatment, Computer Meth. Programs Biomedicine, 2004, vol. 73, no. 1, pp. 3–11.CrossRefGoogle Scholar
  234. 234.
    Levin, M.Sh. and Danieli, M.A., Hierarchical Morphological Decision Making Framework for Evaluation and Improvement of Composite Systems (Example for Building), Informatica, 2005, vol. 16, no. 2, pp. 213–240.zbMATHGoogle Scholar
  235. 235.
    Levin, M.Sh. and Firer, M., Hierarchical Morphological Design of Immunoassay Technology, Comput. Biol. Medicine, 2005, vol. 35, no. 3, pp. 229–245.CrossRefGoogle Scholar
  236. 236.
    Levin, M.Sh. and Last, M., Design of Test Inputs and Their Sequences in Multi-function System Testing, Appl. Intell., 2006, vol. 25, no. 1, pp. 105–124.CrossRefGoogle Scholar
  237. 237.
    Levin, M.Sh. and Safonov, A.V., Design and Redesign of Configuration for Facility in Communication Network, Inform. Technol. Comput. Syst., 2006, no 4, pp. 63–73.Google Scholar
  238. 238.
    Levin, M.Sh. and Vishnitskiy, R.O., Towards Morphological Design of GSM Network, Inform. Processes, 2007, vol. 7, no. 2, 182–189.Google Scholar
  239. 239.
    Levin, M.Sh. and Fimin, A.V., Hierarchical Design of Fire Alarm Wireless Sensor Element, Proc. 7th Int. Conf. CAD/CAM/PDM-2007, Moscow, 2007, pp. 33–35.Google Scholar
  240. 240.
    Levin, M.Sh. and Khodakovskii, I.A., Structural Design of the Telemetry System, Autom. Remote Control, 2007, vol. 68, no. 9, pp. 1654–1661.zbMATHCrossRefGoogle Scholar
  241. 241.
    Levin, M.Sh. and Leus, A.V., Modular Design of Integrated Security System, Proc. Int. Workshop “Distrib. Comput. and Commun. Networks” DCCN 2007, Moscow, 2007, vol. 2, pp. 16–22.Google Scholar
  242. 242.
    Levin, M.Sh. and Grigorov, R.D., Configuration of Applied Web-based Systems, 2008.Google Scholar
  243. 243.
    Levin, M.Sh. and Nuriahmetov, R.I., Towards Multicriteria Steiner Tree Problem, 2008.Google Scholar
  244. 244.
    Lewandowsky, G. and Condon, A., Experiments with Parallel Graph Coloring Heuristics and Applications of Graph Coloring, in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson, D.S. and Trick, M.A., Eds., Providence: AMS, 1996, pp. 309–334.Google Scholar
  245. 245.
    Li, L., Garibaldi, J. and Krasnogor, N., Automated Self-assembly Programming Paradigm: Initial Investigation, Proc. Third IEEE Int. Workshop on Eng. of Autonomic and Autonomous Syst. EASe2006, 2006, pp. 25–36.Google Scholar
  246. 246.
    Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., and Fischetti, M., An Algorithmic Framework for the Exact Solution of the Prize-collecting Steiner Tree Problem, Math. Progr., Ser. B, 2006, vol. 105, nos. 2–3, pp. 427–449.zbMATHMathSciNetCrossRefGoogle Scholar
  247. 247.
    Lubetsky, V.A. and Selivestrov, A.V., Multipartite Graphs with Two Vertices in Each Part, Inform. Processes, 2004, vol. 4, no. 2, pp. 127–132.Google Scholar
  248. 248.
    Lubetsky, V.A. and Selivestrov, A.V., Note on Cliques and Alignments, Inform. Processes, 2004, vol. 4, no. 3, pp. 241–246.Google Scholar
  249. 249.
    Lucet, C., Mendes, F., and Moukrim, A., An Exact Method for Graph Coloring, Comput. Oper. Res., 2006, vol. 33, no. 8, pp. 2189–2207.zbMATHMathSciNetCrossRefGoogle Scholar
  250. 250.
    Lukasik, S., Kokosinski, Z., and Swieton, G., Parallel Simulated Annealing Algorithm for Graph Coloring Problem, in 7th Int. Conf. on Parallel Processing and Appl. Math. PRAM 2007, Wyrzykowski, R., Dongarra, J., Karczewski, K., and Wasniewski, J., Eds., Berlin: Springer-Verlag, 2008, pp. 229–238.CrossRefGoogle Scholar
  251. 251.
    Lytkin, N., Streltsov, S., Perlovsky, L., Muchnik, I., and Petrov, S., Improving Representation of Search Results by Multipartite Graph Clustering of Multiple Reformulated Queries and a Novel Document Representation, Manuscript, 2005, Lytkin 110104.pdf.
  252. 252.
    Madhusudan, T. and Uttamsingh, N., A Declarative Approach to Composing Web Services in Dynamic Environments, DSS, 2006, vol. 41, no. 2, pp. 325–357.Google Scholar
  253. 253.
    Magnanti, T.L. and Wolsey, L.A., Optimal Trees, in Handbooks in OR & MS, Ball, M.O., et al., Eds., Amsterdam: North-Holland, 1995, vol. 7, pp. 503–615.Google Scholar
  254. 254.
    Mailharro, D., A Classification and Constraint-based Framework for Configuration, AI EDAM, 1998, vol. 12, no. 4, pp 383–397.Google Scholar
  255. 255.
    Malaguti, E. and Toth, P., An Evolutionary Approach for Bandwidth Multicoloring Problems, EJOR, 2008, vol. 189, no. 3, pp. 638–651.zbMATHMathSciNetCrossRefGoogle Scholar
  256. 256.
    Martello, S. and Toth, P., Knapsack Problem: Algorithms and Computer Implementation, New York: Wiley, 1990.Google Scholar
  257. 257.
    Martins, E.Q., On a Multicriteria Shortest Path Problem, EJOR, 1984, vol. 16, no. 2, pp. 236–245.zbMATHMathSciNetCrossRefGoogle Scholar
  258. 258.
    Matevska, J., An Optimized Runtime Reconfiguration on Components-based Software Systems, 32rd Annu. Int. IEEE Comput. Software and Appl. Conf. COMPSAC 2008, Turku, 2008, pp. 499–501.Google Scholar
  259. 259.
    McDermott, J., R1: A Rule-based Configurer of Computer Systems, Artif. Intell., 1982, vol. 19, no. 2, pp. 39–88.CrossRefGoogle Scholar
  260. 260.
    McKeenly, P.K., Sadjadi, S.M., Kasten, E.P., and Cheng, B.H.C., Composing Adaptive Software, IEEE Computer, 2004, vol. 37, no. 7, pp. 56–64.Google Scholar
  261. 261.
    Mehrabi, M.G., Ulsoy, A.G., and Koren, Y., Reconfigurable Manufacturing Systems, J. Intel. Manufact., 2000, vol. 11, no. 4, pp. 403–419.CrossRefGoogle Scholar
  262. 262.
    Mehrotra, A. and Trick, M.A., A Column Generation Approach for Graph Coloring, INFORMS J. Computing, 1996, vol. 8, no. 4, pp. 344–354.zbMATHCrossRefGoogle Scholar
  263. 263.
    Mikrin, E.A., Some Problems of Synthesis of Optimal Modular Systems of Real-time Data Handling in the ACS of the Alfa International Space Station, Autom. Remote Control, 2001, vol. 62, no. 1, pp. 160–165.zbMATHCrossRefGoogle Scholar
  264. 264.
    Mintzberg, H., The Structuring of Organizations: A Synthesis of the Research, Englewood Cliffs: Prentice Hall, 1979.Google Scholar
  265. 265.
    Mathematical Hierarchies and Biology, Mirkin, B., McMorris, F.R., Robets, F.S., and Rzhetsky, A., Eds., Providence: AMS, 1996.Google Scholar
  266. 266.
    Mirkin, B. and Muchnik, I., Layered Clusters of Tightness Set Functions, Appl. Math. Lett., vol. 15, no. 2, pp. 147–151.Google Scholar
  267. 267.
    Mishin, S., Optimal Organizational Hierarchies in Firms, J. Business Econ. Manag., 2007, vol. 8, no. 2, 79–99.Google Scholar
  268. 268.
    Mishra, N., Ron, D., and Swaminathan, R., A New Conceptual Clustering Framework, Machine Learning, 2004, vol. 56, nos. 1–3, pp. 115–151.zbMATHCrossRefGoogle Scholar
  269. 269.
    Mittal, S. and Frayman, F., Towards a Generic Model of Configuration Tasks, Proc. 11th Joint Conf. on Artif. Intell., 1989, pp. 1395–1401.Google Scholar
  270. 270.
    Mittal, S. and Falkenhainer, B., Dynamic Constraint Satisfaction Problem, Proc. 8th Nat. Conf. on Artif. Intell., 1990, pp. 25–32.Google Scholar
  271. 271.
    Montemanni, R. and Gambardella, L., An Exact Algorithm for the Robust Shortest Path Problem with Interval Data, Comput. Oper. Res., 2004, vol. 31, no. 10, pp. 1667–1680.zbMATHMathSciNetCrossRefGoogle Scholar
  272. 272.
    Montemanni, R. and Gambardella, L., A Branch and Bound Algorithm for the Robust Spanning Tree Problem with Interval Data, EJOR, 2005, vol. 161, no. 3, pp. 771–779.zbMATHMathSciNetCrossRefGoogle Scholar
  273. 273.
    Moradkhan, M.D. and Browne, W.N., A Knowledge-based Evolution Strategy for the Multi-objective Minimum Spanning Tree Problem, 2006 IEEE Congress on Evolutionary Computation CEC’2006, 2006, article no. 1688471, pp. 1391–1398.Google Scholar
  274. 274.
    Moran, S. and Snir, S., Efficient Approximation of Convex Recoloring, J. Comput. System Sci., 2007, vol. 73, no. 7, pp. 1078–1089.zbMATHMathSciNetCrossRefGoogle Scholar
  275. 275.
    Moran, S. and Snir, S., Convex Recoloring of Strings and Trees: Definitions, Hardness Results and Algorithms, J. Comput. System Sci., 2008, vol. 74, no. 5, pp. 850–869.zbMATHMathSciNetCrossRefGoogle Scholar
  276. 276.
    Morefield, C.L., Application of 0-1 Integer Programming to Multitarget Tracking Problems, IEEE Trans. Automat. Control, 1977, vol. 22, no. 3, pp. 302–312.zbMATHMathSciNetCrossRefGoogle Scholar
  277. 277.
    Muhanna, W.A., An Object-oriented Framework for Model Management and DSS Development, DSS, 1993, vol. 9, no. 2, pp. 217–229.Google Scholar
  278. 278.
    Muhanna, W.A. and Pick, R.A., Meta-modeling Concepts and Tools for Model Management: A Systems Approach, Manag. Sci., 1994, vol. 40, no. 9, pp. 1093–1123.CrossRefGoogle Scholar
  279. 279.
    Mullat, J.E., Extremal Subsystems of Monotone Systems: I and II, Autom. Remote Control, 1976, vol. 37, no. 5, pp. 758–766; no. 8, pp. 1286–1294.zbMATHMathSciNetGoogle Scholar
  280. 280.
    Muller-Lankenau, C., Wehmeyer, K., and Klein, S., Strategic Channel Alignment: an Analysis of the Configuration of Physical and Virtual Marketing Channels, Inform. Syst. E-Business Manag., 2006, vol. 4, no. 2, pp. 187–216.CrossRefGoogle Scholar
  281. 281.
    Murat, C. and Pachos, V.Th., On the Probabilistic Minimum Coloring and Minimum k-coloring, Discr. Appl. Math., 2006, vol. 154, no. 3, pp. 564–586.zbMATHCrossRefGoogle Scholar
  282. 282.
    Murata, S., Yoshida, E., Kurikawa, H., Tomita, K., and Kokaji, S., Concept of Self-reconfigurable Modular Robotic System, Artif. Intell. Eng., 2001, vol. 15, no. 4, pp. 383–387.CrossRefGoogle Scholar
  283. 283.
    Nemhauser, G.L. and Trick, M.A., Scheduling a Major College Basketball Conference, Oper. Res., 1998, vol. 46, no. 1, pp. 1–8.CrossRefGoogle Scholar
  284. 284.
    Novak, R., Rugelj, J., and Kundus, C., Steiner Tree Based Distributed Multicast Routing in Networks, in Steiner Trees in Industries, Dordrecht: Kluwer, 2001, pp. 327–352.Google Scholar
  285. 285.
    Oliveira, C.A.S. and Pardalos, P.M., A Survey of Combinatorial Optimization Problems in Multicast Routing, Comput. Oper. Res., 2005, vol. 32, no. 8, pp. 1953–1981.zbMATHCrossRefGoogle Scholar
  286. 286.
    Oncan, T., A Survey on the Generalized Assignment Problem, INFOR, 2007, vol. 45, no. 3, pp. 123–141.MathSciNetGoogle Scholar
  287. 287.
    Pachos, V.Th., A Survey of Approximately Optimal Solutions to Some Covering and Packing Problems, ACM Computing Surv., 1999, vol. 29, no. 2, pp. 171–209.MathSciNetCrossRefGoogle Scholar
  288. 288.
    Pachos, V.Th., Polynomial Approximation and Graph-coloring, Computing, 2003, vol. 70, no. 1, pp. 41–86.MathSciNetCrossRefGoogle Scholar
  289. 289.
    Pardalos, P.M., Wolkowicz, H., Eds., Quadratic Assignment and Related Problems, Providence: AMS, 1994.zbMATHGoogle Scholar
  290. 290.
    Handbooks of Telecommunications, Pardalos, P.M. and Resende, M.G.C., Eds., New York: Springer-Verlag, 2006.Google Scholar
  291. 291.
    Paredis, C.J.J., Diaz-Calderon, A., Sinha, R., and Khosla, P.K., Composable Models for Simulationbased Design, Eng. Comput., 2001, vol. 17, no. 2, pp. 112–128.zbMATHCrossRefGoogle Scholar
  292. 292.
    Pavlov, V.V., Strukturnoe modelirovanie v CALS-tekhnologiaykh (Structural Modeling in CALS-Technologies), Moscow: Nauka, 2006.Google Scholar
  293. 293.
    Pei, J., Jiang, D., and Zhang, A., On Mining Cross-graph Quasi-cliques, Proc. 11th ACM SIGKDD Int. Conf. on Knowledge Discovery in Data Mining, 2005, pp. 228–238.Google Scholar
  294. 294.
    Pemmaraju, S. and Skiena, S., Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica, New York: Cambridge Univ. Press, 2003.zbMATHGoogle Scholar
  295. 295.
    Pettie, S. and Ramachandran, V., An Optimal Minimum Spanning Tree Algorithm, J. ACM, 2002, vol. 49, no. 1, pp. 16–34.MathSciNetCrossRefGoogle Scholar
  296. 296.
    Pettie, S. and Ramachandran, V., A Randomized Time-work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest, SIAM J. Comput., 2002, vol. 31, no. 6, pp. 1876–1895.MathSciNetCrossRefGoogle Scholar
  297. 297.
    Petzold, L.R., Automatic Selection of Methods for Solving Stiff and Nonstiff Systems of Ordinary Differential Equations, SIAM J. Sci. Comput., 1983, vol. 4, no. 1, pp. 136–148.zbMATHMathSciNetCrossRefGoogle Scholar
  298. 298.
    Poladian, V., Sousa, J.P., Garlan, D., Schmerl, B., and Shaw, M., Task-based Adaptation for Ubiquitous Computing, IEEE Trans. SMC, Part C, 2006, vol. 36, no. 3, pp. 328–340.Google Scholar
  299. 299.
    Poore, A.B., Multidimensional Assignment Formulation of Data Association Problems Arising from Multitarget and Multisensor Tracking, Comput. Optimiz. Appl., 1994, vol. 3, no. 1, pp. 27–57.zbMATHMathSciNetCrossRefGoogle Scholar
  300. 300.
    Poore, A.B. and Rijavec, N., A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking, SIAM J. Optimiz., 1993, vol. 3, no. 3, pp. 544–563.zbMATHMathSciNetCrossRefGoogle Scholar
  301. 301.
    Prokopska, A., Application of Morphological Analysis Methodology in Architectural Design, Acta Polytechnica, 2001, vol. 41, no. 1, pp. 46–54.Google Scholar
  302. 302.
    Pulvermuller, E., Goos, G., and Assmann, U., Preface: New Software Composition Concepts, Sci. Comput. Programming, 2005, vol. 56, nos. 1–2, pp. 1–4.MathSciNetCrossRefGoogle Scholar
  303. 303.
    Rakhmankulov, V.Z., Akhrem, A.A., and Gerasimov, V.V., Algorithm for Recognition of Volume Patterns on the Basis of Modified Method of Maximal Clique, in Manag. Inform. Flows, Moscow: Inst. Sist. Analis., 2002, pp. 295–305.Google Scholar
  304. 304.
    Rakov, D.L., Morphological Synthesis Method of the Search for Promising Technical Systems, IEEE Aerospace Elect. Syst. Magazine, 1996, vol. 11, no. 12, pp. 3–8.CrossRefGoogle Scholar
  305. 305.
    Ramanathan, S., Multicast Tree Generation in Networks with Asymmetric Links, IEEE/ACM Trans. Networking, 1996, vol. 4, no. 4, pp. 558–568.MathSciNetCrossRefGoogle Scholar
  306. 306.
    Ramanathan, S., A Unified Framework and Algorithm for Channel Assignment in Wireless Networks, Wireless Networks, 1999, vol. 5, no. 2, pp. 81–94.CrossRefGoogle Scholar
  307. 307.
    Ramanathan, S. and Lloyd, E.L., Scheduling Algorithms for Multi-hop Radio Networks, IEEE/ACM Trans. Networking, 1993, vol. 1, no. 2, pp. 166–177.CrossRefGoogle Scholar
  308. 308.
    Ritchey, T., Problem Structuring Using Computer-aided Morphological Analysis, J. ORS, 2006, vol. 57, no. 7, pp. 792–801.zbMATHGoogle Scholar
  309. 309.
    Robbes, R., Lanza, M., and Lungu, M., An Approach to Software Evolution Based on Semantic Change, in Proc. of 10th Int. Conf. on Fundamental Approaches to Software Engineering FASE 2007, Dwyer, M.B. and Lopes, A., Eds., Berlin: Springer-Verlag, 2007, pp. 27–41.CrossRefGoogle Scholar
  310. 310.
    Rodriguez, M.A. and Jarur, M.C., A Genetic Algorithm for Searching Spatial Configurations, IEEE Trans. Evolut. Comput., 2005, vol. 9, no. 3, pp. 252–270.CrossRefGoogle Scholar
  311. 311.
    Rosenwein, M.B. and Wong, R.T., Constrained Steiner Tree Problem, EJOR, 1995, vol. 81, no. 2, pp. 430–439.zbMATHCrossRefGoogle Scholar
  312. 312.
    Ross, A., Venkataramanan, M.A., and Ernstberger, K.W., Reconfiguring the Supply Network Using Current Performance Data, Decision Sciences, 1998, vol. 29, no. 3, pp. 707–724.CrossRefGoogle Scholar
  313. 313.
    Rubinstein, M.I., Optimal Grouping of Interconnected Objects, Moscow: Nauka, 1989.Google Scholar
  314. 314.
    Sabin, D. and Freuder, E.C., Configuration as Composite Constraint Satisfaction, in Workshop Notes of AAAI Fall Symp. on Configuration, Interrante, L.D. and Luger, G.F., Eds., USA, 1996, pp. 26–36.Google Scholar
  315. 315.
    Sabin, D. and Weigel, R., Product Configuration Frameworks-A Survey, IEEE Intell. Syst. Their Appl., 1998, vol. 13, no. 4, pp. 42–49.CrossRefGoogle Scholar
  316. 316.
    Sager, T.J. and Lin, S.-J., Pruning Procedure for Exact Graph Coloring, ORSA J. Computing, 1991, vol. 3, no. 3, pp. 226–230.zbMATHGoogle Scholar
  317. 317.
    Sakashita, M., Makino, K., Nagamochi, H., and Fujishige, S., Minimum Transversals in Posi-modular Systems, in Proc. 14th Annu. Eur. Symp. on Algorithms, ESA 2006, Azar, Y. and Erlebach, T., Eds., Berlin: Springer-Verlag, 2006, pp. 576–587.CrossRefGoogle Scholar
  318. 318.
    Santos, M., Drummond, L.M.A., and Uchoa, E., A Distributed Primal-dual Heuristic for Steiner Problems in Networks, in Proc. of 6th Int. Workshop on Exp. Algorithms WEA 2007, Demetrescu, C., Ed., Berlin: Springer-Verlag, 2007, pp. 175–188.Google Scholar
  319. 319.
    Scarelli A., and Narula, S.C., A Multicriteria Assignment Problem, J. Multi-Criteria Dec. Anal., 2002, vol. 11, no. 2, pp. 65–74.zbMATHCrossRefGoogle Scholar
  320. 320.
    Schaerf, A., A Survey of Automated Timetabling, Artif. Intell. Review, 1999, vol. 13, no. 2, pp. 87–127.CrossRefGoogle Scholar
  321. 321.
    Schierholt, K., Process Configuration: Combining the Principles of Product Configuration and Process Planning, AI EDAM, 2001, vol. 15, no. 5, pp. 411–424.zbMATHGoogle Scholar
  322. 322.
    Schmidt, L.C. and Cagan, J., GGREADA: A Graph Grammar-based Machine Design Algorithm, Res. Eng. Des., 1997, vol. 9, no. 4, pp. 195–213.CrossRefGoogle Scholar
  323. 323.
    Schmidt, L.C. and Cagan, J., Optimal Configuration Design: An Integrated Approach Using Grammars, J. Mech. Des., 1998, vol. 120, no. 1, pp. 2–9.CrossRefGoogle Scholar
  324. 324.
    Schmidt, L.C., Shetty, H., and Chase, S.C., A Graph Grammar Approach for Structure Synthesis of Mechanisms, J. Mech. Des., 2000, vol. 122, no. 4, pp. 371–376.CrossRefGoogle Scholar
  325. 325.
    Segev, A., The Node-weighted Steiner Tree Problem, Networks, 1987, vol. 17, no. 1, pp. 1–17.zbMATHMathSciNetCrossRefGoogle Scholar
  326. 326.
    Selivestrov, A.V. and Lubetsky, V.A., Search for Concervative Parts of Nucleotide Sequences, Inform. Processes, 2006, vol. 6, no. 1, pp. 33–36.Google Scholar
  327. 327.
    Sereni, J.-S., Randomly Colouring Graphs (a Combinatorial View), Comput. Sci. Review, 2008, vol. 2, no. 2, pp. 63–95.CrossRefGoogle Scholar
  328. 328.
    Sewell, E.C., An Improved Algorithm for Exact Graph Coloring, in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Johnson, D.S. and Trick, M.A., Eds., Providence: AMS, 1996, pp. 259–373.Google Scholar
  329. 329.
    Show, M.J., Tu, P.-L., and De, P., Applying Machine Learning to Model Management in Decision Support Systems, DSS, 1988, vol. 4, no. 3, pp. 285–305.Google Scholar
  330. 330.
    Siddique, Z. and Rosen, D.W., On Combinatorial Design Spaces for the Configuration Design of Product Families, AI EDAM, 2001, vol. 15, no. 2, pp. 91–108.zbMATHGoogle Scholar
  331. 331.
    Simon, H.A., The Science of the Artificial, Boston: MIT Press, 1996.Google Scholar
  332. 332.
    Smirnov, A., Sheremetov, L., Chilov, N., and Cortes, J.R., Soft-computing Technologies for Configuration of Cooperative Supply Chain, Appl. Soft Comput., 2004, vol. 4, no. 1, pp. 87–107.CrossRefGoogle Scholar
  333. 333.
    Smith, D.H., Allen, S.M., and Hurley, S., Characteristics of Good Meta-heuristics Algorithms for the Frequency Assignment Problem, Ann. Oper. Res., 2001, vol. 107, nos. 1–4, pp. 285–301.zbMATHMathSciNetCrossRefGoogle Scholar
  334. 334.
    Skorin-Kapov, J., Tabu Search Applied to the Quadratic Assignment Problem, ORSA J. Comput., 1990, vol. 2, no. 1, pp. 33–45.zbMATHGoogle Scholar
  335. 335.
    Stefik, M., Introduction to Knowledge Systems, San Francisco: Morgan Kaufmann, 1995.Google Scholar
  336. 336.
    Stumptner, M., Frierdich, G.E., and Haselbock, A., Generative Constraint-based Configuration of Large Technical Systems, AI EDAM, 1998, vol. 12, no. 4, pp 307–320.Google Scholar
  337. 337.
    Stupnikov, S., Kalinichenko, L., and Bressan, S., Interactive Discovery and Composition of Complex Web Services, in Proc. of 10th East-West Eur. Conf. on Advances in Databases and Inform. Syst. ADBIS 2006, Manolopoulos, Y., Pokorny, J., and Sellis, T., Eds., Berlin: Springer-Verlag, 2006, pp. 216–231.Google Scholar
  338. 338.
    Sugumaran, V., Tanniru, M., and Storney, V.C., A Knowledge-based Framework for Extracting Components in Agile Systems Development, Information Technol. Manag., 2008, vol. 9, no. 1, pp. 37–53.CrossRefGoogle Scholar
  339. 339.
    Tarapata, Z., On a Multicriteria Shortest Path Problem, Int. J. Appl. Math. Comput. Sci., 2007, vol. 17, no. 2, pp. 269–287.zbMATHMathSciNetCrossRefGoogle Scholar
  340. 340.
    Tate, D.M. and Smith, A.E., A Genetic Approach to the Quadratic Assignment Problem, Comput. Oper. Res., 1990, vol. 22, no. 1, pp. 73–83.CrossRefGoogle Scholar
  341. 341.
    Thomsen, E., OLAP Solutions: Building Multidimensional Information Systems, New York: Wiley, 2002.Google Scholar
  342. 342.
    Ten, T.A., Van Harmelen, F., Schreiber, A.Th., and Wielinga, B., Construction of Problem-solving Methods as Parametric Design, Int. J. Human Computer Studies, 1998, vol. 49, no. 4, pp. 363–389.CrossRefGoogle Scholar
  343. 343.
    Ten, T.A., Van Harmelen, F., and Wielinga, B., Configuration of Web Services as Parametric Design, in Proc. of the First Semantic Web Symposium: Research and Applications ESWS 2004, Davies, J., Fensel, D., Bussler, C., and Studer, R., Eds., Berlin: Springer-Verlag, 2004, pp. 299–311.Google Scholar
  344. 344.
    Uchoa, E., Reduction Tests for the Prize-collecting Steiner Problem, Oper. Res. Lett., 2006, vol. 34, no. 4, pp. 437–444.zbMATHMathSciNetCrossRefGoogle Scholar
  345. 345.
    Van Den Heuvel, J., Leese, R.A., and Shepherd, M.A., Graph Labeling and Radio Channel Assignment, J. Graph Theory, 1998, vol. 29, no. 4, pp. 263–283.zbMATHMathSciNetCrossRefGoogle Scholar
  346. 346.
    Vashist, A., Kulikowsky, C., and Muchnik, I, Automatic Screening for Groups of Orthologous Genes in Comparative Genomics Using Multipartite Clustering, TR 33, DIMACS, 2004.Google Scholar
  347. 347.
    Vashist, A., Kulikowski, C.A., and Muchnik, I., On Bipartite and Multipartite Clique Problems, IEEE/ACM Trans. Comput. Biology Bioinformatics (TCBB), 2007, vol. 4, no. 1, pp. 17–27.CrossRefGoogle Scholar
  348. 348.
    Vincke, P., Problemes multicriteres, in Cachiers du Centre d’Etudes de Recherche Operationelle, 1974, vol. 16, pp. 425–439.zbMATHMathSciNetGoogle Scholar
  349. 349.
    Vincke, P., Robust Solutions and Methods in Decision-aid, J. Multicriteria Decision Analysis, 1999, vol. 8, no. 3, pp. 181–187.zbMATHMathSciNetCrossRefGoogle Scholar
  350. 350.
    Vinh, P.C. and Bowen, J.P., Continuity Aspects of Embedded Reconfigurable Computing, Innovations Syst. Software Eng., 2005, vol. 1, no. 1, pp. 41–53.CrossRefGoogle Scholar
  351. 351.
    Voronin, A.A. and Mishin, S.P., Algorithms to Seek the Optimal Structure of the Organizational System, Autom. Remote Control, 2002, vol. 63, no. 5, pp. 803–814.zbMATHMathSciNetCrossRefGoogle Scholar
  352. 352.
    Voss, S., Steiner’s Problem in Graphs: Heuristic Methods, Discr. Appl. Math., 1992, vol. 40, no. 1, pp. 45–72.zbMATHMathSciNetCrossRefGoogle Scholar
  353. 353.
    Voss, S., The Steiner Tree Problem with Hop Constraints, Ann. Oper. Res., 1999, vol. 86, pp. 321–345.zbMATHMathSciNetCrossRefGoogle Scholar
  354. 354.
    Voss, S., Modern Heuristic Search Methods for the Steiner Tree Problem in Graph, in Advances in Steiner Trees, Du, D.-Z., Smith, J.M., and Rubinstein, J.H., Eds., Boston: Kluwer, 2000, pp. 283–323.Google Scholar
  355. 355.
    Voss, S., Steiner Tree Problems in Telecommunication, in Handbook in Telecommunications, Resende, M. and Pardalos, P.M., Eds., New York: Springer-Verlag, 2006, pp. 459–492.CrossRefGoogle Scholar
  356. 356.
    Vujosevic, M. and Stanojevic, M., A Bicriteria Steiner Tree Problem on Graph, Yugoslav J. Oper. Res., 2003, vol. 13, no. 1, pp. 25–33.zbMATHCrossRefGoogle Scholar
  357. 357.
    Wallace, M. and Schimpf, J., Finding the Right Hybrid Algorithm-A Combinatorial Meta-problem, Ann. Math. Artif. Intell., 2002, vol. 34, no. 4, pp. 259–269.zbMATHMathSciNetCrossRefGoogle Scholar
  358. 358.
    West, D.B., Introduction to Graph Theory, Englewood Cliffs: Prentice Hall, 2001.Google Scholar
  359. 359.
    Westbrook, J. and Yan, D.C.K., Greedy Algorithm for the On-line Steiner Tree and Generalized Steiner Problems, in Proc. of the Third Workshop on Algorithms and Data Structures WADS’93, Dehne, F.K.H.A., Sack, J.-R., Santoro, N., and Whitesides, S., Eds., Berlin: Springer-Verlag, 1993, pp. 622–633.Google Scholar
  360. 360.
    Wielinga, B. and Schreiber, G., Configuration-design Problem Solving, IEEE Expert: Intelligent Systems and Their Applications, 1997, vol. 12, no. 2, pp. 49–56.Google Scholar
  361. 361.
    Wigderson, A., Improving the Performance Garantee for Approximate Graph Coloring, J. ACM, 1983, vol. 30, no. 4, pp. 729–735.zbMATHMathSciNetCrossRefGoogle Scholar
  362. 362.
    Combinatorial Chemistry: Synthesis and Application, Wilson, S.R. and Czarnik, A.W., Eds., New York: Wiley, 1997.Google Scholar
  363. 363.
    Winter, P., Steiner Problem in Networks: A Survey, Networks, 1987, vol. 17, no. 2, pp. 129–167.zbMATHMathSciNetCrossRefGoogle Scholar
  364. 364.
    Wissema, J.G., Morphological Analysis: Its Application to a Company TF-investigation, Future, 1976, vol. 8, no. 2, pp. 146–153.CrossRefGoogle Scholar
  365. 365.
    Wong, R.T., Dual Ascent Approach for Steiner Tree Problems on a Directed Graph, Math. Progr., 1984, vol. 28, no. 3, pp. 271–287.zbMATHCrossRefGoogle Scholar
  366. 366.
    Wrembel, R. and Koncila, C., Data Warehouses and Olap: Concepts, Architectures and Solutions, Hershey: IGI Global, 2006.Google Scholar
  367. 367.
    Wu, B.Y. and Chao, K.-M., Spanning Trees and Optimization Problems, Boca Raton: CRC Press, 2004.zbMATHGoogle Scholar
  368. 368.
    Wu, J., Huang, L., and Wang, D., ASM-based Model of Dynamic Service Update in OSGi, ACM SIGSOFT Software Engineering Notes, 2008, vol. 33, no. 2, article no. 8.Google Scholar
  369. 369.
    Wynants, G., Network Synthesis Problems, Dordrecht: Kluwer, 2001.Google Scholar
  370. 370.
    Xiang, X.-D., Sun, X., Briceno, G., Lou, Y., Wang, K.-A., Chang, H., Wallace-Freedman, W.G., Chen, S.-W., and Schultz, P.G., A Combinatorial Approach to Material Discovery, Science, 1995, vol. 268, no. 5218, pp. 1738–1740.CrossRefGoogle Scholar
  371. 371.
    Xiang, X.-D., Takeuchi, I., Combinatorial Material Synthesis, Boca Raton: CRC Press, 2003.Google Scholar
  372. 372.
    Xin, D., Han, J., Yan, X., and Cheng, H., Compressing Frequent Patterns, Data Knowledge Eng., 2007, vol. 60, no. 1, pp. 5–29.MathSciNetCrossRefGoogle Scholar
  373. 373.
    Yaman, H., Karasan, O.E., and Pinar, M.C., The Robust Spanning Tree Problem with Interval Data, Oper. Res. Letters, 2001, vol. 29, no. 1, pp. 31–40.zbMATHMathSciNetCrossRefGoogle Scholar
  374. 374.
    Yao, A.C., An O(|E| log log |V|) Algorithm for Finding Minimum Spanning Trees, Inform. Processing Lett., 1975, vol. 4, no. 1, pp. 21–23.zbMATHCrossRefGoogle Scholar
  375. 375.
    Yeh, R.K., The Edge Soan of Distance Two Labellings of Graphs, Taiwanese J. Math., 2000, vol. 4, no. 4, pp. 675–683.zbMATHMathSciNetGoogle Scholar
  376. 376.
    Yeh, R.K., A Survey on Labeling Graphs with a Condition at Distance Two, Discr. Math., 2006, vol. 306, no. 12, pp. 1217–1231.zbMATHCrossRefGoogle Scholar
  377. 377.
    Yigit, A.S., Ulsoy, A.G., and Allahverdi, A., Optimizing Modular Product Design for Reconfigurable Manufacturing, J. Intell. Manuf., 2002, vol. 13, no. 2, pp. 309–316.CrossRefGoogle Scholar
  378. 378.
    Yu, T. and Lin, K.-J., Service Selection Algorithms for Web Services Selection with End-to-end QoS Constraints, J. Inf. Syst. e-Business Manag., 2005, vol. 3, no. 2, pp. 103–126.MathSciNetCrossRefGoogle Scholar
  379. 379.
    Yu, T., Zhang, Y., and Lin, K.-J., Efficient Algorithms for Web Services Selection with End-to-end QoS Constraints, ACM Trans. Web, 2007, vol. 1, no. 1, art. no. 6.Google Scholar
  380. 380.
    Yuditskii, S.A., Operational-objective Modeling of Dynamics of Organizational Systems Development via Petri Nets, Autom. Remote Control, 2008, vol. 69, no. 1, pp. 105–113.zbMATHMathSciNetGoogle Scholar
  381. 381.
    Zelikovsky, A.Z., An 11/6-approximation Algorithm for the Network Steiner Problem, Algorithmica, 1993, vol. 9, no. 5, pp. 463–470.zbMATHMathSciNetCrossRefGoogle Scholar
  382. 382.
    Zelikovsky, A.Z., A Series of Approximation Algorithms for the Acyclic Directed Steiner Tree Problem, Algorithmica, 1998, vol. 18, no. 1, pp. 99–110.MathSciNetCrossRefGoogle Scholar
  383. 383.
    Zhang, R., Vashist, A., Muchnik, I.B, Kulikovski, C.A, and Metaxas, D.N., A New Combinatorial Approach to Supervised Learning: Application to Gait Recognition, in Proc. of the Second Int. Workshop on Analysis and Modeling of Faces and Gestures AMFG 2005, Zhao, W., Gong, S., and Tang, X., Eds., Berlin: Springer-Verlag, 2005, pp. 55–69.Google Scholar
  384. 384.
    Zhuravlev, Yu.I., An Algebraic Approach to Recognition or Classification Problems, Pattern Recogn. Image Anal., 1998, vol. 8, no. 1, pp. 59–100.Google Scholar
  385. 385.
    Zilberstein, S. and Russell, S., Optimal Composition of Real-time Systems, Artif. Intell., 1996, vol. 82, no. 1–2, pp. 181–213.MathSciNetCrossRefGoogle Scholar
  386. 386.
    Zou, F., Li, X., Kim, D., and Wu, W., Two Constant Approximation Algorithms for Node-weighted Steiner Tree in Unit Disk Graphs, in Proc. Second Annu. Int. Conf. on Comb. Optim. and Appl., COCOA 2008, Yang, B., Du, D.-Z., and Wang, C.A., Eds., Berlin: Springer-Verlag, 2008, pp. 278–285.Google Scholar
  387. 387.
    Zwicky, F., Discovery Invention, Research Through the Morphological Approach, New York: McMillan, 1969.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2009

Authors and Affiliations

  • M. Sh. Levin
    • 1
  1. 1.Institute for Information Transmission ProblemsRussian Academy of SciencesMoscowRussia

Personalised recommendations