Электронная книга: Vangelis Paschos Th. «Applications of Combinatorial Optimization»
|
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. Издательство: "John Wiley&Sons Limited"
ISBN: 9781119015222 электронная книга Купить за 13976.64 руб и скачать на Litres |
Другие книги автора:
| Книга | Описание | Год | Цена | Тип книги |
|---|---|---|---|---|
| Paradigms of Combinatorial Optimization. Problems and New Approaches, Volume 2 | Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three… — John Wiley&Sons Limited, электронная книга Подробнее... | электронная книга | ||
| Paradigms of Combinatorial Optimization. Problems and New Approaches | Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three… — John Wiley&Sons Limited, электронная книга Подробнее... | электронная книга | ||
| Concepts of Combinatorial Optimization | Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three… — John Wiley&Sons Limited, электронная книга Подробнее... | электронная книга | ||
| Applications of Combinatorial Optimization | Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three… — John Wiley&Sons Limited, электронная книга Подробнее... | электронная книга | ||
| Concepts of Combinatorial Optimization | Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three… — John Wiley&Sons Limited, электронная книга Подробнее... | электронная книга |
См. также в других словарях:
Combinatorial optimization — In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.[1] In many such problems, exhaustive search is not feasible. It operates on… … Wikipedia
Combinatorial data analysis — (CDA) is the study of data sets where the arrangement of objects is important. CDA can be used either to determine how well a given combinatorial construct reflects the observed data, or to search for a suitable combinatorial construct that does… … Wikipedia
optimization — /op teuh meuh zay sheuhn/ 1. the fact of optimizing; making the best of anything. 2. the condition of being optimized. 3. Math. a mathematical technique for finding a maximum or minimum value of a function of several variables subject to a set of … Universalium
Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 … Wikipedia
