A Study of Domino-Parity and k-Parity Constraints for the TSP. - William J. Cook; Daniel G. Espinoza; Marcos Goycoolea (IPCO, 2005)

On Linear Programming, Integer Programming and Cutting Planes. - Daniel G. Espinoza (2006)

Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP). - William J. Cook; Daniel G. Espinoza; Marcos Goycoolea (INFORMS J. Comput., 2007)

Exact solutions to linear programming problems. - David L. Applegate; William J. Cook; Sanjeeb Dash; Daniel G. Espinoza (Oper. Res. Lett., 2007)

Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model. - Daniel G. Espinoza; Renan Garcia; Marcos Goycoolea; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2008)

Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. - Daniel G. Espinoza; Renan Garcia; Marcos Goycoolea; George L. Nemhauser; Martin W. P. Savelsbergh (Transp. Sci., 2008)

Certification of an optimal TSP tour through 85, 900 cities. - David L. Applegate; Robert E. Bixby; Vasek Chvátal; William J. Cook; Daniel G. Espinoza; Marcos Goycoolea; Keld Helsgaun (Oper. Res. Lett., 2009)

Large-scale multi-period precedence constrained knapsack problem: A mining application. - Eduardo Moreno 001; Daniel G. Espinoza; Marcos Goycoolea (Electron. Notes Discret. Math., 2010)

Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem. - William J. Cook; Daniel G. Espinoza; Marcos Goycoolea (Math. Oper. Res., 2010)

Computing with multi-row Gomory cuts. - Daniel G. Espinoza (Oper. Res. Lett., 2010)

Lifting, tilting and fractional programming revisited. - Daniel G. Espinoza; Ricardo Fukasawa; Marcos Goycoolea (Oper. Res. Lett., 2010)

Robust Planning for an Open-Pit Mining Problem under Ore-Grade Uncertainty. - Guido Lagos; Daniel G. Espinoza; Eduardo Moreno 001; Jorge Amaya (Electron. Notes Discret. Math., 2011)

A New Algorithm for the Open-Pit Mine Production Scheduling Problem. - Renaud Chicoisne; Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Enrique Rubio (Oper. Res., 2012)

MineLib: a library of open pit mining problems. - Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Alexandra M. Newman (Ann. Oper. Res., 2013)

Local cuts for mixed-integer programming. - Vasek Chvátal; William J. Cook; Daniel G. Espinoza (Math. Program. Comput., 2013)

A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs. - Daniel G. Espinoza; Eduardo Moreno 001 (Comput. Optim. Appl., 2014)

The precedence constrained knapsack problem: Separating maximally violated inequalities. - Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001 (Discret. Appl. Math., 2015)

Restricted risk measures and robust optimization. - Guido Lagos; Daniel G. Espinoza; Eduardo Moreno 001; Juan Pablo Vielma (Eur. J. Oper. Res., 2015)

A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling. - Gonzalo Muñoz 001; Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Maurice Queyranne; Orlando Rivera Letelier (Comput. Optim. Appl., 2018)

Risk Averse Shortest Paths: A Computational Study. - Renaud Chicoisne; Fernando Ordóñez; Daniel G. Espinoza (INFORMS J. Comput., 2018)

Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach. - Orlando Rivera Letelier; Daniel G. Espinoza; Marcos Goycoolea; Eduardo Moreno 001; Gonzalo Muñoz 001 (Oper. Res., 2020)