default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAxel Parmentier
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Louis Bouvier
, Guillaume Dalle, Axel Parmentier, Thibaut Vidal:
Solving a Continent-Scale Inventory Routing Problem at Renault. Transp. Sci. 58(1): 131-151 (2024)- [j10]Nour El Houda Tellache, Frédéric Meunier, Axel Parmentier:
Linear Lexicographic Optimization and Preferential Bidding System. Transp. Sci. 58(3): 597-613 (2024) - [j9]Léo Baty, Kai Jungel, Patrick S. Klein, Axel Parmentier, Maximilian Schiffer:
Combinatorial Optimization-Enriched Machine Learning to Solve the Dynamic Vehicle Routing Problem with Time Windows. Transp. Sci. 58(4): 708-725 (2024) - [c8]Alexandre Forel, Axel Parmentier, Thibaut Vidal:
Don't Explain Noise: Robust Counterfactuals for Randomized Ensembles. CPAIOR (1) 2024: 293-309 - [c7]Francesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel Parmentier:
Predicting Lagrangian Multipliers for Mixed Integer Linear Programs. ICML 2024 - [c6]Germain Vivier-Ardisson, Alexandre Forel, Axel Parmentier, Thibaut Vidal:
CF-OPT: Counterfactual Explanations for Structured Prediction. ICML 2024 - [i14]Germain Vivier-Ardisson, Alexandre Forel, Axel Parmentier, Thibaut Vidal:
CF-OPT: Counterfactual Explanations for Structured Prediction. CoRR abs/2405.18293 (2024) - [i13]Pierre-Cyril Aubin-Frankowski, Yohann De Castro, Axel Parmentier, Alessandro Rudi:
Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems. CoRR abs/2407.17200 (2024) - 2023
- [j8]Axel Parmentier, Vincent T'kindt:
Structured learning based heuristics to solve the single machine scheduling problem with release times and sum of completion times. Eur. J. Oper. Res. 305(3): 1032-1041 (2023) - [j7]Victor Cohen, Axel Parmentier:
Future memories are not needed for large classes of POMDPs. Oper. Res. Lett. 51(3): 270-277 (2023) - [j6]Axel Parmentier, Rafael Martinelli, Thibaut Vidal:
Electric Vehicle Fleets: Scalable Route and Recharge Scheduling Through Column Generation. Transp. Sci. 57(3): 631-646 (2023) - [c5]Alexandre Forel, Axel Parmentier, Thibaut Vidal:
Explainable Data-Driven Optimization: From Context to Decision and Back Again. ICML 2023: 10170-10187 - [i12]Alexandre Forel, Axel Parmentier, Thibaut Vidal:
Explainable Data-Driven Optimization: From Context to Decision and Back Again. CoRR abs/2301.10074 (2023) - [i11]Kai Jungel, Axel Parmentier, Maximilian Schiffer, Thibaut Vidal:
Learning-based Online Optimization for Autonomous Mobility-on-Demand Fleet Control. CoRR abs/2302.03963 (2023) - [i10]Léo Baty, Kai Jungel, Patrick S. Klein, Axel Parmentier, Maximilian Schiffer:
Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows. CoRR abs/2304.00789 (2023) - [i9]Francesco Demelas, Joseph Le Roux, Mathieu Lacroix, Axel Parmentier:
Predicting Accurate Lagrangian Multipliers for Mixed Integer Linear Programs. CoRR abs/2310.14659 (2023) - 2022
- [j5]Axel Parmentier:
Learning to Approximate Industrial Problems by Operations Research Classic Problems. Oper. Res. 70(1): 606-623 (2022) - [i8]Alexandre Forel, Axel Parmentier, Thibaut Vidal:
Robust Counterfactual Explanations for Random Forests. CoRR abs/2205.14116 (2022) - [i7]Guillaume Dalle, Léo Baty, Louis Bouvier, Axel Parmentier:
Learning with Combinatorial Optimization Layers: a Probabilistic Approach. CoRR abs/2207.13513 (2022) - 2021
- [c4]Axel Parmentier, Thibaut Vidal:
Optimal Counterfactual Explanations in Tree Ensembles. ICML 2021: 8422-8431 - [i6]Axel Parmentier, Vincent T'kindt:
Learning to solve the single machine scheduling problem with release times and sum of completion times. CoRR abs/2101.01082 (2021) - [i5]Axel Parmentier, Thibaut Vidal:
Optimal Counterfactual Explanations in Tree Ensembles. CoRR abs/2106.06631 (2021) - [i4]Axel Parmentier:
Learning structured approximations of operations research problems. CoRR abs/2107.04323 (2021) - 2020
- [j4]Axel Parmentier, Victor Cohen, Vincent Leclère, Guillaume Obozinski, Joseph Salmon:
Integer Programming on the Junction Tree Polytope for Influence Diagrams. INFORMS J. Optim. 2(3): 209-228 (2020) - [j3]Julie Poullet, Axel Parmentier:
Shift Planning Under Delay Uncertainty at Air France: A Vehicle-Scheduling Problem with Outsourcing. Transp. Sci. 54(4): 956-972 (2020)
2010 – 2019
- 2019
- [j2]Axel Parmentier:
Algorithms for non-linear and stochastic resource constrained shortest path. Math. Methods Oper. Res. 89(2): 281-317 (2019) - [i3]Victor Cohen, Axel Parmentier:
Two generalizations of Markov blankets. CoRR abs/1903.03538 (2019) - 2017
- [j1]Samitha Samaranayake, Axel Parmentier, Ethan Xuan, Alexandre M. Bayen:
A mathematical framework for delay analysis in single source networks. Networks Heterog. Media 12(1): 113-145 (2017) - [c3]Markus Kruber, Marco E. Lübbecke, Axel Parmentier:
Learning When to Use a Decomposition. CPAIOR 2017: 202-210 - 2015
- [c2]Axel Parmentier, Samitha Samaranayake, Yiguang Xuan, Alexandre M. Bayen:
A mathematical framework for delay analysis in single source networks. ACC 2015: 4603-4609 - [c1]Samitha Samaranayake, Axel Parmentier, Yiguang Xuan, Alexandre M. Bayen:
Solving the user equilibrium departure time problem at an off-ramp with incentive compatible cost functions. ECC 2015: 3465-3471 - [i2]Axel Parmentier:
Algorithms for Non-Linear and Stochastic Resource Constrained Shortest Paths. CoRR abs/1504.07880 (2015) - 2014
- [i1]Axel Parmentier, Frédéric Meunier:
Stochastic Shortest Paths and Risk Measures. CoRR abs/1408.0272 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
