A collection of open-source projects on the Traffic Assignment Problem
-
Updated
Sep 11, 2023
A collection of open-source projects on the Traffic Assignment Problem
Mitigating epidemic spread with mobility network modeling
Code for the paper: Wirth, E.S. and Pokutta, S., 2022, May. Conditional gradients for the approximately vanishing ideal. In International Conference on Artificial Intelligence and Statistics (pp. 2191-2209). PMLR.
This project solves the Maximum Clique Problem using continuous optimization algorithms like Projected Gradient Descent and Frank-Wolfe, implemented in a Jupyter Notebook.
The project involves a practical optimization problem that is modelled and solved using some mathematical optimization methods and software.
Project developed during the course of 'Optimization for Data Science' in the University of Padua. The project provides an Implementation of Frank-Wolfe Methods for Recommender Systems in Python.
Add a description, image, and links to the frank-wolfe-method topic page so that developers can more easily learn about it.
To associate your repository with the frank-wolfe-method topic, visit your repo's landing page and select "manage topics."