| 2008 |
|---|
| 9 | EE | Jonathan Eckstein,
Benar Fux Svaiter:
A family of projective splitting methods for the sum of two maximal monotone operators.
Math. Program. 111(1-2): 173-199 (2008) |
| 2007 |
|---|
| 8 | EE | Jonathan Eckstein,
Mikhail Nediak:
Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming.
J. Heuristics 13(5): 471-503 (2007) |
| 2003 |
|---|
| 7 | EE | Jonathan Eckstein:
A practical general approximation criterion for methods of multipliers based on Bregman distances.
Math. Program. 96(1): 61-86 (2003) |
| 2001 |
|---|
| 6 | EE | Avigdor Gal,
Jonathan Eckstein:
Managing periodically updated data in relational databases: a stochastic modeling approach.
J. ACM 48(6): 1141-1183 (2001) |
| 2000 |
|---|
| 5 | EE | Avigdor Gal,
Jonathan Eckstein:
Managing Periodically Updated Data in Relational Databases: A Stochastic Modeling Approach
CoRR cs.DB/0007044: (2000) |
| 1998 |
|---|
| 4 | | Jonathan Eckstein:
Approximate iterations in Bregman-function-based proximal algorithms.
Math. Program. 83: 113-123 (1998) |
| 1997 |
|---|
| 3 | EE | Jonathan Eckstein:
How Much Communication Does Parallel Branch and Bound Need?
INFORMS Journal on Computing 9(1): 15-29 (1997) |
| 1994 |
|---|
| 2 | EE | Jonathan Eckstein:
Control strategies for parallel mixed integer branch and bound.
SC 1994: 41-48 |
| 1992 |
|---|
| 1 | | Jonathan Eckstein,
Dimitri P. Bertsekas:
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators.
Math. Program. 55: 293-318 (1992) |
