Number Search Puzzle Book: 200 Challenging Large Print Number Searches For Adults, Integer Puzzles

Автор: Kaczorek Tadeusz, Borawski Kamil
Название: Descriptor Systems of Integer and Fractional Orders
ISBN: 3030724794 ISBN-13(EAN): 9783030724795
Издательство: Springer
Цена: 18167.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book covers some selected problems of the descriptor integer and fractional order positive continuous-time and discrete-time systems. The book consists of 3 chapters, 4 appendices and the list of references. Chapter 1 is devoted to descriptor integer order continuous-time and discrete-time linear systems.

Автор: Wolsey, Laurence A. (universite Catholique De Louv
Название: Integer programming
ISBN: 0471283665 ISBN-13(EAN): 9780471283669
Издательство: Wiley
Рейтинг:
Цена: 15602.00 р.
Наличие на складе: Поставка под заказ.

Описание: This volume is aimed at users of integer programming who wish to understand why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively.

Автор: Integer Puzzles
Название: Number Search Puzzle Book: 400 Challenging Large Print Number Searches For Adults
ISBN: 1990085180 ISBN-13(EAN): 9781990085185
Издательство: Неизвестно
Рейтинг:
Цена: 3586.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Number search puzzle book, over 8,000 numbers to find. Large print can be enjoyed by seniors.

Автор: Integer Puzzles
Название: Number Search Puzzle Book: 100 Challenging Large Print Number Searches For Adults
ISBN: 1990085156 ISBN-13(EAN): 9781990085154
Издательство: Неизвестно
Рейтинг:
Цена: 1931.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Number search puzzle book, over 2,000 numbers to find. Large print can be enjoyed by seniors.

Автор: Integer Puzzles
Название: Number Search Puzzle Book: 300 Challenging Large Print Number Searches For Adults
ISBN: 1990085172 ISBN-13(EAN): 9781990085178
Издательство: Неизвестно
Рейтинг:
Цена: 3035.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Number search puzzle book, over 6,000 numbers to find. Large print can be enjoyed by seniors.

Автор: Sawik Tadeusz
Название: Supply Chain Disruption Management: Using Stochastic Mixed Integer Programming
ISBN: 3030448169 ISBN-13(EAN): 9783030448165
Издательство: Springer
Цена: 19564.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book deals with stochastic combinatorial optimization problems in supply chain disruption management, with a particular focus on management of disrupted flows in customer-driven supply chains.

Автор: Singh Mohit, Williamson David P.
Название: Integer Programming and Combinatorial Optimization: 22nd International Conference, Ipco 2021, Atlanta, Ga, Usa, May 19-21, 2021, Proceedings
ISBN: 3030738787 ISBN-13(EAN): 9783030738785
Издательство: Springer
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book constitutes the proceedings of the 22nd Conference on Integer Programming and Combinatorial Optimization, IPCO 2021, which took place during May 19-21, 2021. The conference was organized by Georgia Institute of Technology and planned to take place it Atlanta, GA, USA, but changed to an online format due to the COVID-19 pandemic.

Автор: P.D.T.A. Elliott
Название: Arithmetic Functions and Integer Products
ISBN: 1461385504 ISBN-13(EAN): 9781461385509
Издательство: Springer
Рейтинг:
Цена: 16769.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Beginning in the thirties of this century, the work of Erdos, Kac, Kubilius, Turan and others gave a discipline to the study of the general value distribution of arithmetic func- tions by the introduction of ideas, methods and results from the theory of Probability.

Автор: Alves Clбudio, Clautiaux Francois, Valйrio de Carvalho Josй
Название: Dual-Feasible Functions for Integer Programming and Combinatorial Optimization: Basics, Extensions and Applications
ISBN: 331980183X ISBN-13(EAN): 9783319801834
Издательство: Springer
Рейтинг:
Цена: 6986.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book provides a postgraduate audience the keys they need to understand and further develop a set of tools for the efficient computation of lower bounds and valid inequalities in integer programs and combinatorial optimization problems.

Автор: Hu T. C., Kahng Andrew B.
Название: Linear and Integer Programming Made Easy
ISBN: 3319795686 ISBN-13(EAN): 9783319795683
Издательство: Springer
Рейтинг:
Цена: 8384.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This textbook provides concise coverage of the basics of linear and integer programming which, with megatrends toward optimization, machine learning, big data, etc., are becoming fundamental toolkits for data and information science and technology.

Автор: Henggeler Antunes Carlos, Alves Maria Joao, Climaco Joao
Название: Multiobjective Linear and Integer Programming
ISBN: 3319804138 ISBN-13(EAN): 9783319804132
Издательство: Springer
Рейтинг:
Цена: 11179.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: This book opens the door to multiobjective optimization for students in fields such as engineering, management, economics and applied mathematics. It offers a comprehensive introduction to multiobjective optimization, with a primary emphasis on multiobjective linear programming and multiobjective integer/mixed integer programming.

Автор: Lцffler Andre
Название: Constrained Graph Layouts: Vertices on the Outer Face and on the Integer Grid
ISBN: 3958261469 ISBN-13(EAN): 9783958261464
Издательство: Неизвестно
Рейтинг:
Цена: 8104.00 р.
Наличие на складе: Есть у поставщика Поставка под заказ.

Описание: Constraining graph layouts - that is, restricting the placement of vertices and the routing of edges to obey certain constraints - is common practice in graph drawing. In this book, we discuss algorithmic results on two different restriction types: placing vertices on the outer face and on the integer grid. For the first type, we look into the outer k-planar and outer k-quasi-planar graphs, as well as giving a linear-time algorithm to recognize full and closed outer k-planar graphs Monadic Second-order Logic. For the second type, we consider the problem of transferring a given planar drawing onto the integer grid while perserving the original drawings topology; we also generalize a variant of Cauchy's rigidity theorem for orthogonal polyhedra of genus 0 to those of arbitrary genus.