0505daniel
PhD student @kaist-comet / computational optimization / transportation / machine learning / quantum computing
KAISTDaejeon, Republic of Korea
Pinned Repositories
0505daniel.github.io
GitHub Page
BellmanFord.jl
[IE801B Homework Assignment 1] Modified Bellman-Ford Algorithm
dwave
To use D-wave LEAP
GA-EAX
A genetic algorithm using Edge Assembly Crossover for the traveling salesman problem
QUBRIC-
RegretAlgorithm_branch-and-bound
Regret Algorithm with Branch and bound Method
TSPDrone.jl
TSPDroneHGATAC.jl
A package that uses Hybrid Genetic Algorithm to solve any TSPD or FSTSP instance
concorde-easy-build
Fork of the Concorde TSP solver with an easier build procedure
TSPDrone.jl
0505daniel's Repositories
0505daniel/BellmanFord.jl
[IE801B Homework Assignment 1] Modified Bellman-Ford Algorithm
0505daniel/QUBRIC-
0505daniel/RegretAlgorithm_branch-and-bound
Regret Algorithm with Branch and bound Method
0505daniel/0505daniel.github.io
GitHub Page
0505daniel/TSPDrone.jl
0505daniel/dwave
To use D-wave LEAP
0505daniel/GA-EAX
A genetic algorithm using Edge Assembly Crossover for the traveling salesman problem
0505daniel/TSPDroneHGATAC.jl
A package that uses Hybrid Genetic Algorithm to solve any TSPD or FSTSP instance
0505daniel/TSPD-solver
Fork of "Vásquez, S. A., Angulo, G., & Klapp, M. A. (2021). An exact solution method for the TSP with drone based on decomposition. Computers & Operations Research, 127, 105127."