ACOPF with Pyomo/Pypower/Ipopt
-
Updated
Sep 9, 2024 - Python
ACOPF with Pyomo/Pypower/Ipopt
attempts to find optimal solutions of the 100 Hex-a-Hop levels, and it usually succeeds before a time limit!
Dynamic Programming
Resolution of an increasingly complex planning problem leveraging different PDDL and HDDL planners to achieve optimal plans
solves "Unblock Me" or "Sliding Cars" sort of puzzles then lets you interact with an animation of the solution
I'll be exploring the easy leetcode and other platform problems and come up with the solution"optimized".
Add a description, image, and links to the optimal-solution topic page so that developers can more easily learn about it.
To associate your repository with the optimal-solution topic, visit your repo's landing page and select "manage topics."