System Configuration and Combinatorial Optimization

  • Mark Sh. Levin
Part of the Decision Engineering book series (DECENGIN)


This chapter (Partially based on: Levin MS (2009) Combinatorial optimization in system conguration design. Automation and Remote Control 70(3): 519–561) addresses a systematic glance to combinatorial optimization problems in design of system configuration (e.g., selection of system components, selection of system components while taking into account compatibility of the selected items, assignment, graph coloring). The list of the described combinatorial problems involves the following: problem of representations, shortest path problem, multipartite graph clustering, morphological clique problem, allocation problem, graph coloring. Examples illustrate the configuration and reconfiguration problems.


Knapsack Problem System Configuration Short Path Problem Graph Coloring Problem System Reconfiguration 
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.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Institute for Information Transmission Problems (Kharkevich Institute)Russian Academy of SciencesMoscowRussia

Personalised recommendations