The following pages link to Cécile Murat (Q235680):
Displaying 32 items.
- New models for the robust shortest path problem: complexity, resolution and generalization (Q367636) (← links)
- (Q496633) (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)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts (Q1357776) (← links)
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
- The probabilistic minimum dominating set problem (Q1686054) (← links)
- On the probabilistic min spanning tree problem (Q1935723) (← 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)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- (Q2865853) (← links)
- Recourse problem of the 2-stage robust location transportation problem (Q2883563) (← links)
- (Q3059326) (← links)
- (Q3059327) (← links)
- (Q3061962) (← links)
- Probabilistic Combinatorial Optimization on Graphs (Q3426051) (← links)
- Linear programming with interval right hand sides (Q3566454) (← links)
- Best and Worst Optimum for Linear Programs with Interval Right Hand Sides (Q3627684) (← links)
- The probabilistic longest path problem (Q4254356) (← links)
- (Q4258251) (← links)
- (Q4452994) (← links)
- The Probabilistic Minimum Vertex-covering Problem (Q4532541) (← links)
- (Q4865402) (← links)
- The Probabilistic Min Dominating Set Problem (Q4928494) (← links)
- Robustness and duality in linear programming (Q4929854) (← links)
- Vertex-Uncertainty in Graph-Problems (Q5505652) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902534) (← links)
- A priori optimization for the probabilistic maximum independent set problem (Q5958320) (← links)
- Approximating the probabilistic \(p\)-center problem under pressure (Q6621850) (← links)
