Combinatorial optimization is the invisible machinery of modern civilization. Whenever a factory schedules its production ...

Optimization problems rarely have a single right answer. In engineering design, scheduling, and machine learning, decision ...

Determining the least expensive path for a new subway line underneath a metropolis like New York City is a colossal planning challenge—involving thousands of potential routes through hundreds of city ...

Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue, researchers ...

The dragonfly algorithm is a nature-inspired metaheuristic that mimics the static and dynamic swarming behaviours of dragonflies in prey hunting and predator evasion. Since its introduction, it has ...

Research paper by Bjørnar Luteberget and Giorgio Sartor wins 2024 FICO® Xpress Best Paper Award; the algorithm is now in FICO® Xpress Solver “When solving a very large computational problem, ...

The library sorting problem is used across computer science for organizing far more than just books. A new solution is less than a page-width away from the theoretical ideal. Computer scientists often ...

The proposed algorithm combines variational scheduling with post-processing to achieve near-optimal solutions to combinatorial optimization problems with constraints within the operation time of ...