Daniel G. Espinoza

22 papers B 2Journal 19
YearRankTypeTitle / Venue / Authors
2020 J jnl
Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach.
Oper. Res.
Orlando Rivera Letelier, Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Gonzalo Muñoz
2018 J jnl
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling.
Comput. Optim. Appl.
Gonzalo Muñoz, Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Maurice Queyranne, Orlando Rivera Letelier
2018 J jnl
Risk Averse Shortest Paths: A Computational Study.
INFORMS J. Comput.
Renaud Chicoisne, Fernando Ordóñez, Daniel G. Espinoza
2015 J jnl
Restricted risk measures and robust optimization.
Eur. J. Oper. Res.
Guido Lagos, Daniel G. Espinoza, Eduardo Moreno, Juan Pablo Vielma
2015 J jnl
The precedence constrained knapsack problem: Separating maximally violated inequalities.
Discret. Appl. Math.
Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno
2014 J jnl
A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs.
Comput. Optim. Appl.
Daniel G. Espinoza, Eduardo Moreno
2013 J jnl
Local cuts for mixed-integer programming.
Math. Program. Comput.
Vasek Chvátal, William J. Cook, Daniel G. Espinoza
2013 J jnl
MineLib: a library of open pit mining problems.
Ann. Oper. Res.
Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Alexandra M. Newman
2012 J jnl
A New Algorithm for the Open-Pit Mine Production Scheduling Problem.
Oper. Res.
Renaud Chicoisne, Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Enrique Rubio
2011 J jnl
Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty.
Electron. Notes Discret. Math.
Guido Lagos, Daniel G. Espinoza, Eduardo Moreno, Jorge Amaya
2010 J jnl
Computing with multi-row Gomory cuts.
Oper. Res. Lett.
Daniel G. Espinoza
2010 J jnl
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem.
Math. Oper. Res.
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
2010 J jnl
Large-scale multi-period precedence constrained knapsack problem: A mining application.
Electron. Notes Discret. Math.
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycoolea
2010 J jnl
Lifting, tilting and fractional programming revisited.
Oper. Res. Lett.
Daniel G. Espinoza, Ricardo Fukasawa, Marcos Goycoolea
2009 J jnl
Certification of an optimal TSP tour through 85, 900 cities.
Oper. Res. Lett.
David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun
2008 B conf
Computing with Multi-row Gomory Cuts.
IPCO
Daniel G. Espinoza
2008 J jnl
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model.
Transp. Sci.
Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh
2008 J jnl
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search.
Transp. Sci.
Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea, George L. Nemhauser, Martin W. P. Savelsbergh
2007 J jnl
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP).
INFORMS J. Comput.
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
2007 J jnl
Exact solutions to linear programming problems.
Oper. Res. Lett.
David L. Applegate, William J. Cook, Sanjeeb Dash, Daniel G. Espinoza
2006 — —
On Linear Programming, Integer Programming and Cutting Planes.
Daniel G. Espinoza
2005 B conf
A Study of Domino-Parity and k-Parity Constraints for the TSP.
IPCO
William J. Cook, Daniel G. Espinoza, Marcos Goycoolea