Eduardo Moreno

CoRR, 2024

2023

Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs.

[BibT_eX]

[DOI]

Cristian Ramirez-Pico

Ivana Ljubic

Transp. Sci., September, 2023

2022

Convex envelopes for ray-concave functions.

[BibT_eX]

[DOI]

Gonzalo Muñoz

Optim. Lett., 2022

Exact reliability optimization for series-parallel graphs using convex envelopes.

[BibT_eX]

[DOI]

Networks, 2022

Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse.

[BibT_eX]

[DOI]

Cristian Ramirez-Pico

Math. Program., 2022

2020

Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach.

[BibT_eX]

[DOI]

Orlando Rivera Letelier

Oper. Res., 2020

Practical performance of an open pit mine scheduling model considering blending and stockpiling.

[BibT_eX]

[DOI]

Mojtaba Rezakhah

Alexandra M. Newman

Comput. Oper. Res., 2020

A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case.

[BibT_eX]

[DOI]

Sebastián Varas K.

Ann. Oper. Res., 2020

2019

On the Marshall-Olkin Copula Model for Network Reliability Under Dependent Failures.

[BibT_eX]

[DOI]

IEEE Trans. Reliab., 2019

2018

Outer approximation and submodular cuts for maximum capture facility location problems with random utilities.

[BibT_eX]

[DOI]

Ivana Ljubic

Eur. J. Oper. Res., 2018

Computing and maximizing the exact reliability of wireless backhaul networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2018

A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling.

[BibT_eX]

[DOI]

Orlando Rivera Letelier

Comput. Optim. Appl., 2018

2017

Linear models for stockpiling in open-pit mine production scheduling problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2017

Traffic engineering in segment routing networks.

[BibT_eX]

[DOI]

Alejandra Beghelli

Filippo Cugini

Comput. Networks, 2017

2016

Availability-driven optimal design of shared path protection in WDM networks.

[BibT_eX]

[DOI]

Marco Tarifeño-Gajardo

Alejandra Beghelli

Networks, 2016

Chance-constrained problems and rare events: an importance sampling approach.

[BibT_eX]

[DOI]

Tito Homem-de-Mello

Bernardo K. Pagnoncelli

Gianpiero Canessa

Math. Program., 2016

A branch-and-bound algorithm for the maximum capture problem with random utilities.

[BibT_eX]

[DOI]

Wilfredo F. Yushimito

Eur. J. Oper. Res., 2016

Calibrating a dependent failure model for computing reliabilities in telecommunication networks.

[BibT_eX]

[DOI]

Proceedings of the Winter Simulation Conference, 2016

Calibrating a Dependent Failure Model for Computing Reliabilites on Telecommunication Networks.

[BibT_eX]

[DOI]

Proceedings of the II Spring School on Networks 2016, 2016

2015

Topological optimization of reliable networks under dependent failures.

[BibT_eX]

[DOI]

Héctor Cancela

Oper. Res. Lett., 2015

Restricted risk measures and robust optimization.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

The precedence constrained knapsack problem: Separating maximally violated inequalities.

[BibT_eX]

[DOI]

Daniel G. Espinoza

Marcos Goycoolea

Discret. Appl. Math., 2015

Corrigendum to "On the theorem of Fredricksen and Maiorana about de Bruijn sequences" [Adv. in Appl. Math. 33 (2) (2004) 413-415].

[BibT_eX]

[DOI]

Dominique Perrin

Adv. Appl. Math., 2015

2014

Solving the maximum edge biclique packing problem on unbalanced bipartite graphs.

[BibT_eX]

[DOI]

Vicente Acuña

Carlos Eduardo Ferreira

Discret. Appl. Math., 2014

A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs.

[BibT_eX]

[DOI]

Daniel G. Espinoza

Comput. Optim. Appl., 2014

2013

MineLib: a library of open pit mining problems.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2013

2012

An integer linear programming approach for bilinear integer programming.

[BibT_eX]

[DOI]

Juan Pablo Vielma

Oper. Res. Lett., 2012

A New Algorithm for the Open-Pit Mine Production Scheduling Problem.

[BibT_eX]

[DOI]

Oper. Res., 2012

Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone.

[BibT_eX]

[DOI]

Vicente Acuña

Pilu Crescenzi

Carlos Eduardo Ferreira

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Large-scale multi-period precedence constrained knapsack problem: A mining application.

[BibT_eX]

[DOI]

Daniel G. Espinoza

Marcos Goycoolea

Electron. Notes Discret. Math., 2010

The biclique k-clustering problem in bipartite graphs and its application in bioinformatics.

[BibT_eX]

[DOI]

Vicente Acuña

Carlos Eduardo Ferreira

Electron. Notes Discret. Math., 2010

2009

Minimum Eulerian circuits and minimum de Bruijn sequences.

[BibT_eX]

[DOI]

Discret. Math., 2009

2006

Minimal Eulerian Circuit in a Labeled Digraph.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

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

[BibT_eX]

[DOI]

PhD thesis, 2005

De Bruijn sequences and De Bruijn graphs for a general language.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

Minimal Eulerian trail in a labeled digraph

[BibT_eX]

[DOI]

CoRR, 2005

2004

Dynamic of cyclic automata over Z<sup>2</sup> .

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

On the theorem of Fredricksen and Maiorana about de Bruijn sequences.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

Minimal de Bruijn Sequence in a Language with Forbidden Substrings.

[BibT_eX]

[DOI]