3 ms·
Network flow optimization and its many particular cases (bipartite matching, transportation problem, nonintersecting paths) are usually defined in terms of dire
by generationP 3y ago
Network flow optimization and its many particular cases (bipartite matching, transportation problem, nonintersecting paths) are usually defined in terms of directed graphs with arc weights. You can package the arc capacities as a matrix, but you don't do the usual matrix things with it (like multiplying matrices, Gaussian elimination, QR, SVD), except perhaps if you do your matrix algebra over the tropical semiring (but that's often graph theory by another name). So you need new methods even if you shoehorn the problems into matrix language.
- superpirate 3y agoHi, generationP! Excuse me for the unrelated question but it may be the only way to ask you. I've found you comment from a while ago: https://news.ycombinator.com/item?id=30316156 https://news.ycombinator.com/item?id=30316156 Could you tell a little bit more about thing named "Plato"? It is more a history question and I cannot find any references in the Internet about it. If you are more comfortable with private messages, I can be reached at ultranymous at proton dot me
- generationP 3y agoI know very little about it. I referred to it as "Plato" only because it used to show a picture of Plato sitting on a rock when it downloaded a new paper into its library. My guess is that it used someone's donated account to do that.
- brutusborn 3y agoTropical semiring looks fascinating. Link for the curious: https://www.wikiwand.com/en/Tropical_geometry https://www.wikiwand.com/en/Tropical_geometry