All projects
2025
Energy Distribution Network Optimization DAA Project
Strategies for solving a power system network planning problem through greedy strategies, using dynamic programming and flow approximation algorithms…
View on GitHub1 stars
Overview
Strategies for solving a power system network planning problem through greedy strategies, using dynamic programming and flow approximation algorithms. NP-Completeness analysis. The Min K-Cut problem Open-source project by Daniel Machado Pérez, published on GitHub.
Highlights
- 1 star on GitHub
- Primary language: TeX
- Open source — view the code and contribute on GitHub
Built with
- TeX
- Dynamic Programming
- Flow
- Greedy
- Min K Cut
Discussion (0)
Log in to comment.
No comments yet. Be the first to start the conversation.