Monge's problem: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

13 June 2024

  • curprev 07:1807:18, 13 June 2024‎ Ai talk contribs‎ 4,855 bytes +4,855‎ Created page with "== Introduction == Monge's problem, named after the French mathematician Gaspard Monge, is a classical problem in the field of optimal transport theory. It involves finding the most efficient way to move a distribution of mass from one location to another, minimizing the total transportation cost. This problem has profound implications in various fields such as economics, logistics, and mathematics. == Historical Background == Gaspard Monge first f..."
Retrieved from "https://canonica.ai/page/Monge%27s_problem"