default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Benchimol
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j8]Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig:
What Tropical Geometry Tells Us about the Complexity of Linear Programming. SIAM Rev. 63(1): 123-164 (2021)- [c4]Pascal Benchimol, Ahmed Amrani, Mostepha Khouadjia:
A Multi-Criteria Multi-Modal Predictive Trip Planner: Application on Paris Metropolitan Network. ISC2 2021: 1-4 - 2020
- [j7]Olivier Beaude, Pascal Benchimol, Stéphane Gaubert
, Paulin Jacquot, Nadia Oudjane:
A Privacy-Preserving Method to Optimize Distributed Resource Allocation. SIAM J. Optim. 30(3): 2303-2336 (2020)
2010 – 2019
- 2019
- [c3]Paulin Jacquot, Olivier Beaude, Pascal Benchimol, Stéphane Gaubert, Nadia Oudjane:
A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy. CDC 2019: 890-896 - [i3]Paulin Jacquot, Olivier Beaude, Pascal Benchimol, Stéphane Gaubert, Nadia Oudjane:
A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy. CoRR abs/1903.03053 (2019) - [i2]Olivier Beaude, Pascal Benchimol, Stéphane Gaubert, Paulin Jacquot, Nadia Oudjane:
A Privacy-preserving Method to Optimize Distributed Resource Allocation. CoRR abs/1908.03080 (2019) - 2018
- [j6]Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig:
Log-Barrier Interior Point Methods Are Not Strongly Polynomial. SIAM J. Appl. Algebra Geom. 2(1): 140-178 (2018) - 2015
- [j5]Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig:
Tropicalizing the Simplex Algorithm. SIAM J. Discret. Math. 29(2): 751-795 (2015) - 2014
- [j4]Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert, Michael Joswig:
Combinatorial Simplex Algorithms Can Solve Mean Payoff Games. SIAM J. Optim. 24(4): 2096-2117 (2014) - [c2]Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert:
The Tropical Shadow-Vertex Algorithm Solves Mean Payoff Games in Polynomial Time on Average. ICALP (1) 2014: 89-100 - [i1]Xavier Allamigeon, Pascal Benchimol, Stéphane Gaubert:
The tropical shadow-vertex algorithm solves mean payoff games in polynomial time on average. CoRR abs/1406.5433 (2014) - 2012
- [j3]Pascal Benchimol, Willem Jan van Hoeve, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher:
Improved filtering for weighted circuit constraints. Constraints An Int. J. 17(3): 205-233 (2012) - [j2]Pascal Benchimol, Guy Desaulniers, Jacques Desrosiers:
Stabilized dynamic constraint aggregation for solving set partitioning problems. Eur. J. Oper. Res. 223(2): 360-371 (2012) - 2011
- [j1]Mike Benchimol, Pascal Benchimol, Benoît Chappert, Arnaud de la Taille, Fabien Laroche, Frédéric Meunier, Ludovic Robinet:
Balancing the stations of a self service "bike hire" system. RAIRO Oper. Res. 45(1): 37-61 (2011) - 2010
- [c1]Pascal Benchimol, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher, Willem Jan van Hoeve:
Improving the Held and Karp Approach with Constraint Programming. CPAIOR 2010: 40-44
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 2025-01-09 13:07 CET 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:
