Fruchter, G. (2026) Opportunism in Supply Chain Recommendations: A Dynamic Optimization Approach. Modern Economy, 17, 26-38.

Abstract: The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in ...

The original version of this story appeared in Quanta Magazine. In 1939, upon arriving late to his statistics course at UC Berkeley, George Dantzig—a first-year graduate student—copied two problems ...

Abstract: Direct collocation (DC) is a widely used method for solving dynamic optimization problems (DOPs), but its implementation simplicity and computational efficiency are limited for challenging ...