GitHub

divide-and-conquer-algorithms

C++ & Java implementations of 6 algorithm problems — tromino tiling, knight's tour, Tower of Hanoi (4-peg), knight swap, target shooting, and lattice coverage — using Divide & Conquer, Greedy, BFS, ...
GitHub

recursive-backtracking-algorithm

Programa que crea una estructura y recorre estrucutras de arbol, empleando recursividad. Ejercicio propuesto en el espacio académico de Estructura de Datos en el programa de Ing de Sistemas y ...
IEEE

Backtracking Search Algorithm based on Knowledge of Different Populations for Continuous Optimization Problems

Abstract: Backtracking search algorithm (BSA) has been applied to solve the various optimization problems in recent years. However, BSA is difficult to solve non-separable problems due to its single ...
IEEE

Backtracking Ant Colony Algorithm for the 0ߝ1 Knapsack Problem

Abstract: The 0ߝ1 Knapsack Problem is of a class of typical combinational optimization problems and is NP-hard. It has important practical significance to study it. Based on the characteristics of the ...