LP, Graphs and Formulations tokoharu
- [shortest route](/en/shortest%20route) issue and LP
- Special case of minimum cost flow
- If there is enough capacity on the edges and the distance is a cost, the cost of one flow and the distance in the shortest path in the original graph match.
- [differential constraint](/en/differential%20constraint), colloquially [embarrassingly bad video game where the object is to make the audience laugh](/en/embarrassingly%20bad%20video%20game%20where%20the%20object%20is%20to%20make%20the%20audience%20laugh) (POJ 3169(Layout))
- [maximum flow](/en/maximum%20flow) issue and LP
- [maximum flow minimum cut theorem](/en/maximum%20flow%20minimum%20cut%20theorem)
- [maximum circulating flow](/en/maximum%20circulating%20flow) Issue.
- [least-cost current](/en/least-cost%20current) and LP
- Least Cost Circular Flow] problem with minimum flow constraint
- Potential difference maximization problem under difference constraints
- [Project Selection Problem](/en/Project%20Selection%20Problem)
This page is auto-translated from /nishio/LPとグラフと定式化 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.