Optimization problems as a research area encompass the theoretical and algorithmic study of selecting the best solution from a feasible set according to one or more objective functions, under possibly complex constraints. This area includes continuous, discrete, combinatorial, mixed-integer, and stochastic optimization, as well as convex and nonconvex formulations. Research focuses on problem modeling, structural analysis, and the design and analysis of exact, approximate, and heuristic algorithms, including gradient-based methods, interior-point methods, cutting-plane and branch-and-bound techniques, and metaheuristics. It also investigates computational complexity, convergence guarantees, and performance bounds, often motivated by applications in engineering, operations research, data science, and economics.
For years, Rutgers physicist David Shih solved Rubik's Cubes with his children, twisting the colorful squares until the scrambled puzzle returned to order. He didn't expect the toy to connect to his research, but recently ...
General Physics
Apr 8, 2026
2
81
Animal survival depends on effective attack and defense strategies, yet how these behaviors arise remains unclear. Addressing this question, a recent study shows that predator and prey behaviors emerge naturally as stable ...
Ecology
Jan 22, 2026
0
38
Optimal packing problems have inspired mathematicians for centuries. Biophysicists now add a layer to the question: How do chloroplasts arrange themselves optimally within cells, when the meaning of "optimal" changes over ...
Plants & Animals
Oct 23, 2025
0
17
A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as arranging telecommunications, ...
Quantum Physics
Aug 23, 2025
0
439
Recent advances in computational protein design have depended mainly on neural networks and machine learning to generate binders. However, the complexity of protein–protein interactions and the limitations of data-driven ...
Biotechnology
Jul 30, 2025
0
27
The natural protein universe is vast, and yet, going beyond and designing new proteins not observed in nature can yield new functions and can solve problems in medicine or materials science. The past few years have marked ...
Biotechnology
Jul 23, 2025
0
19
Researchers have determined how to use magnons—collective vibrations of the magnetic spins of atoms—for next-generation information technologies, including quantum technologies with magnetic systems.
Condensed Matter
Jun 12, 2025
0
101
A quantum computer can solve optimization problems faster than classical supercomputers, a process known as "quantum advantage" and demonstrated by a USC researcher in a paper recently published in Physical Review Letters.
Quantum Physics
Apr 30, 2025
0
307
Pioneering new research could help unlock exciting new potential to create ultrafast, laser-driven storage devices. The study, led by experts from the University of Exeter, could revolutionize the field of data storage through ...
Nanophysics
Mar 27, 2025
0
82
Quantum systems hold the promise of tackling some complex problems faster and more efficiently than classical computers. Despite their potential, so far only a limited number of studies have conclusively demonstrated that ...
