Combinatorial Optimization Models for Studying Complex Systems with Interacting Components
Author : Ming-chi Tsai
Publisher :
Page : 400 pages
File Size : 12,28 MB
Release : 2000
Category :
ISBN :
Author : Ming-chi Tsai
Publisher :
Page : 400 pages
File Size : 12,28 MB
Release : 2000
Category :
ISBN :
Author : De-Shuang Huang
Publisher : Springer Science & Business Media
Page : 1397 pages
File Size : 50,10 MB
Release : 2007-08-09
Category : Computers
ISBN : 3540742018
This volume, in conjunction with the two volumes CICS 0002 and LNCS 4681, constitutes the refereed proceedings of the Third International Conference on Intelligent Computing held in Qingdao, China, in August 2007. The 139 full papers published here were carefully reviewed and selected from among 2,875 submissions. These papers offer important findings and insights into the field of intelligent computing.
Author : M.S. Levin
Publisher : Springer Science & Business Media
Page : 384 pages
File Size : 45,36 MB
Release : 2013-11-27
Category : Mathematics
ISBN : 146155831X
Combinatorial Engineering of Decomposable Systems presents a morphological approach to the combinatorial design/synthesis of decomposable systems. Applications involve the following: design (e.g., information systems; user's interfaces; educational courses); planning (e.g., problem-solving strategies; product life cycles; investment); metaheuristics for combinatorial optimization; information retrieval; etc.
Author : Bernhard Korte
Publisher : Springer Science & Business Media
Page : 535 pages
File Size : 21,38 MB
Release : 2013-11-11
Category : Mathematics
ISBN : 3662217112
This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.
Author :
Publisher :
Page : 524 pages
File Size : 21,40 MB
Release : 2000
Category : Cellular automata
ISBN :
Author : Bernhard H. Korte
Publisher : Springer
Page : 552 pages
File Size : 36,24 MB
Release : 2000-06-05
Category : Computers
ISBN :
This comprehensive textbook on combinatorial optimisation puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It has arisen as the basis of several courses on combinatorial optimisation and more special topics at graduate level. Since the complete book contains enough material for at least four semesters (4 hours a week), one usually selects material in a suitable way. The book contains complete (but concise) proofs, also for many deep results, some of which did not appear in a book before. Many very recent topics are covered as well, and many references are provided. Thus this book represents the state-of-the-art of combinatorial optimisation.
Author : Michael Z. Zgurovsky
Publisher : Springer
Page : 527 pages
File Size : 18,55 MB
Release : 2018-09-24
Category : Technology & Engineering
ISBN : 3319989774
The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.
Author : Vangelis Th. Paschos
Publisher : John Wiley & Sons
Page : 450 pages
File Size : 18,37 MB
Release : 2014-09-15
Category : Mathematics
ISBN : 1848216580
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Author : Alexander K. Hartmann
Publisher : John Wiley & Sons
Page : 312 pages
File Size : 47,68 MB
Release : 2006-03-06
Category : Science
ISBN : 352760457X
Many physicists are not aware of the fact that they can solve their problems by applying optimization algorithms. Since the number of such algorithms is steadily increasing, many new algorithms have not been presented comprehensively until now. This presentation of recently developed algorithms applied in physics, including demonstrations of how they work and related results, aims to encourage their application, and as such the algorithms selected cover concepts and methods from statistical physics to optimization problems emerging in theoretical computer science.
Author : My T. Thai
Publisher : Springer Science & Business Media
Page : 539 pages
File Size : 38,44 MB
Release : 2011-11-25
Category : Mathematics
ISBN : 1461408571
Complex Social Networks is a newly emerging (hot) topic with applications in a variety of domains, such as communication networks, engineering networks, social networks, and biological networks. In the last decade, there has been an explosive growth of research on complex real-world networks, a theme that is becoming pervasive in many disciplines, ranging from mathematics and computer science to the social and biological sciences. Optimization of complex communication networks requires a deep understanding of the interplay between the dynamics of the physical network and the information dynamics within the network. Although there are a few books addressing social networks or complex networks, none of them has specially focused on the optimization perspective of studying these networks. This book provides the basic theory of complex networks with several new mathematical approaches and optimization techniques to design and analyze dynamic complex networks. A wide range of applications and optimization problems derived from research areas such as cellular and molecular chemistry, operations research, brain physiology, epidemiology, and ecology.