You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The goal of the project was to design the logistic model of autonomous robots that would supply garment parts from the Cutting Dept to the Makeup Dept in the shortest time possible and using the most optimized path.
Generic Engine for Multi-disciplinary Scenarios, Exploration and Optimization. This is a MIRROR of our gitlab repository, the development activity and support happen over there.
Algorithm for solving the Hamiltonian cycle problem deterministically and in linear time on all instances of discocube graphs (tested for graphs with over 8 billion vertices). Discocube graphs are 3-dimensional grid graphs derived from: a polycube of an octahedron | a Hauy construction of an octahedron with cubes as identical building blocks...
Simple 9x9 Sudoku brute force solver with intrinsic parallel candidate set processing using bits to represent digits in the [1, 9] range, and bitwise operations to test a candidate against the candidate set, all at once.
User-friendly management system for graduation students at Brazilian public universities to optimise their choice of classes to take in the upcoming and following semesters, until they graduate.
This code has been used in the paper titled: "How Do Machine Learning Models Perform in Predicting the Solution Time for Optimization Problems? Case of Job Shop Scheduling Problem"