default search action
Eduardo Moreno 0001
Person information
- affiliation: Adolfo Ibáñez University, Faculty of Engineering and Sciences, Santiago, Chile
- affiliation (PhD 2005): University of Paris-Est Marne-la-Vallée, France
Other persons with the same name
- Eduardo Moreno 0002 — Institute of Cybernetics, Mathematics and Physics (ICIMAF), Havana, Cuba
- Eduardo Moreno 0003 — University of Huelva, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]Nelson Torres
, Gus Greivel
Optimizing steel coil production schedules under continuous casting and hot rolling. Eur. J. Oper. Res. 314(2): 496-508 (2024) - 2023
- [j32]Cristian Ramirez-Pico, Ivana Ljubic
Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. Transp. Sci. 57(5): 1252-1275 (2023) - 2022
- [j31]Cristian Ramirez-Pico, Eduardo Moreno
Generalized adaptive partition-based method for two-stage stochastic linear programs with fixed recourse. Math. Program. 196(1): 755-774 (2022) - [j30]Javiera Barrera
Exact reliability optimization for series-parallel graphs using convex envelopes. Networks 80(2): 235-248 (2022) - [j29]Javiera Barrera
Convex envelopes for ray-concave functions. Optim. Lett. 16(8): 2221-2240 (2022) - 2020
- [j28]Javiera Barrera
A decomposition algorithm for computing income taxes with pass-through entities and its application to the Chilean case. Ann. Oper. Res. 286(1): 545-557 (2020) - [j27]Mojtaba Rezakhah
Practical performance of an open pit mine scheduling model considering blending and stockpiling. Comput. Oper. Res. 115: 104638 (2020) - [j26]Orlando Rivera Letelier
Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach. Oper. Res. 68(5): 1425-1444 (2020)
2010 – 2019
- 2019
- [j25]Omar Matus, Javiera Barrera
On the Marshall-Olkin Copula Model for Network Reliability Under Dependent Failures. IEEE Trans. Reliab. 68(2): 451-461 (2019) - 2018
- [j24]Gonzalo Muñoz
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling. Comput. Optim. Appl. 69(2): 501-534 (2018) - [j23]David Coudert, James R. Luedtke, Eduardo Moreno
Computing and maximizing the exact reliability of wireless backhaul networks. Electron. Notes Discret. Math. 64: 85-94 (2018) - [j22]Ivana Ljubic
Outer approximation and submodular cuts for maximum capture facility location problems with random utilities. Eur. J. Oper. Res. 266(1): 46-56 (2018) - 2017
- [j21]Eduardo Moreno
Traffic engineering in segment routing networks. Comput. Networks 114: 23-31 (2017) - [j20]Eduardo Moreno
Linear models for stockpiling in open-pit mine production scheduling problems. Eur. J. Oper. Res. 260(1): 212-221 (2017) - 2016
- [j19]Alexandre S. Freire, Eduardo Moreno
A branch-and-bound algorithm for the maximum capture problem with random utilities. Eur. J. Oper. Res. 252(1): 204-212 (2016) - [j18]Javiera Barrera
Chance-constrained problems and rare events: an importance sampling approach. Math. Program. 157(1): 153-189 (2016) - [j17]Marco Tarifeño-Gajardo, Alejandra Beghelli, Eduardo Moreno
Availability-driven optimal design of shared path protection in WDM networks. Networks 68(3): 224-237 (2016) - [c5]Omar Matus, Javiera Barrera, Eduardo Moreno, Gerardo Rubino:
Calibrating a Dependent Failure Model for Computing Reliabilites on Telecommunication Networks. SSN 2016: 28-31 - [c4]Omar Matus, Javiera Barrera
Calibrating a dependent failure model for computing reliabilities in telecommunication networks. WSC 2016: 490-500 - 2015
- [j16]Eduardo Moreno
Corrigendum to "On the theorem of Fredricksen and Maiorana about de Bruijn sequences" [Adv. in Appl. Math. 33 (2) (2004) 413-415]. Adv. Appl. Math. 62: 184-187 (2015) - [j15]Daniel G. Espinoza, Marcos Goycoolea
The precedence constrained knapsack problem: Separating maximally violated inequalities. Discret. Appl. Math. 194: 65-80 (2015) - [j14]Guido Lagos
Restricted risk measures and robust optimization. Eur. J. Oper. Res. 241(3): 771-782 (2015) - [j13]Javiera Barrera
Topological optimization of reliable networks under dependent failures. Oper. Res. Lett. 43(2): 132-136 (2015) - 2014
- [j12]Daniel G. Espinoza, Eduardo Moreno
A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs. Comput. Optim. Appl. 59(3): 617-638 (2014) - [j11]Vicente Acuña, Carlos Eduardo Ferreira
Solving the maximum edge biclique packing problem on unbalanced bipartite graphs. Discret. Appl. Math. 164: 2-12 (2014) - 2013
- [j10]Daniel G. Espinoza, Marcos Goycoolea
MineLib: a library of open pit mining problems. Ann. Oper. Res. 206(1): 93-114 (2013) - 2012
- [j9]Renaud Chicoisne
A New Algorithm for the Open-Pit Mine Production Scheduling Problem. Oper. Res. 60(3): 517-528 (2012) - [j8]Alexandre S. Freire, Eduardo Moreno
An integer linear programming approach for bilinear integer programming. Oper. Res. Lett. 40(2): 74-77 (2012) - [c3]Alexandre S. Freire, Vicente Acuña, Pilu Crescenzi
Minimum Ratio Cover of Matrix Columns by Extreme Rays of Its Induced Cone. ISCO 2012: 165-177 - 2011
- [j7]Guido Lagos
Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty. Electron. Notes Discret. Math. 37: 15-20 (2011) - 2010
- [j6]Vicente Acuña, Carlos Eduardo Ferreira, Alexandre S. Freire, Eduardo Moreno
The biclique k-clustering problem in bipartite graphs and its application in bioinformatics. Electron. Notes Discret. Math. 36: 159-166 (2010) - [j5]Eduardo Moreno
Large-scale multi-period precedence constrained knapsack problem: A mining application. Electron. Notes Discret. Math. 36: 407-414 (2010)
2000 – 2009
- 2009
- [j4]Martín Matamala
Minimum Eulerian circuits and minimum de Bruijn sequences. Discret. Math. 309(17): 5298-5304 (2009) - 2006
- [c2]Eduardo Moreno
Minimal Eulerian Circuit in a Labeled Digraph. LATIN 2006: 737-744 - 2005
- [b1]Eduardo Moreno:
Graphes et cycles de de Bruijn dans des langages avec des restrictions. (De Bruijn graphs and sequences in languages with restrictions). University of Marne-la-Vallée, Marne la Vallée, France, 2005 - [j3]Eduardo Moreno
De Bruijn sequences and De Bruijn graphs for a general language. Inf. Process. Lett. 96(6): 214-219 (2005) - [i1]Martín Matamala, Eduardo Moreno:
Minimal Eulerian trail in a labeled digraph. CoRR abs/cs/0505036 (2005) - 2004
- [j2]Eduardo Moreno
On the theorem of Fredricksen and Maiorana about de Bruijn sequences. Adv. Appl. Math. 33(2): 413-415 (2004) - [j1]Martín Matamala
Dynamic of cyclic automata over Z2 . Theor. Comput. Sci. 322(2): 369-381 (2004) - [c1]Eduardo Moreno, Martín Matamala:
Minimal de Bruijn Sequence in a Language with Forbidden Substrings. WG 2004: 168-176
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 00:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: