default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel G. Espinoza
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j19]Orlando Rivera Letelier
, Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Gonzalo Muñoz:
Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach. Oper. Res. 68(5): 1425-1444 (2020)
2010 – 2019
- 2018
- [j18]Gonzalo Muñoz, Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Maurice Queyranne, Orlando Rivera Letelier:
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling. Comput. Optim. Appl. 69(2): 501-534 (2018) - [j17]Renaud Chicoisne, Fernando Ordóñez, Daniel G. Espinoza:
Risk Averse Shortest Paths: A Computational Study. INFORMS J. Comput. 30(3): 539-553 (2018) - 2015
- [j16]Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno:
The precedence constrained knapsack problem: Separating maximally violated inequalities. Discret. Appl. Math. 194: 65-80 (2015) - [j15]Guido Lagos, Daniel G. Espinoza, Eduardo Moreno, Juan Pablo Vielma:
Restricted risk measures and robust optimization. Eur. J. Oper. Res. 241(3): 771-782 (2015) - 2014
- [j14]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) - 2013
- [j13]Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Alexandra M. Newman:
MineLib: a library of open pit mining problems. Ann. Oper. Res. 206(1): 93-114 (2013) - [j12]Vasek Chvátal, William J. Cook, Daniel G. Espinoza:
Local cuts for mixed-integer programming. Math. Program. Comput. 5(2): 171-200 (2013) - 2012
- [j11]Renaud Chicoisne, Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Enrique Rubio:
A New Algorithm for the Open-Pit Mine Production Scheduling Problem. Oper. Res. 60(3): 517-528 (2012) - 2011
- [j10]Guido Lagos, Daniel G. Espinoza, Eduardo Moreno, Jorge Amaya:
Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty. Electron. Notes Discret. Math. 37: 15-20 (2011) - 2010
- [j9]Eduardo Moreno, Daniel G. Espinoza, Marcos Goycoolea:
Large-scale multi-period precedence constrained knapsack problem: A mining application. Electron. Notes Discret. Math. 36: 407-414 (2010) - [j8]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem. Math. Oper. Res. 35(2): 479-493 (2010) - [j7]Daniel G. Espinoza:
Computing with multi-row Gomory cuts. Oper. Res. Lett. 38(2): 115-120 (2010) - [j6]Daniel G. Espinoza, Ricardo Fukasawa, Marcos Goycoolea:
Lifting, tilting and fractional programming revisited. Oper. Res. Lett. 38(6): 559-563 (2010)
2000 – 2009
- 2009
- [j5]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37(1): 11-15 (2009) - 2008
- [j4]Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model. Transp. Sci. 42(3): 263-278 (2008) - [j3]Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. Transp. Sci. 42(3): 279-291 (2008) - [c2]Daniel G. Espinoza:
Computing with Multi-row Gomory Cuts. IPCO 2008: 214-224 - 2007
- [j2]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP). INFORMS J. Comput. 19(3): 356-365 (2007) - [j1]David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza:
Exact solutions to linear programming problems. Oper. Res. Lett. 35(6): 693-699 (2007) - 2006
- [b1]Daniel G. Espinoza:
On Linear Programming, Integer Programming and Cutting Planes. Georgia Institute of Technology, Atlanta, GA, USA, 2006 - 2005
- [c1]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea:
A Study of Domino-Parity and k-Parity Constraints for the TSP. IPCO 2005: 452-467
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-10-07 22:11 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:
