Abstract
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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
