Pascal Benchimol
YOU?
Author Swipe
View article: What Tropical Geometry Tells Us about the Complexity of Linear Programming
What Tropical Geometry Tells Us about the Complexity of Linear Programming Open
International audience
View article: A Privacy-Preserving Method to Optimize Distributed Resource Allocation
A Privacy-Preserving Method to Optimize Distributed Resource Allocation Open
International audience
View article: A Privacy-preserving Method to Optimize Distributed Resource Allocation
A Privacy-preserving Method to Optimize Distributed Resource Allocation Open
We consider a resource allocation problem involving a large number of agents with individual constraints subject to privacy, and a central operator whose objective is to optimize a global, possibly nonconvex, cost while satisfying the agen…
View article: A Privacy-preserving Disaggregation Algorithm for Non-intrusive\n Management of Flexible Energy
A Privacy-preserving Disaggregation Algorithm for Non-intrusive\n Management of Flexible Energy Open
We consider a resource allocation problem involving a large number of agents\nwith individual constraints subject to privacy, and a central operator whose\nobjective is to optimizing a global, possibly non-convex, cost while satisfying\nth…
View article: A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy
A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy Open
We consider a resource allocation problem involving a large number of agents with individual constraints subject to privacy, and a central operator whose objective is to optimizing a global, possibly non-convex, cost while satisfying the a…
View article: Resource constrained shortest path algorithm for EDF short-term thermal production planning problem
Resource constrained shortest path algorithm for EDF short-term thermal production planning problem Open
Unit commitment problem on an electricity network consists in choosing the production plan of the plants (units) of a company in order to meet demand constraints. It is generally solved using a decomposition approach where demand constrain…
View article: Log-Barrier Interior Point Methods Are Not Strongly Polynomial
Log-Barrier Interior Point Methods Are Not Strongly Polynomial Open
We prove that primal-dual log-barrier interior point methods are not strongly\npolynomial, by constructing a family of linear programs with $3r+1$\ninequalities in dimension $2r$ for which the number of iterations performed is\nin $\\Omega…
View article: Tropicalizing the Simplex Algorithm
Tropicalizing the Simplex Algorithm Open
We develop a tropical analog of the simplex algorithm for linear programming.\nIn particular, we obtain a combinatorial algorithm to perform one tropical\npivoting step, including the computation of reduced costs, in O(n(m+n)) time,\nwhere…