The following pages link to Eduardo Álvarez-Miranda (Q296862):
Displaying 30 items.
- Single-commodity robust network design problem: complexity, instances and heuristic solutions (Q296864) (← links)
- (Q337031) (redirect page) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- (Q403431) (redirect page) (← 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)
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach (Q1652235) (← links)
- Lagrangian and branch-and-cut approaches for upgrading spanning tree problems (Q1652284) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- A bi-objective network design approach for discovering functional modules linking Golgi apparatus fragmentation and neuronal death (Q1699920) (← links)
- A multicriteria optimization model for sustainable forest management under climate change uncertainty: an application in Portugal (Q1744484) (← links)
- Solving minimum-cost shared arborescence problems (Q1751722) (← links)
- An exact solution framework for the minimum cost dominating tree problem (Q1800452) (← links)
- An exact solution framework for the multiple gradual cover location problem (Q2003421) (← links)
- On the complexity of assembly line balancing problems (Q2003432) (← links)
- Exact and heuristic algorithms for the weighted total domination problem (Q2027027) (← links)
- The generalized reserve set covering problem with connectivity and buffer requirements (Q2029278) (← links)
- Multicriteria saliency detection: a (exact) robust network design approach (Q2178371) (← links)
- A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem (Q2329685) (← links)
- Exact approaches for solving robust prize-collecting Steiner tree problems (Q2355891) (← links)
- A note on the Bertsimas \& Sim algorithm for robust combinatorial optimization problems (Q2441360) (← links)
- Optimal Upgrading Schemes for Effective Shortest Paths in Networks (Q2815128) (← links)
- The Recoverable Robust Two-Level Network Design Problem (Q2942678) (← links)
- Models and Algorithms for Robust Network Design with Several Traffic Scenarios (Q3167631) (← links)
- Vulnerability Assessment of Spatial Networks: Models and Solutions (Q3195353) (← links)
- Minmax regret combinatorial optimization problems: an Algorithmic Perspective (Q4917217) (← links)
- Analysis of the simple assembly line balancing problem complexity (Q6047869) (← links)
- A note on computational aspects of the Steiner traveling salesman problem (Q6066594) (← links)
