📔 This repository is for storing my Higher Mathematics learning journey
-
Updated
May 23, 2024
📔 This repository is for storing my Higher Mathematics learning journey
📔 This repository contains tasks related to learning Optimisation algorithms
PyJackson:Implementation of a mathematical model in Python to solve an assignment problem in Job Shop environments. With its respective Gantt chart.
Differentiable Programming Algorithms in Modern C++
This is MOPSO, a multiobjective particle swarm optimisation under uncertainty toolbox.
NUBO is a Bayesian optimisation framework for the optimisation of expensive-to-evaluate black-box functions developed by the Fluid Dynamics Lab at Newcastle University.
The aim of this Python project is to circularize a plasmid by optimizing the values of a table calculating the plasmid's 3D trajectory. To achieve this, 2 algorithms are used and compared: simulated annealing and genetic algorithm.
It a project on classification of species of snake into venomous and non-venomous using a Deep learning model. This repository consists of whole journey from using CNN to using transfer learning with MobileNetV2 as pre trained model
L’algorithme d’Uzawa est une méthode d’optimisation pour résoudre des problèmes de minimisation sous contraintes linéaires.
RWH optimisation using advanced OR techniques. Project built during national finals of Smart India Hackathon 2019. Team Six Nearest Neighbors. For AM2, Goldman Sachs.
Application of genetic algorithm in feature selection.
An attempt to create an optimized F1 calendar to cut down unnecessary travelling back and forth between continents during a F1 season.
This project aims to display any function R -> R or R^2 -> R and to compare different gradient descent methods to find the minimum of this function in a visual way.
This repository attempts to find team configuration, work size, team member capacity and backlog order that delivers work at the lowest lead time possible.
A novel socio-inspired optimisation technique
An exact algorithm for difficulty and high coordinate Euclidean diversity problems
A quick template for branch and price prototypes
A structured and quick-to-implement template for your branch and bound prototypes!
a small, self-contained implementation of the BFGS algorithm with line-search
This repository contains files for an empty packaging dispatching problem using heuristic algorithms
Add a description, image, and links to the optimisation-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the optimisation-algorithms topic, visit your repo's landing page and select "manage topics."