Marcos Goycoolea

According to our database1, Marcos Goycoolea authored at least 25 papers between 2005 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Lane's Algorithm Revisited.
Manag. Sci., 2021

Barrick's Turquoise Ridge Gold Mine Optimizes Underground Production Scheduling Operations.
INFORMS J. Appl. Anal., 2021

Underground mine scheduling under uncertainty.
Eur. J. Oper. Res., 2021

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements.
Eur. J. Oper. Res., 2021

2020
Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach.
Oper. Res., 2020

2019
A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem.
J. Sched., 2019

2018
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling.
Comput. Optim. Appl., 2018

2017
Optimizing the open pit-to-underground mining transition.
Eur. J. Oper. Res., 2017

2015
The precedence constrained knapsack problem: Separating maximally violated inequalities.
Discret. Appl. Math., 2015

2013
Imposing Connectivity Constraints in Forest Planning Models.
Oper. Res., 2013

MineLib: a library of open pit mining problems.
Ann. Oper. Res., 2013

2012
A New Algorithm for the Open-Pit Mine Production Scheduling Problem.
Oper. Res., 2012

2011
On the exact separation of mixed integer knapsack cuts.
Math. Program., 2011

2010
Lifting, tilting and fractional programming revisited.
Oper. Res. Lett., 2010

A heuristic to generate rank-1 GMI cuts.
Math. Program. Comput., 2010

Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem.
Math. Oper. Res., 2010

Two-Step MIR Inequalities for Mixed Integer Programs.
INFORMS J. Comput., 2010

Large-scale multi-period precedence constrained knapsack problem: A mining application.
Electron. Notes Discret. Math., 2010

2009
Certification of an optimal TSP tour through 85, 900 cities.
Oper. Res. Lett., 2009

Numerically Safe Gomory Mixed-Integer Cuts.
INFORMS J. Comput., 2009

2008
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search.
Transp. Sci., 2008

Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model.
Transp. Sci., 2008

2007
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP).
INFORMS J. Comput., 2007

2005
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches.
Oper. Res., 2005

A Study of Domino-Parity and k-Parity Constraints for the TSP.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005


  Loading...