 | 2011 |
|---|
| 13 |       | Ricardo Fukasawa,
Marcos Goycoolea:
On the exact separation of mixed integer knapsack cuts.
Math. Program. 128(1-2): 19-41 (2011) |
| 2010 |
|---|
| 12 | | Eduardo Moreno,
Daniel G. Espinoza,
Marcos Goycoolea:
Large-scale multi-period precedence constrained knapsack problem: A mining application.
Electronic Notes in Discrete Mathematics 36: 407-414 (2010) |
| 11 | | Sanjeeb Dash,
Marcos Goycoolea,
Oktay Günlük:
Two-Step MIR Inequalities for Mixed Integer Programs.
INFORMS Journal on Computing 22(2): 236-249 (2010) |
| 10 | | 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) |
| 9 | | Daniel G. Espinoza,
Ricardo Fukasawa,
Marcos Goycoolea:
Lifting, tilting and fractional programming revisited.
Oper. Res. Lett. 38(6): 559-563 (2010) |
| 2009 |
|---|
| 8 | | William Cook,
Sanjeeb Dash,
Ricardo Fukasawa,
Marcos Goycoolea:
Numerically Safe Gomory Mixed-Integer Cuts.
INFORMS Journal on Computing 21(4): 641-649 (2009) |
| 7 | | David Applegate,
Robert E. Bixby,
Vasek Chvátal,
William J. Cook,
Daniel G. Espinoza,
Marcos Goycoolea,
Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities.
Oper. Res. Lett. 37(1): 11-15 (2009) |
| 2008 |
|---|
| 6 | | Daniel G. Espinoza,
R. Garcia,
Marcos Goycoolea,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model.
Transportation Science 42(3): 263-278 (2008) |
| 5 | | Daniel G. Espinoza,
R. Garcia,
Marcos Goycoolea,
George L. Nemhauser,
Martin W. P. Savelsbergh:
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search.
Transportation Science 42(3): 279-291 (2008) |
| 2007 |
|---|
| 4 | | Ricardo Fukasawa,
Marcos Goycoolea:
On the Exact Separation of Mixed Integer Knapsack Cuts.
IPCO 2007: 225-239 |
| 3 | | William J. Cook,
Daniel G. Espinoza,
Marcos Goycoolea:
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP).
INFORMS Journal on Computing 19(3): 356-365 (2007) |
| 2005 |
|---|
| 2 | | William J. Cook,
Daniel G. Espinoza,
Marcos Goycoolea:
A Study of Domino-Parity and k-Parity Constraints for the TSP.
IPCO 2005: 452-467 |
| 1 | | Marcos Goycoolea,
Alan T. Murray,
Francisco Barahona,
Rafael Epstein,
Andres Weintraub:
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches.
Operations Research 53(3): 490-500 (2005) |
Data released under the ODC-BY 1.0 license — See also our legal information page