toggle visibility Search & Display Options

Select All    Deselect All
 | 
Citations
 | 
   print
Allende, H., Bravo, D., & Canessa, E. (2010). Robust design in multivariate systems using genetic algorithms. Qual. Quant., 44(2), 315–332.
toggle visibility
Alvarez-Miranda, E., & Pereira, J. (2017). Designing and constructing networks under uncertainty in the construction stage: Definition and exact algorithmic approach. Comput. Oper. Res., 81, 178–191.
toggle visibility
Araujo, J., Ducoffe, G., Nisse, N., & Suchan, K. (2018). On interval number in cycle convexity. Discret. Math. Theor. Comput. Sci., 20(1), 35 pp.
toggle visibility
Aylwin, R., Silva-Oelker, G., Jerez-Hanckes, C., & Fay, P. (2020). Optimization methods for achieving high diffraction efficiency with perfect electric conducting gratings. J Opt Soc Am A, 37(8), 1316–1326.
toggle visibility
Barrera, J., Moreno, E., & Varas, S. (2020). A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case. Ann. Oper. Res., 286(1-2), 545–557.
toggle visibility
Canessa, E., & Chaigneau, S. (2015). Calibrating Agent-Based Models Using a Genetic Algorithm. Stud. Inform. Control, 24(1), 79–90.
toggle visibility
Canessa, E., Droop, C., & Allende, H. (2012). An improved genetic algorithm for robust design in multivariate systems. Qual. Quant., 46(2), 665–678.
toggle visibility
Canessa, E., Vera, S., & Allende, H. (2012). A new method for estimating missing values for a genetic algorithm used in robust design. Eng. Optimiz., 44(7), 787–800.
toggle visibility
Carrasco, R. A., Iyengar, G., & Stein, C. (2018). Resource cost aware scheduling. Eur. J. Oper. Res., 269(2), 621–632.
toggle visibility
Dumett, M. A., & Cominetti, R. (2018). On The Stability Of An Adaptive Learning Dynamics In Traffic Games. J. Dyn. Games, 5(4), 265–282.
toggle visibility
Fernandez, C., Valle, C., Saravia, F., & Allende, H. (2012). Behavior analysis of neural network ensemble algorithm on a virtual machine cluster. Neural Comput. Appl., 21(3), 535–542.
toggle visibility
Goles, E., & Montealegre, P. (2020). The complexity of the asynchronous prediction of the majority automata. Inform. Comput., to appear.
toggle visibility
Liedloff, M., Montealegre, P., & Todinca, I. (2019). Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica, 81(3), 986–1005.
toggle visibility
Ortiz, C., & Villanueva, M. (2012). Maximal independent sets in caterpillar graphs. Discret Appl. Math., 160(3), 259–266.
toggle visibility
Pereira, J., Ritt, M., & Vasquez, O. C. (2018). A memetic algorithm for the cost-oriented robotic assembly line balancing problem. Comput. Oper. Res., 99, 249–261.
toggle visibility
Select All    Deselect All
 | 
Citations
 | 
   print