aim-benmhamed Goto Github PK

aim_hpc_handson

branch-search-trees

Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies (AAAI 2021)

branchandbound_integerprogramming

Simple implementation of the branch and bound algorithm for solving integer programming problems

bus-router

bus-router creates a shapes.txt file for stop_times.txt using the Google Maps Directions API.

cocktails

🍹Branch and bound solution using Rust to calculate an optimal cocktail ingredient list of arbitrary length 🍸

cupdlp-c

Code for solving LP on GPU using first-order methods

dagger

Reinforcement Learning -- Imitation Learning, Behavior Cloning, DAgger (Data Aggregation)

di-engine

OpenDILab Decision AI Engine

did_django_google_maps_api

DID Coding web app that uses Django web framework and Googles Maps API to retrieve directions and distance between 2 geo points

django-google-maps

Using the Google Maps API with django model admin

ftsp

Methods to solve fuzzy traveling salesman problems.

gdrl

Grokking Deep Reinforcement Learning

googlemapsapiscanner

Scan Google Maps Api Keys and see which services you can use. Original codebase from ozguralp/gmapsapiscanner

imitation

Clean PyTorch implementations of imitation and reward learning algorithms

imitation-learning

Imitation learning algorithms

improvedpnb

This repository contains the code used to perform comparisons of the peel-and-bound method and the branch-and-bound method. Details about both algorithms and their implementations can be found in the paper: Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams

inv_rl

Inverse Reinforcement Learning Argorithms

inverse-reinforcement-learning

Implementations of selected inverse reinforcement learning algorithms.

iq-learn

(NeurIPS '21 Spotlight) IQ-Learn: Inverse Q-Learning for Imitation

irl-imitation

Implementation of Inverse Reinforcement Learning (IRL) algorithms in python/Tensorflow. Deep MaxEnt, MaxEnt, LPIRL

irl_rocks

Cool Inverse Reinforcement Learning Papers

learn2branch

Exact Combinatorial Optimization with Graph Convolutional Neural Networks (NeurIPS 2019)

learn2comparenodes

Learning to Compare Nodes in Branch and Bound with Graph Neural Networks (NeurIPS 2022)

lets-do-irl

Inverse RL algorithms (APP, MaxEnt, GAIL, VAIL)

lippy

A module for solving linear programming problems on Python.

location-based-food-delivery-service-using-python-and-google-maps-apis

miplearn

Framework for solving discrete optimization problems using a combination of Mixed-Integer Linear Programming (MIP) and Machine Learning (ML)

ngsim_env

Learning human driver models from NGSIM data with imitation learning.

optimization-methods

Python implementations of Simplex Method, Branch and Bound, Gomory's Cutting Plane Method, Iterative: Steepest Gradient Descent, Newton's Method

pnb_sop

This repository contains the code used to perform comparisons of the peel-and-bound method and the branch-and-bound method. Details about both algorithms and their implementations can be found in the paper: Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams