Research team debuts the first deterministic streaming algorithms for non-monotone submodular maximization, delivering superior approximation ratios with minimal memory and real-time throughput on ...

We publish the best academic work (that's too often lost to peer reviews & the TA's desk) to the global tech community ...

Abstract: 0-1 knapsack problem is a typical NP complex issues in field of computer. Traditional solve knapsack problem is recursively backtracking and greedy methods. Use recursive backtracking to ...

ABSTRACT: This study presents a two-echelon inventory routing problem (2E-IRP) with an end-of-tour replenishment (ETR) policy whose distribution network consists of a supplier, several distribution ...

implementation of dynamic and greedy approach solution for a problem. Which is a car company that produces given amount of cars every month with investments, profits costs etc. Profits are from car ...

This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were ...

Abstract: The paper solves the 0–1 knapsack problem with the modified adaptive genetic transform algorithm which combined with greedy transform algorithm. By means of mixing adaptive crossover and ...