Problem Definition and Optimization Method for Bipartite Graph Scheduling
Bipartite graphs can describe various systems in real world. In this study, we define a new problem class for optimizing the cost or profit associated with state changes in systems represented by bipartite graphs and propose a heuristic approach based on a fast greedy algorithm. We present the probl...
| 發表在: | IEEE Access |
|---|---|
| Main Authors: | , |
| 格式: | Article |
| 語言: | 英语 |
| 出版: |
IEEE
2024-01-01
|
| 主題: | |
| 在線閱讀: | https://ieeexplore.ieee.org/document/10555222/ |