Maximal dynamic polymatroid flows and applications |
| |
| Affiliation: | Center for Optimization and Combinatorics (COCO), and Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL 32611, USA |
| |
| Abstract: | The concept of dynamic polymatroid flows is introduced. It is shown that the time expanded network algorithm which is well known for dynamic network flows works for polymatroid flows as well. As applications we discuss dynamic matroid intersection and dynamic matroid partitionings. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
