The following pages link to Rafael Andrade (Q325400):
Displaying 13 items.
- Models for minimum cost dominating trees (Q325401) (← links)
- (Q702476) (redirect page) (← links)
- Telecommunication network capacity design for uncertain demand (Q702479) (← links)
- B\&B frameworks for the capacity expansion of high speed telecommunication networks under uncertainty (Q817201) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- Multi-service multi-facility network design under uncertainty (Q1761754) (← links)
- Minimum linear arrangements (Q2413151) (← links)
- Using Lagrangian dual information to generate degree constrained spanning trees (Q2489896) (← links)
- On the Finite Optimal Convergence of Logic-Based Benders’ Decomposition in Solving 0–1 Min-Max Regret Optimization Problems with Interval Costs (Q2835657) (← links)
- Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models (Q3115997) (← links)
- ARITHMETIC MEAN BASED COMPENSATORY FUZZY LOGIC (Q3173440) (← links)
- Stochastic maximum weight forest problem (Q4565761) (← links)
