Back to Search
Start Over
Finding all minimum cost flows and a faster algorithm for the K best flow problem
- Source :
- Discrete Applied Mathematics. 321:333-349
- Publication Year :
- 2022
- Publisher :
- Elsevier BV, 2022.
- Subjects :
- Applied Mathematics
Discrete Mathematics and Combinatorics
Subjects
Details
- ISSN :
- 0166218X
- Volume :
- 321
- Database :
- OpenAIRE
- Journal :
- Discrete Applied Mathematics
- Accession number :
- edsair.doi...........115ffea6a02b16072819ffa7fd371c3a