Minimal de Bruijn Sequence in a Language with Forbidden Substrings. - Eduardo Moreno 001; Martín Matamala (WG, 2004)

On the theorem of Fredricksen and Maiorana about de Bruijn sequences. - Eduardo Moreno 001 (Adv. Appl. Math., 2004)

Dynamic of cyclic automata over Z2 . - Martín Matamala; Eduardo Moreno 001 (Theor. Comput. Sci., 2004)

Minimal Eulerian trail in a labeled digraph - Martín Matamala; Eduardo Moreno 001 (CoRR, 2005)

De Bruijn sequences and De Bruijn graphs for a general language. - Eduardo Moreno 001 (Inf. Process. Lett., 2005)

Graphes et cycles de de Bruijn dans des langages avec des restrictions. (De Bruijn graphs and sequences in languages with restrictions). - Eduardo Moreno 001 (2005)

Minimal Eulerian Circuit in a Labeled Digraph. - Eduardo Moreno 001; Martín Matamala (LATIN, 2006)

Minimum Eulerian circuits and minimum de Bruijn sequences. - Martín Matamala; Eduardo Moreno 001 (Discret. Math., 2009)

The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. - Vicente Acuña; Carlos Eduardo Ferreira; Alexandre S. Freire; Eduardo Moreno 001 (Electron. Notes Discret. Math., 2010)

Large-scale multi-period precedence constrained knapsack problem: A mining application. - Eduardo Moreno 001; Daniel G. Espinoza; Marcos Goycoolea (Electron. Notes Discret. Math., 2010)

Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty. - Guido Lagos; Daniel G. Espinoza; Eduardo Moreno 001; Jorge Amaya (Electron. Notes Discret. Math., 2011)

Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. - Alexandre S. Freire; Vicente Acuña; Pilu Crescenzi; Carlos Eduardo Ferreira; Vincent Lacroix; Paulo Vieira Milreu; Eduardo Moreno 001; Marie-France Sagot (ISCO, 2012)

A New Algorithm for the Open-Pit Mine Production Scheduling Problem. - Renaud Chicoisne; Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Enrique Rubio (Oper. Res., 2012)

An integer linear programming approach for bilinear integer programming. - Alexandre S. Freire; Eduardo Moreno 001; Juan Pablo Vielma (Oper. Res. Lett., 2012)

MineLib: a library of open pit mining problems. - Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Alexandra M. Newman (Ann. Oper. Res., 2013)

A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs. - Daniel G. Espinoza; Eduardo Moreno 001 (Comput. Optim. Appl., 2014)

Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. - Vicente Acuña; Carlos Eduardo Ferreira; Alexandre S. Freire; Eduardo Moreno 001 (Discret. Appl. Math., 2014)

Corrigendum to "On the theorem of Fredricksen and Maiorana about de Bruijn sequences" [Adv. in Appl. Math. 33 (2) (2004) 413-415]. - Eduardo Moreno 001; Dominique Perrin (Adv. Appl. Math., 2015)

The precedence constrained knapsack problem: Separating maximally violated inequalities. - Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001 (Discret. Appl. Math., 2015)

Restricted risk measures and robust optimization. - Guido Lagos; Daniel G. Espinoza; Eduardo Moreno 001; Juan Pablo Vielma (Eur. J. Oper. Res., 2015)

Topological optimization of reliable networks under dependent failures. - Javiera Barrera; Héctor Cancela 001; Eduardo Moreno 001 (Oper. Res. Lett., 2015)

Calibrating a Dependent Failure Model for Computing Reliabilites on Telecommunication Networks. - Omar Matus; Javiera Barrera; Eduardo Moreno 001; Gerardo Rubino (SSN, 2016)

Calibrating a dependent failure model for computing reliabilities in telecommunication networks. - Omar Matus; Javiera Barrera; Eduardo Moreno 001; Gerardo Rubino (WSC, 2016)

A branch-and-bound algorithm for the maximum capture problem with random utilities. - Alexandre S. Freire; Eduardo Moreno 001; Wilfredo F. Yushimito (Eur. J. Oper. Res., 2016)

Chance-constrained problems and rare events: an importance sampling approach. - Javiera Barrera; Tito Homem-de-Mello; Eduardo Moreno 001; Bernardo K. Pagnoncelli; Gianpiero Canessa (Math. Program., 2016)

Availability-driven optimal design of shared path protection in WDM networks. - Marco Tarifeño-Gajardo; Alejandra Beghelli; Eduardo Moreno 001 (Networks, 2016)

Traffic engineering in segment routing networks. - Eduardo Moreno 001; Alejandra Beghelli; Filippo Cugini (Comput. Networks, 2017)

Linear models for stockpiling in open-pit mine production scheduling problems. - Eduardo Moreno 001; Mojtaba Rezakhah; Alexandra M. Newman; Felipe Ferreira (Eur. J. Oper. Res., 2017)

A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling. - Gonzalo Muñoz 001; Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Maurice Queyranne; Orlando Rivera Letelier (Comput. Optim. Appl., 2018)

Computing and maximizing the exact reliability of wireless backhaul networks. - David Coudert; James R. Luedtke; Eduardo Moreno 001; Konstantinos Priftis (Electron. Notes Discret. Math., 2018)

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. - Ivana Ljubic; Eduardo Moreno 001 (Eur. J. Oper. Res., 2018)

On the Marshall-Olkin Copula Model for Network Reliability Under Dependent Failures. - Omar Matus; Javiera Barrera; Eduardo Moreno 001; Gerardo Rubino (IEEE Trans. Reliab., 2019)

A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case. - Javiera Barrera; Eduardo Moreno 001; Sebastián Varas K. (Ann. Oper. Res., 2020)

Practical performance of an open pit mine scheduling model considering blending and stockpiling. - Mojtaba Rezakhah; Eduardo Moreno 001; Alexandra M. Newman (Comput. Oper. Res., 2020)

Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach. - Orlando Rivera Letelier; Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Gonzalo Muñoz 001 (Oper. Res., 2020)

Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse. - Cristian Ramirez-Pico; Eduardo Moreno 001 (Math. Program., 2022)

Exact reliability optimization for series-parallel graphs using convex envelopes. - Javiera Barrera; Eduardo Moreno 001; Gonzalo Muñoz 001; Pablo Romero (Networks, 2022)

Convex envelopes for ray-concave functions. - Javiera Barrera; Eduardo Moreno 001; Gonzalo Muñoz 001 (Optim. Lett., 2022)

Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. - Cristian Ramirez-Pico; Ivana Ljubic; Eduardo Moreno 001 (Transp. Sci., 2023)

An incremental exact algorithm for the hyper-rectangular clustering problem with axis-parallel clusters. - Diego Delle Donne; Javier Marenco; Eduardo Moreno 001 (CoRR, 2024)

Optimizing steel coil production schedules under continuous casting and hot rolling. - Nelson Torres; Gus Greivel; Joshua Betz; Eduardo Moreno 001; Alexandra M. Newman; Brian G. Thomas (Eur. J. Oper. Res., 2024)