TheoGuyard/mcrdv
Multi-chaser rendezvous planning software
Postdoctoral Researcher at Polytechnique Montréal, Canada
Repositories
TheoGuyard/l0exp
TheoGuyard/TheoGuyard.github.io
TheoGuyard/phd-summary
TheoGuyard/ilp-oracles
This repository provides compact representation oforacles that can be efficiently queried to retrieve optimal solutions to integer linear programs.
TheoGuyard/cv
TheoGuyard/treeco
Treeco: Efficient Decision Policies for Combinatorial Optimization via Linear Decision Trees
TheoGuyard/l0bnb
Solves the best subset selection problem
TheoGuyard/LIBSVMdata.jl
A simple tool to fetch LIBSVM datasets to Julia
TheoGuyard/El0ps
El0ps: An Exact L0-Problem Solver
TheoGuyard/ExpRun
Automatized python pipelines to run reproducible experiments.
TheoGuyard/code_2022_ICASSP_ScreenAndRelax
TheoGuyard/TheoGuyard
Config files for my GitHub profile.
TheoGuyard/El0ps.jl
An Exact L0-penalized Problem Solver.
TheoGuyard/course_2024_ENSAI_UE-1-07-Optimization
TheoGuyard/course_2023_INSA_DMA09-PARCI
TheoGuyard/course_2022_INSA_DMA09-PARCI
TheoGuyard/course_2022_INSA_DMA06-OD
TheoGuyard/course_2022_INSA_STP03-ALG3
TheoGuyard/course_2022_INSA_MathC2plus
TheoGuyard/course_2023_INSA_DMA06-OD
Discrete Optimization project for DMA06-OD course at INSA Rennes.
TheoGuyard/poster_2024-07-24_ICML_Node-screening
TheoGuyard/benchmark_sparse_support_recovery
Benchopt benchmark for sparse support recovery problems.
TheoGuyard/BnbPeeling.jl
A Branch-and-Bound solver for L0-penalized problems with Big-M constraint implementing the Peeling methodology.
TheoGuyard/BnbScreening.jl
A Branch-and-Bound solver for L0-penalized problems with Big-M constraint implementing Node-Screening tests.
TheoGuyard/StochasticKEP.jl
Stochastic model for Kidney Exchange Programs