toggle visibility Search & Display Options

Select All    Deselect All
 | 
Citations
 | 
   print
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
Alvarez-Miranda, E., & Pereira, J. (2019). On the complexity of assembly line balancing problems. Comput. Oper. Res., 108, 182–186.
toggle visibility
Averbakh, I., & Pereira, J. (2021). Tree optimization based heuristics and metaheuristics in network construction problems. Comput. Oper. Res., 128, 105190.
toggle visibility
Azar, M., Carrasco, R. A., & Mondschein, S. (2021). Dealing with Uncertain Surgery Times in Operating Room Scheduling. Eur. J. Oper. Res., Early Access.
toggle visibility
Barrera, J., Cancela, H., & Moreno, E. (2015). Topological optimization of reliable networks under dependent failures. Oper. Res. Lett., 43(2), 132–136.
toggle visibility
Barrera, J., Carrasco, R. A., Mondschein, S., Canessa, G., & Rojas-Zalazar, D. (2020). Operating room scheduling under waiting time constraints: the Chilean GES plan. Ann. Oper. Res., 286(1-2), 501–527.
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
Carrasco, R. A., Iyengar, G., & Stein, C. (2018). Resource cost aware scheduling. Eur. J. Oper. Res., 269(2), 621–632.
toggle visibility
Chicoisne, R., Espinoza, D., Goycoolea, M., Moreno, E., & Rubio, E. (2012). A New Algorithm for the Open-Pit Mine Production Scheduling Problem. Oper. Res., 60(3), 517–528.
toggle visibility
Colini-Baldeschi, R., Cominetti, R., Mertikopoulos, P., & Scarsini, M. (2020). When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic. Oper. Res., 68(2), 411–434.
toggle visibility
Cominetti, R., Correa, J., & Olver, N. (2021). Long-Term Behavior of Dynamic Equilibria in Fluid Networks. Oper. Res., Early Access.
toggle visibility
de Mateo, F., Coelli, T., & O'Donnell, C. (2006). Optimal paths and costs of adjustment in dynamic DEA models: with application to chilean department stores. Ann. Oper. Res., 145(1), 211–227.
toggle visibility
Espinoza, D., Goycoolea, M., Moreno, E., & Newman, A. (2013). MineLib: a library of open pit mining problems. Ann. Oper. Res., 206(1), 93–114.
toggle visibility
Freire, A. S., Moreno, E., & Vielma, J. P. (2012). An integer linear programming approach for bilinear integer programming. Oper. Res. Lett., 40(2), 74–77.
toggle visibility
Freire, A. S., Moreno, E., & Yushimito, W. F. (2016). A branch-and-bound algorithm for the maximum capture problem with random utilities. Eur. J. Oper. Res., 252(1), 204–212.
toggle visibility
Gonzalez, E., & Villena, M. (2011). Spatial Lanchester models. Eur. J. Oper. Res., 210(3), 706–715.
toggle visibility
Gonzalez, E., Epstein, L. D., & Godoy, V. (2012). Optimal number of bypasses: minimizing cost of calls to wireless phones under Calling Party Pays. Ann. Oper. Res., 199(1), 179–191.
toggle visibility
Lagos, G., Espinoza, D., Moreno, E., & Vielma, J. P. (2015). Restricted risk measures and robust optimization. Eur. J. Oper. Res., 241(3), 771–782.
toggle visibility
Lespay, H., & Suchan, K. (2021). A case study of consistent vehicle routing problem with time windows. Int. Trans. Oper. Res., 28, 1135–1163.
toggle visibility
Letelier, O. R., Espinoza, D., Goycoolea, M., Moreno, E., & Munoz, G. (2020). Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach. Oper. Res., 68(5), 1425–1444.
toggle visibility
Select All    Deselect All
 | 
Citations
 | 
   print