| 2009 |
|---|
| 11 | EE | Roger Z. Ríos-Mercado,
Elena Fernández:
A reactive GRASP for a commercial territory design problem with multiple balancing requirements.
Computers & OR 36(3): 755-776 (2009) |
| 2008 |
|---|
| 10 | EE | Sira Allende,
María Auxilio Osorio Lama,
Roger Z. Ríos-Mercado,
Jan-J. Rückmann:
Preface.
Annals OR 157(1): 1-2 (2008) |
| 2006 |
|---|
| 9 | EE | Roger Z. Ríos-Mercado,
Seongbae Kim,
E. Andrew Boyd:
Efficient operation of natural gas transmission systems: A network-based heuristic for cyclic structures.
Computers & OR 33: 2323-2351 (2006) |
| 2005 |
|---|
| 8 | EE | Conrado Borraz-Sánchez,
Roger Z. Ríos-Mercado:
A Hybrid Meta-heuristic Approach for Natural Gas Pipeline Network Optimization.
Hybrid Metaheuristics 2005: 54-65 |
| 7 | EE | Lorena Pradenas,
Roger Z. Ríos-Mercado,
Jacques A. Ferland,
Robert Scherer,
Philippe Michelon,
Nelson Maculan:
Preface.
Annals OR 138(1): 19-20 (2005) |
| 6 | EE | Stephan Dempe,
Vyacheslav Kalashnikov,
Roger Z. Ríos-Mercado:
Discrete bilevel programming: Application to a natural gas cash-out problem.
European Journal of Operational Research 166(2): 469-488 (2005) |
| 2003 |
|---|
| 5 | EE | Roger Z. Ríos-Mercado,
Jonathan F. Bard:
The Flow Shop Scheduling Polyhedron with Setup Time.
J. Comb. Optim. 7(3): 291-318 (2003) |
| 2002 |
|---|
| 4 | EE | Roger Z. Ríos-Mercado,
Suming Wu,
L. Ridgway Scott,
E. Andrew Boyd:
A Reduction Technique for Natural Gas Transmission Network Optimization Problems.
Annals OR 117(1-4): 217-234 (2002) |
| 1999 |
|---|
| 3 | | Roger Z. Ríos-Mercado,
Jonathan F. Bard:
An Enhanced TSP-Based Heuristic for Makespan Minimization in a Flow Shop with Setup Times.
J. Heuristics 5(1): 53-70 (1999) |
| 1998 |
|---|
| 2 | | Robert E. Bixby,
E. Andrew Boyd,
Roger Z. Ríos-Mercado:
Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings
Springer 1998 |
| 1 | EE | Roger Z. Ríos-Mercado,
Jonathan F. Bard:
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups.
Computers & OR 25(5): 351-366 (1998) |
