Buscar

Mostrando ítems 1-8 de 8

Algorithms for the Minmax Regret Path problem with interval data

Perez-Galarce, Francisco; Candia-Vejar, Alfredo; Astudillo, Cesar; Bardeen, Matthew (2018)

Minmax regret combinatorial optimization problems: an Algorithmic Perspective

Candia-Vejar, A.; Alvarez-Miranda, E.; Maculan, N. (CAMBRIDGE UNIV PRESS, 2012)

Algoritmos electromagnéticos híbridos para la resolución de problemas de rutas por arcos

Muñoz Castro, Carlos José; Candia Véjar, Alfredo (Prof. Guía); Reinoso, Hernaldo (Prof. Guía); Bardeen, Matthew (Prof. Informante) (Universidad de Talca (Chile). Escuela de Ingenieria, 2016)

Algoritmos para el problema de diseño de rutas de vehículos con incertidumbre usando modelo Minmax Regret

Rojas Valdés, Pablo Ignacio; Candia Véjar, Alfredo (Prof. Guía) (Universidad de Talca (Chile). Escuela de Ingeniería, 2016)

Coordination and uncertainty in strategic network investment: case on the north seas grid

Konstantelos, Ioannis; Moreno Vieyra, Rodrigo; Strbac, Goran (Elsevier, 2017)

The notion of developing a transnational offshore grid in the North Sea has attracted considerable attention in the past years due to its potential for substantial capital savings and increased scope for cross-border trade, ...

Heurísticas para o problema de caminho mais curto robusto

Amadeu Almeida Coco (Universidade Federal de Minas GeraisUFMG, 2013-03-07)

The well-known Shortest Path problem (SP) consists in nding a shortest path from a source node s ∈ V to a destination node t ∈ V such that the total cost is minimized. However, several SP applications rely on ...

Mathematical modeling in decision making process under conditions of uncertainty in human resources training and development

Rotarescu, Eugen (SABER-ULAVenezuela, 2011)

Coverage reduction: a mathematical model

Obredor Baldovino, Thalia Patricia; Barcasnegras Moreno, Evis Alberto; Mercado Caruso, Nohora Nubia; Salas Navarro, Katherinne Paola (Journal of Advanced Manufacturing Systems, 2018)