Metaheuristics for finding good Low Autocorrelation Binary Sequences.
-
Updated
Feb 26, 2019 - C
Metaheuristics for finding good Low Autocorrelation Binary Sequences.
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.
A collection of artificial intelligence studies and projects.
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.
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
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.
My solution to the machine works problem.
Optimal Assignment is a famous topic in Operational Research. This projects contains a C program implementing a command line app that finds the optimal assignment. Given a set of jobs and a set of candidates, we have to assign each candidate a job. Assigning a job to a candidate has a particular cost. The problem is to find the assignment that e…
Conversion of a given primal problem into its dual. Original repository found in https://github.com/bhowalsoham/CSE-550-Project.git
A fast, templated C++ header library for submodular optimization (subset selection) problems.
test the power of MIP solver on SAT problem.
Monte Carlo Tree Search applied to Combinatorial Search Problems
The repository contains the model schemas currently active on icepack-ai. The schemas are immutable and are all pushed to the api in the same manner (POST + long running GET for result). Check out the docs at https://docs.icepack.ai for more info.
Using Folium to interactively solve the traveling salesman problem using pin-pointed locations generated by user.
Feeder Routing for Air-to-Air Refueling Operations
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."