Code for " Discovering topically- and temporally-coherent events in interaction networks" ECML PKDD 2016
-
Updated
May 9, 2016 - JavaScript
Code for " Discovering topically- and temporally-coherent events in interaction networks" ECML PKDD 2016
This was a project case study on examination scheduling at the TU Munich
МФТИ, ФИВТ, 2017 год, 4 семестр, дискретная оптимизация, coding track.
Optimization framework based on swarm intelligence
Solving and GUI demonstration of traditional N-Queens Problem using Hill Climbing, Simulated Annealing, Local Beam Search, and Genetic Algorithm.
Discrete Asian Option Pricing for GPUs
Knapsack, Graph Coloring, Vehicle Routing Problems of Discrete Optimization Course from Master of Computer Engineering Department in Istanbul Technical University
FPBH: A Feasibility Pump based Heuristic for Multi-objective Mixed Integer Linear Programming
Generator of best schedules for my Uncle's workers
Homework of course "Discrete Optimization"
river crossing puzzle
second cycle first semester
Using the OR-Tools optimization suite to beat the Skyscraper game
Choco solver Kotlin extensions
Low-variance, efficient and unbiased gradient estimation for optimizing models with binary latent variables. (ICLR 2019)
Formulating the prioritisation question as a 'knapsack problem'
Add a description, image, and links to the discrete-optimization topic page so that developers can more easily learn about it.
To associate your repository with the discrete-optimization topic, visit your repo's landing page and select "manage topics."