Optimal path calculation method of optical network under complex constraints
Abstract To address the optimal solution problem of loop‐free paths in software‐defined optical networks with multiple complex logical relationships, a unified constraint expression is utilized to describe the constraints. The logical relationships of complex constraints are dissected and simplified...
Saved in:
| Main Authors: | Peng Zhu, Hong Sun, Qian Xiang, Zhenming Zhang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-12-01
|
| Series: | Engineering Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1002/eng2.12962 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2023-04-01) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01) -
The True Shortest Path of Obstacle Grid Graph Is Solved by SGP Vertex Extraction and Filtering Algorithm
by: Yijie Zhang, et al.
Published: (2025-06-01) -
The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph
by: Alexander Valeryevich Smirnov
Published: (2022-12-01) -
An Algorithm to Find the Shortest Path through Obstacles of Arbitrary Shapes and Positions in 2D
by: Gilles Labonté
Published: (2024-09-01)