A5087966660- Risk and Portfolio Optimization
- Optimization and Mathematical Programming
- Vehicle Routing Optimization Methods
- Advanced Optical Network Technologies
- Supply Chain and Inventory Management
- Advanced Manufacturing and Logistics Optimization
- Scheduling and Optimization Algorithms
- Network Traffic and Congestion Control
- Software-Defined Networks and 5G
- Optimization and Packing Problems
- Facility Location and Emergency Management
- Optimization and Search Problems
- Quantum Computing Algorithms and Architecture
- Transportation Planning and Optimization
- Multi-Criteria Decision Making
- Advanced Optimization Algorithms Research
- Smart Grid Energy Management
- Probabilistic and Robust Engineering Design
- Electric Power System Optimization
- Capital Investment and Risk Analysis
- Mobile Ad Hoc Networks
- Advanced Graph Theory Research
- Process Optimization and Integration
- Computability, Logic, AI Algorithms
- Sustainable Supply Chain Management
Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
2015-2024
Centre National de la Recherche Scientifique
2014-2023
Computer Algorithms for Medicine
2015-2023
Université de Montpellier
2015-2023
Société Nationale des Chemins de Fer Français (France)
2022
General Motors (United States)
2019-2020
Kiel University
2019
Heuristics and Diagnostics for Complex Systems
2009-2018
University of Maryland, College Park
2018
Polytechnic University
2018
Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing minimum weight set edges so that induced subgraph contains at least K edge-disjoint paths containing most L between each pair in Q. Using layered representation introduced by Gouveia [Gouveia, L. 1998. variable redefinition for computing lower bounds spanning Steiner trees hop constraints. INFORMS J. Comput. 10(2) 180–188], present formulation valid any K, ≥ 1. We use Benders decomposition...
Abstract Affinely Adjustable Robust Counterparts provide tractable alternatives to (two‐stage) robust programs with arbitrary recourse. Following Ouorou and Vial, we apply them network design polyhedral demand uncertainty, introducing the notion of affine routing. We compare new routing scheme well‐studied static dynamic schemes for design. It is shown that can be seen as a generalization widely used while still being providing cheaper solutions. investigate properties polytope under which...
We explore a multiple-stage variant of the min-max robust selection problem with budgeted uncertainty that includes queries. First, one queries subset items and gets exact values their uncertain parameters. Given this information, can then choose set to be selected, still facing on unobserved In paper, we study two specific variants problem. The first considers objective focuses selecting single item. second constraint instead, which means some selected may fail. show both problems are...
Common approaches to solving a robust optimization problem decompose the into master (MP) and adversarial problems (APs). The MP contains original constraints, written, however, only for finite numbers of scenarios. Additional scenarios are generated on fly by APs. We consider in this work budgeted uncertainty polytope from Bertsimas Sim, widely used literature, propose new dynamic programming algorithms solve APs that based maximum number deviations allowed size deviations. Our can be...
Capacitated vehicle routing problems are widely studied combinatorial optimization problems, and branch-and-cut-and-price algorithms can solve instances harder than ever before. These models, however, neglect that demands volumes often not known with precision when planning the routes, thus incentivizing decision makers to significantly overestimate for avoiding coping infeasible routes. A robust formulation models demand uncertainty through a knapsack polytope is considered. new algorithm...
We study the robust constrained shortest path problem under resource uncertainty. After proving that is in strong sense for arbitrary uncertainty sets, we focus on budgeted sets introduced by Bertsimas and Sim (2003) their extension to variable Poss (2013). apply classical techniques show with capacity constraints can be solved pseudopolynomial time. However, prove time windows when not fixed, using a reduction from independent set problem. introduce then new labels yield dynamic programming...
Flow thinning (FT) is a concept of traffic routing and protection strategy applicable to communication networks with variable capacity links. In such networks, the links do not attain their nominal (maximum) simultaneously, so in typical network state only some are fully available whereas on each remaining fraction its maximum usable. Every end-to-end demand assigned set logical tunnels whose total dedicated carry demand’s traffic. The (i.e., maximum) tunnels, supported by link capacity,...
Due to large-scale applications and services, cloud computing infrastructures are experiencing an ever-increasing demand for resources. At the same time, overall power consumption of data centers has been rising beyond 1% worldwide electricity consumption. The usage renewable energy in contributes decreasing their carbon footprint costs. Several green-energy-aware resource allocation approaches have studied recently. None them takes advantage joint migration <italic...