Abstract: The Traveling Salesman Problem (TSP) is a classic discrete optimization problem that finds widespread application in logistics, route planning, and other fields. Although traditional ...

This title is part of a longer publication history. The full run of this journal will be searched. TITLE HISTORY A title history is the publication history of a journal and includes a listing of the ...

Abstract: A novel color image encryption algorithm based on dynamic deoxyribonucleic acid (DNA) encoding and chaos is presented. A three-neuron fractional-order discrete Hopfield neural network ...

The original version of this story appeared in Quanta Magazine. All of modern mathematics is built on the foundation of set theory, the study of how to organize abstract collections of objects. But in ...

Jan. 9, 2026 Stanford researchers have developed an AI that can predict future disease risk using data from just one night of sleep. The system analyzes detailed physiological signals, looking for ...

Modern mixed-integer programming solvers use the branch-and-cut framework, where cutting planes are added to improve the tightness of the linear programming (LP) relaxation, with the expectation that ...