Overview of the C&CG method. by Tianhe Sun (21145341)

Subjects:

Results on solving TSS using different evolutionary and greedy algorithms. by Alexander Andreev (16822333)

“…<p>Results on solving TSS using different evolutionary and greedy algorithms.…”

Solving flow chart of the IBBPSO algorithm. by Kuiyuan Pan (21145338)

Subjects:

Comparison of planning results for different uncertainty quantification methods. by Tianhe Sun (21145341)

Subjects:

Metaheuristic algorithms for solving DNA-related problems. by Eslam Hamouda (5172083)

An instance of the IPP that can be solved by applying the algorithms for the DPP. by Jordan Moutet (21800145)

Compare topologies when using the WOA algorithm to solve the RNP problem by different methods. by Le Huu Binh (18340233)

Subjects:

Compare topologies when using the MVO algorithm to solve the RNP problem by different methods. by Le Huu Binh (18340233)

Subjects:

Using the descent direction in a method of centres algorithm for solving multi-objective programming problems by A. H. Dehmiry (21337839)

The method for determining the chemical constituents of unknown materials in the algorithm. by Dong Hyeok Choi (12562048)

Solving the multi-commodity flow problem using an evolutionary routing algorithm in a computer network environment by Noel Farrugia (19945083)

Convergence plots for solving TSS for SNAP networks. by Alexander Andreev (16822333)

Pareto front representations obtained by solving the BIOBJ problem using the ROSE algorithm and the NBI algorithm, as well as a visualization of the solution process of the ROSE algorithm in the objective space. by Ihab Hashem (21156806)

The optimized sensor coverage using the MODBO algorithm. by Wenxing Wu (16853002)

The parameters of algorithms. by Le Huu Binh (18340233)

Subjects:

Pareto frontier solution solving process. by Yuhang Wang (332111)

“…The improved NSGA-II algorithm is used to solve the Pareto front efficiently, and the search efficiency is improved by the elite reservation strategy and the congestion adaptive adjustment mechanism. …”

Present an algorithm to prove P = NP by Sang-un Lee (22242148)

“…NP problem, a long-standing challenge in computer science, we present a novel deterministic algorithm that solves the Hamiltonian path problem, a representative NP-complete problem, in polynomial time. …”

Example measurement and analysis units for landscape elements. by Jaewon Han (8660295)

Results on solving TSS using (1 + 1)-WEA_v3 with different values of <i>Q.</i> by Alexander Andreev (16822333)

The flowchart for model solving process. by Tianhe Sun (21145341)

“…In this paper, the column and constraint generation algorithm and strong duality theory are used to decompose the original problem into the linearized master problem and subproblem, which can improve the solving speed. …”