Daniel G. Espinoza

Publication Activity (10 Years)

Years Active: 2005-2020
Publications (10 Years): 5

Top Venues

Oper. Res.

Comput. Optim. Appl.

Ann. Oper. Res.

Discret. Appl. Math.

Georgia Institute of Technology, Atlanta, GA, USA (PHD)

Education History

Georgia Institute of Technology, Atlanta, GA, USA

PHD

Publications

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) (2020)
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) (2018)
Renaud Chicoisne, Fernando Ordóñez, Daniel G. Espinoza
Risk Averse Shortest Paths: A Computational Study. INFORMS J. Comput. 30 (3) (2018)
Guido Lagos, Daniel G. Espinoza, Eduardo Moreno, Juan Pablo Vielma
Restricted risk measures and robust optimization. Eur. J. Oper. Res. 241 (3) (2015)
Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno
The precedence constrained knapsack problem: Separating maximally violated inequalities. Discret. Appl. Math. 194 (2015)
Daniel G. Espinoza, Eduardo Moreno
A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs. Comput. Optim. Appl. 59 (3) (2014)
Vasek Chvátal, William J. Cook, Daniel G. Espinoza
Local cuts for mixed-integer programming. Math. Program. Comput. 5 (2) (2013)
Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Alexandra M. Newman
MineLib: a library of open pit mining problems. Ann. Oper. Res. 206 (1) (2013)
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) (2012)
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 (2011)
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycoolea
Large-scale multi-period precedence constrained knapsack problem: A mining application. Electron. Notes Discret. Math. 36 (2010)
Daniel G. Espinoza
Computing with multi-row Gomory cuts. Oper. Res. Lett. 38 (2) (2010)
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem. Math. Oper. Res. 35 (2) (2010)
Daniel G. Espinoza, Ricardo Fukasawa, Marcos Goycoolea
Lifting, tilting and fractional programming revisited. Oper. Res. Lett. 38 (6) (2010)
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) (2009)
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) (2008)
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) (2008)
Daniel G. Espinoza
Computing with Multi-row Gomory Cuts. IPCO (2008)
David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza
Exact solutions to linear programming problems. Oper. Res. Lett. 35 (6) (2007)
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP). INFORMS J. Comput. 19 (3) (2007)
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
A Study of Domino-Parity and k-Parity Constraints for the TSP. IPCO (2005)

Daniel G. Espinoza.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Daniel G. Espinoza