Graph Theory: Binary Optimization
N.B. Singh
This audiobook is narrated by a digital voice.
"Graph Theory: Binary Optimization" introduces fundamental graph theory concepts and their practical applications in binary optimization. This beginner-friendly book explains how graphs model real-world problems like network design and scheduling, equipping readers with essential skills in optimization techniques.
Duration - 3h 52m.
Author - N.B. Singh.
Narrator - Digital Voice Mary G.
Published Date - Monday, 20 January 2025.
Copyright - © 2024 N.B. Singh ©.
Location:
United States
Description:
This audiobook is narrated by a digital voice. "Graph Theory: Binary Optimization" introduces fundamental graph theory concepts and their practical applications in binary optimization. This beginner-friendly book explains how graphs model real-world problems like network design and scheduling, equipping readers with essential skills in optimization techniques. Duration - 3h 52m. Author - N.B. Singh. Narrator - Digital Voice Mary G. Published Date - Monday, 20 January 2025. Copyright - © 2024 N.B. Singh ©.
Language:
English
Preface
Duration:00:00:34
Introduction to Graph Theory and Binary Optimization
Duration:00:01:23
Overview of Graph Theory
Duration:00:05:37
Basics of Binary Optimization
Duration:00:04:11
Historical Context and Applications
Duration:00:03:44
Key Challenges and Opportunities
Duration:00:05:12
Mathematical Foundations
Duration:00:04:13
Structure of the Book
Duration:00:03:58
Fundamental Concepts in Graph Theory
Duration:00:01:27
Graphs and Their Representations
Duration:00:04:26
Types of Graphs
Duration:00:06:50
Graph Connectivity
Duration:00:06:58
Graph Traversal Techniques
Duration:00:06:23
Graph Coloring and Covering
Duration:00:06:26
Special Classes of Graphs
Duration:00:07:07
Binary Decision Variables and Optimization Problems
Duration:00:01:42
Definition and Examples of Binary Variables
Duration:00:04:36
Formulating Optimization Problems
Duration:00:05:15
Constraint Handling
Duration:00:04:35
Objective Functions in Binary Optimization
Duration:00:05:09
Feasibility and Solution Space
Duration:00:05:05
Complexity and Computational Considerations
Duration:00:05:30
Graph Algorithms for Binary Optimization
Duration:00:01:37
Graph Search Algorithms
Duration:00:05:27
Matching and Flow Algorithms
Duration:00:04:50
Pathfinding Algorithms
Duration:00:04:13
Cutting Plane Methods
Duration:00:04:04
Branch and Bound Techniques
Duration:00:04:17
Heuristics and Metaheuristics
Duration:00:04:31
Integer Linear Programming and Graph Models
Duration:00:01:42
Formulation of ILP Problems
Duration:00:05:00
Graph-Based ILP Models
Duration:00:04:40
Solution Techniques for ILP
Duration:00:05:38
Duality and Relaxation
Duration:00:05:15
Cutting Planes and Branch-and-Cut
Duration:00:04:52
Applications in Network Design
Duration:00:04:46
Applications of Graph Theory in Binary Optimization
Duration:00:01:39
Network Design and Analysis
Duration:00:05:28
Scheduling and Timetabling
Duration:00:05:40
Resource Allocation Problems
Duration:00:05:48
Facility Location and Layout
Duration:00:05:48
Routing and Logistics
Duration:00:05:17
Case Studies and Real-World Examples
Duration:00:06:51
Advanced Topics in Binary Optimization and Graph Theory
Duration:00:01:43
Advanced Heuristics and Metaheuristics
Duration:00:06:48
Decomposition Methods
Duration:00:05:54
Dynamic and Stochastic Optimization
Duration:00:04:54
Approximation Algorithms
Duration:00:04:38
Graph-Theoretic Insights in Machine Learning
Duration:00:04:55
Emerging Trends and Future Directions
Duration:00:06:15