# Combinatorial and Algorithmic Mathematics

## From Foundation to Optimization

1. Auflage August 2024

528 Seiten, Hardcover*Wiley & Sons Ltd*

**978-1-394-23594-0**

Detailed review of optimization from first principles, supported by rigorous math and computer science explanations and various learning aids

Supported by rigorous math and computer science foundations, Combinatorial and Algorithmic Mathematics: From Foundation to Optimization provides a from-scratch understanding to the field of optimization, discussing 70 algorithms with roughly 220 illustrative examples, 160 nontrivial end-of-chapter exercises with complete solutions to ensure readers can apply appropriate theories, principles, and concepts when required, and Matlab codes that solve some specific problems. This book helps readers to develop mathematical maturity, including skills such as handling increasingly abstract ideas, recognizing mathematical patterns, and generalizing from specific examples to broad concepts.

Starting from first principles of mathematical logic, set-theoretic structures, and analytic and algebraic structures, this book covers both combinatorics and algorithms in separate sections, then brings the material together in a final section on optimization. This book focuses on topics essential for anyone wanting to develop and apply their understanding of optimization to areas such as data structures, algorithms, artificial intelligence, machine learning, data science, computer systems, networks, and computer security.

Combinatorial and Algorithmic Mathematics includes discussion on:

* Propositional logic and predicate logic, set-theoretic structures such as sets, relations, and functions, and basic analytic and algebraic structures such as sequences, series, subspaces, convex structures, and polyhedra

* Recurrence-solving techniques, counting methods, permutations, combinations, arrangements of objects and sets, and graph basics and properties

* Asymptotic notations, techniques for analyzing algorithms, and computational complexity of various algorithms

* Linear optimization and its geometry and duality, simplex and non-simplex algorithms for linear optimization, second-order cone programming, and semidefinite programming

Combinatorial and Algorithmic Mathematics is an ideal textbook resource on the subject for students studying discrete structures, combinatorics, algorithms, and optimization. It also caters to scientists across diverse disciplines that incorporate algorithms and academics and researchers who wish to better understand some modern optimization methodologies.

Preface

Acknowledgements

About the Companion Website

PART I FOUNDATIONS

1. Mathematical Logic

2. Set-Theoretic Structures

3. Analytic and Algebraic Structures

PART II COMBINATORICS

4. Graphs

5. Recurrences

6. Counting

PART III ALGORITHMS

7. Analysis of Algorithms

8. Array and Numeric Algorithms

9. Elementary Combinatorial Algorithms

PART IV OPTIMIZATION

10. Linear Programming

11. Second-Order Cone Programming

12. Semidefinite Programming and Combinatorial Optimization

Appendix. Solutions to Chapter Exercises

Bibliography

Index