Graph algorithms and combinatorial optimisation form a pivotal area of research that underpins many modern computational applications. At their core, graph algorithms provide systematic methods for ...
The Journal of the Operational Research Society, Vol. 55, No. 7, Part Special Issue: Local Search (Jul., 2004), pp. 705-716 (12 pages) The Bin Packing Problem and the Cutting Stock Problem are two ...
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 ...
Proper market segmentation schemes should address not only how to develop feasible schemes of homogeneous market segments within designated managerial, institutional, and environmental restrictions, ...
I am a Professor in the Department of Computer Science at California State University, Sacramento (CSUS). I joined CSUS in 2015. I obtained my Ph.D in Computer Science from the University of ...
A. P. Punnen, Discrete Mathematics and Graph Theory, (under preparation, Draft version available, 2024) A. P. Punnen, Introduction to Linear Algebra, (under ...
Xinyun Wu: Post-doctoral Fellow during 2017-2018. Currently works at Hubei University of Technology as Assistant Professor in Computer Science. His research interests include design and analysis of ...
Recently, a research team from the Rudolf Technology Center in Slovenia proposed a new method to optimize the sparse subgraph problem, which has wide applications in fields such as network analysis ...
Combinatorial optimisation algorithms are central to addressing problems in which the goal is to select an optimal solution from a finite set of alternatives. These algorithms have evolved ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback