ABSTRACT: The accurate prediction of backbreak, a crucial parameter in mining operations, has a significant influence on safety and operational efficiency. The occurrence of this phenomenon is ...

Bio-inspired computational methods have gained popularity recently. These methods mimic the seemingly complex behavior of organisms to tackle difficult and often overwhelming problems. For example, ...

Researchers have successfully used a quantum algorithm to solve a complex century-old mathematical problem long considered impossible for even the most powerful conventional supercomputers. The ...

A Python implementation of a branch-and-bound approach (plus a simple greedy heuristic) to solve a variation of the multiple knapsack problem where items have both individual and pairwise benefits.

The original version of this story appeared in Quanta Magazine. Computer scientists often deal with abstract problems that are hard to comprehend, but an exciting new algorithm matters to anyone who ...

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 ...

Abstract: The knapsack problem is known as a NP-hard problem. There is a dynamic programming solution for this problem which is called the 0–1 knapsack. Firefly's innovative optimization algorithm is ...

Abstract: In order to overcome the disadvantages of the traditional genetic algorithm and improve the speed and precision of the algorithm, the author improved the selection strategy, integrated the ...