Unlike single objective optimization algorithm, solving multi-objective problem (MOP) is a complex task. The solution of a multi-objective optimization problem is a set of solutions, called the Pareto ...

C++ template library for high performance SIMD based sorting routines for built-in integers and floats (16-bit, 32-bit and 64-bit data types) and custom defined C++ objects. The sorting routines are ...

Sorting algorithms are an essential chapter in undergraduate computer science education. Due to their easy to explain nature and fairly straight-forward analysis, this set of algorithms offers a ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

Synthetically considering such factors as grade of concentrate, output of concentrate, concentration-ratio and capacity of buffer storage, we establish multi-objective programming model based on ...