An illustration of a magnifying glass. An illustration of a magnifying glass.

This repository contains code used in the paper, "Solving 0–1 Knapsack Problems Using Sine-Cosine Algorithm". The Sine Cosine Algorithm (SCA), developed by Seyedali Mirjalili [1], belongs to the class ...

Abstract: Knapsack problem is a classical optimization problem in computer science and programming. Knapsack problem main objective is to solve how much the maximum profit can be carried with the ...

Presents corrections to the paper, (Corrections to “Enhancing Knapsack-Based Financial Portfolio Optimization Using Quantum Approximate Optimization Algorithm”).

Abstract: This is a research project on using Genetic Algorithm to solve 0-1 Knapsack Problem. Knapsack problem is a combinational optimization problem. Given a set of items, each with a weight & ...

In four new studies, researchers found complicated results from experiments on Facebook’s and Instagram’s algorithms, suggesting there was no silver bullet to fixing the platforms. By Mike Isaac and ...

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment ...

ABSTRACT: This paper describes methods to merge two cover inequalities and also simultaneously merge multiple cover inequalities in a multiple knapsack instance. Theoretical results provide conditions ...

College of Information Science and Engineering, Northeastern University, Shenyang 110819, China. School of Information Science and Technology, Sun Yat-sen University, Guangzhou 510006, China. In order ...