Refine by Content Type

Refine by Product

Refine by Time Frame

image thumbnail

updated 2 years ago

Genetic Algorithm for n-queen problem by Swapnil Marathe

N-queen generalized genetic algorithm. Parameters can be changed and tested (n queen problem, 8 queen problem, genetic)

n_queen_problem_genetic_algo_display.m

n_queen_problem_genetic_algo_without_display.m

image thumbnail

updated 3 years ago

Dynamic Programming solution to the TSP by Elad Kivelevitch

This function solves the Traveling Salesman Problem (TSP) using Dynamic programming (DP). (optimization, tsp, dynamic programming)

[OptimalTour,mincost]=tsp_dp1(cities, Dmatrix)

image thumbnail

updated 3 years ago

Knapsack problem by Pradeep

solved the knapsack problem using the concept of dynamic programming (knapsack, dynamic programming, optimization)

knapsackori.m

image thumbnail

updated almost 6 years ago

0-1 Knapsack by Petter

Solves the 0-1 knapsack problem with positive integer weights. (knapsack, dynamic programming, 01 knapsack)

knapsack_demo

knapsack(weights, values, W)

image thumbnail

updated 6 years ago

Dynamic Programming solver for The bridge crossing problem by Gianluca Dorini

The bridge crossing problem is here modelled and solved as undiscounted Dynamic Programming problem. (optimization, dynamic programming)

image thumbnail

updated 7 years ago

Dijkstra's Shortest Path Algorithm by Joseph Kirk

calculates the shortest path and distance between two nodes on a map (dijkstra, shortest path, shortest distance)

dijkstra(nodes,segments,start_id,finish_id)

Contact us