Search results

From Maths
Jump to: navigation, search
  • ..."things" is to form the problem as a classic "shortest path" combinatorial optimisation problem, the problem is formulated as follows:
    12 KB (2,041 words) - 00:50, 27 June 2016
  • {{Definition|Analysis|Functional Analysis|Combinatorial Optimisation|Convex Optimisation}}
    532 B (92 words) - 14:50, 9 February 2017
  • {{Definition|Analysis|Functional Analysis|Combinatorial Optimisation|Convex Optimisation}}
    1 KB (224 words) - 10:54, 10 February 2017
  • ...alysis|Functional Analysis|Real Analysis|Convex Optimisation|Combinatorial Optimisation}}
    674 B (114 words) - 11:04, 10 February 2017