Generalized Network Improvement and Packing Problems, Michael Holzhauser
Автор: Raymond Chiong; Sandeep Dhakal Название: Natural Intelligence for Scheduling, Planning and Packing Problems ISBN: 3642260616 ISBN-13(EAN): 9783642260612 Издательство: Springer Рейтинг: Цена: 27251.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Natural intelligence based approaches for scheduling, planning and packing are discussed as a means to draw inspiration from nature. Evolutionary algorithms, ant colony optimisation and raindrop optimisation are among the solutions presented.
Автор: Guntram Scheithauer Название: Introduction to Cutting and Packing Optimization ISBN: 3319644025 ISBN-13(EAN): 9783319644028 Издательство: Springer Рейтинг: Цена: 12577.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book provides a comprehensive overview of the most important and frequently considered optimization problems concerning cutting and packing.
Автор: P?ter G?bor Szab?; Mihaly Csaba Mark?t; Tibor Csen Название: New Approaches to Circle Packing in a Square ISBN: 0387456732 ISBN-13(EAN): 9780387456737 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Summarizes results achieved in solving the circle packing problem. This work provides the reader with a comprehensive view of theoretical and computational achievements. It also includes a CD that provides the various open source programming codes used, enabling the reader to improve on them and solve the problem instances that remain challenging.
Автор: Conway Название: Sphere Packings, Lattices and Groups ISBN: 0387985859 ISBN-13(EAN): 9780387985855 Издательство: Springer Рейтинг: Цена: 11313.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: V. Lakshmikantham; A.S. Vatsala Название: Generalized Quasilinearization for Nonlinear Problems ISBN: 0792350383 ISBN-13(EAN): 9780792350385 Издательство: Springer Рейтинг: Цена: 13275.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Offers a systematic development of generalized quasilinearization indicating the notions and technical difficulties that are encountered in the unified approach. This book includes the monotone iterative technique as a special case. It is suitable for researchers, industrial and engineering scientists.
Andreas B?rmann develops novel approaches for the solution of network design problems as they arise in various contexts of applied optimization. At the example of an optimal expansion of the German railway network until 2030, the author derives a tailor-made decomposition technique for multi-period network design problems. Next, he develops a general framework for the solution of network design problems via aggregation of the underlying graph structure. This approach is shown to save much computation time as compared to standard techniques. Finally, the author devises a modelling framework for the approximation of the robust counterpart under ellipsoidal uncertainty, an often-studied case in the literature. Each of these three approaches opens up a fascinating branch of research which promises a better theoretical understanding of the problem and an increasing range of solvable application settings at the same time.
Автор: John Conway; Neil J. A. Sloane Название: Sphere Packings, Lattices and Groups ISBN: 1441931341 ISBN-13(EAN): 9781441931344 Издательство: Springer Рейтинг: Цена: 11313.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: We now apply the algorithm above to find the 121 orbits of norm -2 vectors from the (known) nann 0 vectors, and then apply it again to find the 665 orbits of nann -4 vectors from the vectors of nann 0 and -2. The neighbors of a strictly 24 dimensional odd unimodular lattice can be found as follows. If a norm -4 vector v E II . corresponds to the sum 25 1 of a strictly 24 dimensional odd unimodular lattice A and a -dimensional lattice, then there are exactly two nonn-0 vectors of ll25,1 having inner product -2 with v, and these nann 0 vectors correspond to the two even neighbors of A. The enumeration of the odd 24-dimensional lattices. Figure 17.1 shows the neighborhood graph for the Niemeier lattices, which has a node for each Niemeier lattice. If A and B are neighboring Niemeier lattices, there are three integral lattices containing A n B, namely A, B, and an odd unimodular lattice C (cf. Kne4]). An edge is drawn between nodes A and B in Fig. 17.1 for each strictly 24-dimensional unimodular lattice arising in this way. Thus there is a one-to-one correspondence between the strictly 24-dimensional odd unimodular lattices and the edges of our neighborhood graph. The 156 lattices are shown in Table 17 .I. Figure I 7. I also shows the corresponding graphs for dimensions 8 and 16.
Автор: F. Giannessi; A. Maugeri Название: Variational Inequalities and Network Equilibrium Problems ISBN: 1489913602 ISBN-13(EAN): 9781489913609 Издательство: Springer Рейтинг: Цена: 13974.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This volume brings forth a set of papers presented at the conference on "Varia- tional Inequalities and network equilibrium problems", held in Erice at the "G.
Описание: The book discusses three classes of problems: the generalized Nash equilibrium problems, the bilevel problems and the mathematical programming with equilibrium constraints (MPEC).
Автор: C. Wynants Название: Network Synthesis Problems ISBN: 1441948430 ISBN-13(EAN): 9781441948434 Издательство: Springer Рейтинг: Цена: 19564.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: The protection approach preas- signs spare capacity to protect each element of the network independently, while the restoration approach spreads the redundant capacity over the whole network and uses it as required in order to restore the disrupted traffic.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
