Axel Parmentier

Orcid: 0000-0003-1762-4947

According to our database1, Axel Parmentier authored at least 23 papers between 2014 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation.
Transp. Sci., May, 2023

Future memories are not needed for large classes of POMDPs.
Oper. Res. Lett., May, 2023

Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times.
Eur. J. Oper. Res., 2023

Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs.
CoRR, 2023

Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows.
CoRR, 2023

Learning-based Online Optimization for Autonomous Mobility-on-Demand Fleet Control.
CoRR, 2023

Explainable Data-Driven Optimization: From Context to Decision and Back Again.
Proceedings of the International Conference on Machine Learning, 2023

2022
Learning to Approximate Industrial Problems by Operations Research Classic Problems.
Oper. Res., 2022

Learning with Combinatorial Optimization Layers: a Probabilistic Approach.
CoRR, 2022

Robust Counterfactual Explanations for Random Forests.
CoRR, 2022

2021
Learning structured approximations of operations research problems.
CoRR, 2021

Learning to solve the single machine scheduling problem with release times and sum of completion times.
CoRR, 2021

Optimal Counterfactual Explanations in Tree Ensembles.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Integer Programming on the Junction Tree Polytope for Influence Diagrams.
INFORMS J. Optim., July, 2020

Shift Planning Under Delay Uncertainty at Air France: A Vehicle-Scheduling Problem with Outsourcing.
Transp. Sci., 2020

2019
Algorithms for non-linear and stochastic resource constrained shortest path.
Math. Methods Oper. Res., 2019

Two generalizations of Markov blankets.
CoRR, 2019

2017
A mathematical framework for delay analysis in single source networks.
Networks Heterog. Media, 2017

Learning When to Use a Decomposition.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2015
Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths.
CoRR, 2015

Solving the user equilibrium departure time problem at an off-ramp with incentive compatible cost functions.
Proceedings of the 14th European Control Conference, 2015

A mathematical framework for delay analysis in single source networks.
Proceedings of the American Control Conference, 2015

2014
Stochastic Shortest Paths and Risk Measures.
CoRR, 2014


  Loading...