The following pages link to Virginie Gabrel (Q325421):
Displaying 27 items.
- Lower bounding techniques for DSATUR-based branch and bound (Q325423) (← links)
- New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
- (Q496631) (redirect page) (← links)
- Robust location transportation problems under uncertain demands (Q496635) (← links)
- Web services composition: complexity and models (Q499345) (← links)
- Portfolio optimization with \(pw\)-robustness (Q668953) (← links)
- Exact solution of multicommodity network optimization problems with general step cost functions (Q1306346) (← links)
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts (Q1357776) (← links)
- LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428) (← links)
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms (Q1388825) (← links)
- Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite (Q1598722) (← links)
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems (Q1866008) (← links)
- The multiple Steiner TSP with order constraints: complexity and optimization algorithms (Q2156919) (← links)
- A robust \(p\)-center problem under pressure to locate shelters in wildfire context (Q2195562) (← links)
- Recent advances in robust optimization: an overview (Q2256312) (← links)
- Strengthened 0-1 linear formulation for the daily satellite mission planning (Q2369977) (← links)
- MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover (Q2835669) (← links)
- Recourse problem of the 2-stage robust location transportation problem (Q2883563) (← links)
- (Q3059327) (← links)
- Multilayer Survivable Optical Network Design (Q3091499) (← links)
- Linear programming with interval right hand sides (Q3566454) (← links)
- Best and Worst Optimum for Linear Programs with Interval Right Hand Sides (Q3627684) (← links)
- (Q4452994) (← links)
- An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem (Q4565777) (← links)
- Integer programming formulations for the<i>k</i>-edge-connected 3-hop-constrained network design problem (Q4642425) (← links)
- Planification à moyen terme de la production d'un satellite défilant et ensembles stables (Q4846544) (← links)
- Robustness and duality in linear programming (Q4929854) (← links)
