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 ...
In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with matchings and cover many results, extending the fundamental results of matchings, ...
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 ...
This paper describes a greedy heuristic for a class of combinatorial optimization problems; a central feature of the method being a look-ahead capability. The power of the heuristic is demonstrated ...
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 ...
The financial world grows on managing risk, but the models used to calculate exposure—from market volatility to ...
A. P. Punnen, Discrete Mathematics and Graph Theory, (under preparation, Draft version available, 2024) A. P. Punnen, Introduction to Linear Algebra, (under ...
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