Exact and meta-heuristic algorithms for NP problems
-
Updated
Oct 28, 2019 - Python
Exact and meta-heuristic algorithms for NP problems
Analyze the combine with and without the repetition. (SOON)
This repository contains assignments completed in the course "Convex Optimisation" using python
Identical machines scheduling, minimizing the makespan
Tensorflow implementation of an Actor Critic algorithm using a Pointer Network to solve the TSP (algorithm from Neural Combinatorial Optimization with Reinforcement Learning, Bello et al, 2016)
Add a description, image, and links to the combinational-optimization topic page so that developers can more easily learn about it.
To associate your repository with the combinational-optimization topic, visit your repo's landing page and select "manage topics."