vidalt Goto Github PK

followers: 289.0 following: 33.0 repos: 17.0 gists: 0.0

Name: Thibaut Vidal

Type: User

Company: Polytechnique Montréal

Bio: SCALE-AI Chair in Data-Driven Supply Chains at MAGI, Polytechnique Montréal. This page hosts codes from many collaborative projects in optimization and ML

Twitter: vidalthi

Location: Montréal

Blog: https://w1.cirrelt.ca/~vidalt/en/home-thibaut-vidal.html

Thibaut Vidal's Projects

assortativesbm

Source code of AC-DC-SBM, from "Assortative-Constrained Stochastic Block Models", Gribel, Vidal and Gendreau, ICPR 2020

ba-trees

Born-Again Tree Ensembles: Transforms a random forest into a single, minimal-size, tree with exactly the same prediction function in the entire feature space (ICML 2020).

decision-diagrams

Source code associated with the paper "Optimal Decision Diagrams for Classification", authored by A.M. Florio, P. Martins, M. Schiffer, T. Serra, and T. Vidal, presented at AAAI 2023

decision-trees

Simple greedy algorithm (CART limited to a fixed depth) for decision tree construction. Used for the course INF2980 (Metaheuristics) in PUC-Rio.

districting-routing

Source code associated with the paper "Deep Learning for Data-Driven Districting-and-Routing", authored by A. Ferraz, Q. Cappart, and T. Vidal

DRAFT : Dataset Reconstruction Attack From Trained ensembles. Source code associated with the paper "Trained Random Forests Completely Reveal your Dataset (ICML'24, forthcoming)" authored by Julien Ferry, Ricardo Fukasawa, Timothée Pascal, and Thibaut Vidal

hard-margin-svm

Code and data from the paper "Support Vector Machines with the Hard-Margin Loss: Optimal Training via Combinatorial Benders' Cuts" by I. Santana, B. Serrrano, M. Schiffer, and T. Vidal

hg-means

Source code associated to the paper "Gribel, D., & Vidal, T. (2019). HG-means: A scalable hybrid metaheuristic for minimum sum-of-squares clustering. Pattern Recognition, 88, 569-583."

hgs-carp

Hybrid Genetic Search for Arc Routing Problems. From "Node, edge, arc routing and turn penalties : Multiple problems - One neighborhood extension, Operations Research, 65(4), 2017", by Thibaut Vidal.

hgs-cvrp

Modern implementation of the hybrid genetic search (HGS) algorithm specialized to the capacitated vehicle routing problem (CVRP). This code also includes an additional neighborhood called SWAP*.

hgs-ssp

Code and data from the paper: "Mecler, J., Subramanian, A., & Vidal, T. (2021). A simple and effective hybrid genetic search for the job sequencing and tool switching problem. Computers & Operations Research, 127, 105153."

hgs-tdcarp

Source code associated with the paper: "Vidal, T., Martinelli, R., Pham, T. A., & Hà, M. H. (2021). Arc routing with time-dependent travel times and paths. Transportation Science."

influence-optimization

Code and data from the paper "Influence Optimization in Networks: New Formulations and Valid Inequalities", authored by V. Ferreira, A. Pessoa, and T. Vidal

ocean

OCEAN: Optimal Counterfactual Explanations in Tree Ensembles (ICML 2021)

optimal-sbm

This project contains the source code and data needed to reproduce all the experiments of the paper "Community Detection in the Stochastic Block Model by Mixed Integer Programming", authored by Breno Serrano and Thibaut Vidal

pdtsp

Code and data from the paper "Exponential-size neighborhoods for the pickup-and-delivery traveling salesman problem", authored by T. Pacheco, R. Martinelli, A. Subramanian, T. Toffolo, and T. Vidal

split-library

Library of Split algorithms, including the O(n) (linear time) algorithm for the CVRP, from "Vidal, Thibaut (2016). Technical note: Split algorithm in O(n) for the capacitated vehicle routing problem. Computers & Operations Research. 69, 40–47"

vidalt Goto Github PK

Thibaut Vidal's Projects

Recommend Projects

Recommend Topics

Recommend Org

Jobs