Projeto final desenvolvido no último ano para obtenção do diploma no Curso de Bachalerado em Ciência da Computação pela Unesp de Bauru.
-
Updated
Nov 23, 2019 - Python
Projeto final desenvolvido no último ano para obtenção do diploma no Curso de Bachalerado em Ciência da Computação pela Unesp de Bauru.
Solving the PDI problem in Julia with the Cplex package
Different algorithms for connecting stations in a piston bolt network
Some combinatorial optimization algorithms on graphs written in Julia.
Timetable solution for a real-world instance based on the MAX-MIN Ant System and Local Search.
Optimize multiple knapsack problem using reinforcement learning.
Modeling the Chinese Postman Problem in NetworkX and creating a graphical visualization of the Eulerian path/circuits that appear.
General-Valued Constraint Satisfaction Problems
He collects interesting papers which are included in research areas of him and shares them with you.
Data repository for the paper “Feasibility on the integration of passenger and freight transportation in rural areas: A service mode and an optimization model”.
Otimizações de build com GA, ES, BA, ACO para Genshin Impact (projeto de computação evolutiva 2021.2)
Мое решение задачи о рюкзаке (NP-полная задача комбинаторной оптимизации) двумя методами. Работа выполнена в качестве практики на втором курсе обучения. Первый метод реализует полный перебор с отсечением проигрышных ветвей (метод ветвей и границ). Второй метод позволяет найти псевдо-решение задачи с любой заданной точностью за полиномиальное вре…
Solution to a scheduling problem based on Google OR-Tools
Maximum Weight Two Stage Spanning Tree
simple Java implementation of nonogram solver based on constraint satisfaction programming using several heuristics
Implementing a Python-based project using computer vision to analyse a wooden beer bottle cap display (shaped like Germany), aiming to correlate bottle caps with their geographic references by minimizing spatial distances between map holes and physical locations.
This Java program defines two functions, howSum and improvedHowSum, to find a combination of numbers that add up to a given target sum, using a simple recursive approach and a more efficient recursive approach with memoization, respectively.
Solving Max-cut problems with Neural Network
Add a description, image, and links to the combinatorial-optimization topic page so that developers can more easily learn about it.
To associate your repository with the combinatorial-optimization topic, visit your repo's landing page and select "manage topics."