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.
save
₹9,715.00
Concepts 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.
₹7,035.00₹16,750.00
In stock
| Weight | 1 kg |
|---|---|
| Dimensions | 23 × 15 × 2 cm |
| Book Author | Vangelis Th. Paschos |
| Edition | 1st |
| Format | Hardback |
| ISBN | 9781848216563 |
| Language | English |
| Pages | 408 |
| Publication Year | |
| Publisher |
Customer Reviews
There are no reviews yet.
Related products
-
-
Engineering Computation with MATLAB
₹2,618.00The book places the fundamental tenets of computer programming into the context of MATLAB, employing hands-on exercises, examples from the engineering industry, and a variety of core tools to increase programming proficiency and capability. With this knowledge, students are prepared to adapt learned concepts to other programming languages.
₹5,950.00 -
Abstract Algebra
₹4,006.00In addition to standard introductory material on the subject, such as Lagrange’s and Sylow’s theorems in group theory, the text provides important specific illustrations of general theory, discussing in detail finite fields, cyclotomic polynomials, and cyclotomic fields. The book also focuses on broader background, including brief but representative discussions of naive set theory and equivalents of the axiom of choice, quadratic reciprocity, Dirichlet’s theorem on primes in arithmetic progressions, and some basic complex analysis. Numerous worked examples and exercises throughout facilitate a thorough understanding of the material.
₹8,999.00 -
Applications of Hyperstructure Theory
₹6,666.00Since the beginning, the Hyperstructure Theory and particu- larly the Hypergroup Theory, had applications to several domains. Marty, who introduced hypergroups in 1934, applied them to groups, algebraic functions and rational fractions. New applications to groups were also found among others by Eaton, Ore, Krasner, Utumi, Drbohlav, Harrison, Roth, Mockor, Sureau and Haddad. Connections with other subjects of classical pure Mathematics have been determined and studied: * Fields by Krasner, Stratigopoulos and Massouros Ch. * Lattices by Mittas, Comer, Konstantinidou, Serafimidis, Leoreanu and Calugareanu * Rings by Nakano, Kemprasit, Yuwaree * Quasigroups and Groupoids by Koskas, Corsini, Kepka, Drbohlav, Nemec * Semigroups by Kepka, Drbohlav, Nemec, Yuwaree, Kempra- sit, Punkla, Leoreanu * Ordered Structures by Prenowitz, Corsini, Chvalina IX x * Combinatorics by Comer, Tallini, Migliorato, De Salvo, Scafati, Gionfriddo, Scorzoni * Vector Spaces by Mittas * Topology by Mittas , Konstantinidou * Ternary Algebras by Bandelt and Hedlikova.
₹20,199.00 -
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
₹3,085.00The 42 revised full papers presented together with six invited survey papers were carefully reviewed and selected from a total of 86 submissions. The papers are organized in sections on codes and iterative decoding, arithmetic, graphs and matrices, block codes, rings and fields, decoding methods, code construction, algebraic curves, cryptography, codes and decoding, convolutional codes, designs, decoding of block codes, modulation and codes, Gröbner bases and AG codes, and polynomials.
₹9,349.00 -
Applied Mathematics for Science and Engineering
₹5,483.00- Based on a decade’s worth of the authors lecture notes detailing the topic of applied mathematics for scientists and engineers
- Concisely writing with numerous examples provided including historical perspectives as well as a solutions manual for academic adopters
₹12,750.00 -
Algorithmic Combinatorics on Partial Words
₹6,120.00This five-part book begins with a section on basics that covers terminology, the compatibility of partial words, and combinatorial properties of words. The book then focuses on three important concepts of periodicity on partial words: period, weak period, and local period. The next part describes a linear time algorithm to test primitivity on partial words and extends the results on unbordered words to unbordered partial words while the following section introduces some important properties of pcodes, details a variety of ways of defining and analyzing pcodes, and shows that the pcode property is decidable using two different techniques. In the final part, the author solves various equations on partial words, presents binary and ternary correlations, and covers unavoidable sets of partial words.
Setting the tone for future research in this field, this book lucidly develops the central ideas and results of combinatorics on partial words.
₹17,999.00 -
Statistical Methods for the Social Sciences
₹3,854.00The 5th Edition uses examples and exercises with a variety of “real data.” It includes more illustrations of statistical software for computations and takes advantage of the outstanding applets to explain key concepts, such as sampling distributions and conducting basic data analyses. It continues to downplay mathematics–often a stumbling block for students–while avoiding reliance on an overly simplistic recipe-based approach to statistics.
₹6,950.00
Be the first to review “Concepts of Combinatorial Optimization”