A.I.’s First Big Math Breakthrough Is Not What It Seems

Last month, OpenAI announced that its latest version of ChatGPT had solved a major math problem, one that had stumped experts ...
IEEE

A Comparative Study of Meta-Heuristic Optimization Algorithms for 0 – 1 Knapsack Problem: Some Initial Results

Abstract: In this paper, we present some initial results of several meta-heuristic optimization algorithms, namely, genetic algorithms, simulated annealing, branch and bound, dynamic programming, ...
IEEE

An Improved Shuffled Frog-Leaping Algorithm to Solving 0–1 Knapsack Problem

Abstract: To address the problems of slow convergence, low search accuracy, and easy fall into local optimum, and generating a large number of infeasible solutions when solving the 0–1 Knapsack ...
acm.org

Data-Driven Algorithm Design

The best algorithm for a computational problem generally depends on the “relevant inputs,” a concept that depends on the application domain and often defies formal articulation. Although there is a ...
GitHub

GKNAP: A Java and C++ package for solving the multidimensional knapsack problem

[Ahuja00] “A greedy genetic algorithm for the quadratic assignment problem”, R. Ahuja, J. Orlin, A. Tiwari, Computers and Operations Research, vol. 27, issue 10 (Sept. 2000), 917--934, ACM (2000) ...
GitHub

Data Structure and Algorithms Problems

Note: Some of the code here is old and was written when I was learning C++. It might be possible that code is not safe or making wrong assumptions. Please use with caution. Pull requests are always ...