 | 2009 |
|---|
| 9 |       | Andrea Lodi,
Ted K. Ralphs:
Bilevel Programming and Maximally Violated Valid Inequalities.
CTW 2009: 125-134 |
| 8 | | Y. Xu,
Ted K. Ralphs,
Laszlo Ladányi,
Matthew J. Saltzman:
Computational Experience with a Software Framework for Parallel Integer Programming.
INFORMS Journal on Computing 21(3): 383-397 (2009) |
| 2006 |
|---|
| 7 | | Ted K. Ralphs,
Matthew J. Saltzman,
Margaret M. Wiecek:
An improved algorithm for solving biobjective integer programs.
Annals OR 147(1): 43-70 (2006) |
| 6 | | Ted K. Ralphs,
Matthew V. Galati:
Decomposition and Dynamic Cut Generation in Integer Linear Programming.
Math. Program. 106(2): 261-285 (2006) |
| 2004 |
|---|
| 5 | | Ted K. Ralphs,
Laszlo Ladányi,
Matthew J. Saltzman:
A Library Hierarchy for Implementing Scalable Parallel Search Algorithms.
The Journal of Supercomputing 28(2): 215-234 (2004) |
| 2003 |
|---|
| 4 | | Ted K. Ralphs:
Parallel branch and cut for capacitated vehicle routing.
Parallel Computing 29(5): 607-629 (2003) |
| 2002 |
|---|
| 3 | | Laszlo Ladányi,
Ted K. Ralphs,
Matthew J. Saltzman:
Implementing Scalable Parallel Search Algorithms for Data-Intensive Applications.
International Conference on Computational Science (1) 2002: 592-602 |
| 2001 |
|---|
| 2 | | Laszlo Ladányi,
Ted K. Ralphs,
Leslie E. Trotter Jr.:
Branch, Cut, and Price: Sequential and Parallel.
Computational Combinatorial Optimization 2001: 223-260 |
| 1997 |
|---|
| 1 |  | Marta Eso,
Laszlo Ladányi,
Ted K. Ralphs,
Leslie E. Trotter Jr.:
Fully Parallel Generic Branch-and-Cut.
PPSC 1997 |
