Knapsack 0-1 path reconstruction (which items to take)
128950
How to find which elements are in the bag, using Knapsack Algorithm [and not only the bag's value]?
104390
How can we rewrite this optimization problem in standard form?
59754
Extended Euclidean Algorithm: backward vs. forward
81928
Covering with most possible equal size subsets having pairwise singleton intersections
26586
Lofting between two different shapes along a path
109740
Bresenham's line algorithm
7944
What algorithm can be used for packing rectangles of different sizes into the smallest rectangle possible in a fairly optimal way?
101724
Expected minimum distance from a point with varying density
78194
Finding minimum-area-rectangle for given points?
102798
Estimating the intersection of two lines
145978
Python Implementations of Packing Algorithm
99806
Given an undirected Graph
32734
How do I calculate paths for objects with limited acceleration?
127861
Finding Local Minima / Maxima in Noisy Data
127742
NMinimize in one-dimensional Interval
102630
Approximation algorithms for min vector subset-sum over GF(2)
152236
What is the optimal path between $2$ fixed points around an invisible obstructing wall?