The following pages link to Alfredo Candia-Véjar (Q337032):
Displaying 8 items.
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- The multiple team formation problem using sociometry (Q342525) (← links)
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- Deterministic risk control for cost-effective network connections (Q621844) (← links)
- (Q1179755) (redirect page) (← links)
- An approach for the Steiner problem in directed graphs (Q1179756) (← links)
- Minmax regret combinatorial optimization problems: an Algorithmic Perspective (Q4917217) (← links)
- Improved robust shortest paths by penalized investments (Q5001425) (← links)
