A5076935029- Risk and Portfolio Optimization
- Optimization and Mathematical Programming
- Advanced Optimization Algorithms Research
- Optimization and Variational Analysis
- Economic theories and models
- Supply Chain and Inventory Management
- Optimization and Packing Problems
- Fuzzy Systems and Optimization
- Optimization and Search Problems
- Advanced Graph Theory Research
- Model Reduction and Neural Networks
- Game Theory and Voting Systems
- Scheduling and Optimization Algorithms
- Complexity and Algorithms in Graphs
- Vehicle Routing Optimization Methods
- Probabilistic and Robust Engineering Design
- Game Theory and Applications
- Multi-Criteria Decision Making
- Decision-Making and Behavioral Economics
- Neural Networks and Applications
- Traffic control and management
- Water resources management and optimization
- Advanced Control Systems Optimization
- Transportation Planning and Optimization
- graph theory and CDMA systems
Laboratoire des signaux et systèmes
2018-2025
CentraleSupélec
2021-2024
Université Paris-Saclay
2011-2024
Centre National de la Recherche Scientifique
2022-2024
Laboratoire de Recherche en Informatique
2011-2020
Université Paris-Sud
2011-2020
Université Paris Cité
2008-2017
Badji Moktar-Annaba University
2012
Linköping University
2012
Orange (France)
2001-2008
This paper considers a distributionally robust version of quadratic knapsack problem. In this model, subsets items is selected to maximizes the total profit while requiring that set constraints be satisfied with high probability. contrast stochastic programming problem, we assume only part information on random data known, i.e., first and second moment variables, their joint support, possibly an independence assumption. As for binary constraints, special interest given corresponding...
Abstract In this article, a mixed integer bilevel problem having probabilistic knapsack constraint in the first level is proposed. The formulation mainly motivated by practical pricing and service provision problems as it can be interpreted model for interaction between provider customers. A discrete probability space assumed which allows reformulation of an equivalent deterministic problem. further transformed into linear problem, turn yields quadratic optimization namely global...
Multicommodity network flow models arise in a wide variety of contexts, typical among which is the dimensioning telecommunication networks. In this paper, we present various approaches based on specialization simplex algorithm and interior-point methods to solve nonoriented multicommodity flowproblems. Algorithms are tested with data from France-Telecom Paris district transmission network. First, focus for node-arc formulation problem. A Primal Dual Affine Scaling algorithms exploiting...