default search action
Marcos Goycoolea
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Patricio Lamas, Marcos Goycoolea
, Bernardo K. Pagnoncelli, Alexandra M. Newman
A target-time-windows technique for project scheduling under uncertainty. Eur. J. Oper. Res. 314(2): 792-806 (2024) - 2023
- [i1]Fabian Badilla, Marcos Goycoolea, Gonzalo Muñoz, Thiago Serra:
Computational Tradeoffs of Optimization-Based Bound Tightening in ReLU Networks. CoRR abs/2312.16699 (2023) - 2022
- [j25]Alessandro Hill, Andrea J. Brickey
Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining. INFORMS J. Comput. 34(6): 3042-3058 (2022) - 2021
- [j24]Eduardo Álvarez-Miranda
The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. Eur. J. Oper. Res. 289(3): 1013-1029 (2021) - [j23]Peter Nesbitt, Lewis R. Blake, Patricio Lamas
Underground mine scheduling under uncertainty. Eur. J. Oper. Res. 294(1): 340-352 (2021) - [j22]Andrea J. Brickey
Barrick's Turquoise Ridge Gold Mine Optimizes Underground Production Scheduling Operations. INFORMS J. Appl. Anal. 51(2): 106-118 (2021) - [j21]Marcos Goycoolea, Patricio Lamas
Lane's Algorithm Revisited. Manag. Sci. 67(5): 3087-3103 (2021) - 2020
- [j20]Orlando Rivera Letelier
Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach. Oper. Res. 68(5): 1425-1444 (2020)
2010 – 2019
- 2019
- [j19]Alessandro Hill
A multi-mode resource-constrained project scheduling reformulation for the waterway ship scheduling problem. J. Sched. 22(2): 173-182 (2019) - 2018
- [j18]Gonzalo Muñoz
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling. Comput. Optim. Appl. 69(2): 501-534 (2018) - 2017
- [j17]Barry King, Marcos Goycoolea
Optimizing the open pit-to-underground mining transition. Eur. J. Oper. Res. 257(1): 297-309 (2017) - 2015
- [j16]Daniel G. Espinoza, Marcos Goycoolea
The precedence constrained knapsack problem: Separating maximally violated inequalities. Discret. Appl. Math. 194: 65-80 (2015) - 2013
- [j15]Daniel G. Espinoza, Marcos Goycoolea
MineLib: a library of open pit mining problems. Ann. Oper. Res. 206(1): 93-114 (2013) - [j14]Rodolfo Carvajal, Miguel Constantino
Imposing Connectivity Constraints in Forest Planning Models. Oper. Res. 61(4): 824-836 (2013) - 2012
- [j13]Renaud Chicoisne
A New Algorithm for the Open-Pit Mine Production Scheduling Problem. Oper. Res. 60(3): 517-528 (2012) - 2011
- [j12]Ricardo Fukasawa
On the exact separation of mixed integer knapsack cuts. Math. Program. 128(1-2): 19-41 (2011) - 2010
- [j11]Eduardo Moreno
Large-scale multi-period precedence constrained knapsack problem: A mining application. Electron. Notes Discret. Math. 36: 407-414 (2010) - [j10]Sanjeeb Dash, Marcos Goycoolea
Two-Step MIR Inequalities for Mixed Integer Programs. INFORMS J. Comput. 22(2): 236-249 (2010) - [j9]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem. Math. Oper. Res. 35(2): 479-493 (2010) - [j8]Sanjeeb Dash, Marcos Goycoolea
A heuristic to generate rank-1 GMI cuts. Math. Program. Comput. 2(3-4): 231-257 (2010) - [j7]Daniel G. Espinoza, Ricardo Fukasawa
Lifting, tilting and fractional programming revisited. Oper. Res. Lett. 38(6): 559-563 (2010)
2000 – 2009
- 2009
- [j6]William J. Cook, Sanjeeb Dash, Ricardo Fukasawa
Numerically Safe Gomory Mixed-Integer Cuts. INFORMS J. Comput. 21(4): 641-649 (2009) - [j5]David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
Certification of an optimal TSP tour through 85, 900 cities. Oper. Res. Lett. 37(1): 11-15 (2009) - 2008
- [j4]Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model. Transp. Sci. 42(3): 263-278 (2008) - [j3]Daniel G. Espinoza, Renan Garcia, Marcos Goycoolea
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search. Transp. Sci. 42(3): 279-291 (2008) - 2007
- [j2]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP). INFORMS J. Comput. 19(3): 356-365 (2007) - [c2]Ricardo Fukasawa
On the Exact Separation of Mixed Integer Knapsack Cuts. IPCO 2007: 225-239 - 2005
- [j1]Marcos Goycoolea
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches. Oper. Res. 53(3): 490-500 (2005) - [c1]William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
A Study of Domino-Parity and k-Parity Constraints for the TSP. IPCO 2005: 452-467
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: