| Publication | Date of Publication | Type |
|---|
A target-time-windows technique for project scheduling under uncertainty
European Journal of Operational Research | 2024-04-16 | Paper |
Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
INFORMS Journal on Computing | 2023-01-11 | Paper |
Underground mine scheduling under uncertainty
European Journal of Operational Research | 2021-06-08 | Paper |
The generalized reserve set covering problem with connectivity and buffer requirements
European Journal of Operational Research | 2021-06-03 | Paper |
Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
Operations Research | 2021-01-19 | Paper |
Optimizing the open pit-to-underground mining transition
European Journal of Operational Research | 2018-05-24 | Paper |
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
Computational Optimization and Applications | 2018-04-20 | Paper |
The precedence constrained knapsack problem: separating maximally violated inequalities
Discrete Applied Mathematics | 2015-09-01 | Paper |
Imposing Connectivity Constraints in Forest Planning Models
Operations Research | 2014-06-26 | Paper |
MineLib: a library of open pit mining problems
Annals of Operations Research | 2013-09-03 | Paper |
A new algorithm for the open-pit mine production scheduling problem
Operations Research | 2012-11-08 | Paper |
Numerically safe Gomory mixed-integer cuts
INFORMS Journal on Computing | 2012-07-28 | Paper |
Two-step MIR inequalities for mixed integer programs
INFORMS Journal on Computing | 2012-07-28 | Paper |
Computing with domino-parity inequalities for the traveling salesman problem (TSP)
INFORMS Journal on Computing | 2012-06-18 | Paper |
Large-scale multi-period precedence constrained knapsack problem: a mining application
Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
On the exact separation of mixed integer knapsack cuts
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Generalized domino-parity inequalities for the symmetric traveling salesman problem
Mathematics of Operations Research | 2011-04-27 | Paper |
A heuristic to generate rank-1 GMI cuts
Mathematical Programming Computation | 2011-01-28 | Paper |
Lifting, tilting and fractional programming revisited
Operations Research Letters | 2010-12-23 | Paper |
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
Operations Research | 2009-07-18 | Paper |
Certification of an optimal TSP tour through 85,900 cities
Operations Research Letters | 2009-02-23 | Paper |
On the Exact Separation of Mixed Integer Knapsack Cuts
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
A Study of Domino-Parity and k-Parity Constraints for the TSP
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
