Since Balas and Zemel in the 1980s introduced the so-called core problem as an efficient tool for solving the Knapsack Problem, all the most successful algorithms have applied this concept. Balas and ...

Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field. (January 15, 2017, update: On January 4, Babai retracted ...

We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on what we call the core of the problem, namely, a knapsack problem ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

Shenzhen, May 14, 2025 (GLOBE NEWSWIRE) -- MicroAlgo Inc. Announces Research on Quantum Information Recursive Optimization (QIRO) Algorithm, for Combinatorial Optimization Problems to Expand and Solve ...

Researchers adapt model predictive control from engineering to epidemic response, balancing health and economic costs under ...