dblp.uni-trier.dewww.uni-trier.de

Jonathan Eckstein

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
11EEJonathan Eckstein, Avigdor Gal, Sarit Reiner: Monitoring an Information Source Under a Politeness Constraint. INFORMS Journal on Computing 20(1): 3-20 (2008)
10EEJonathan 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
9EEJonathan Eckstein, Mikhail Nediak: Pivot, Cut, and Dive: a heuristic for 0-1 mixed integer programming. J. Heuristics 13(5): 471-503 (2007)
2005
8EEJonathan Eckstein, Mikhail Nediak: Depth-Optimized Convexity Cuts. Annals OR 139(1): 95-129 (2005)
2003
7EEJonathan Eckstein: A practical general approximation criterion for methods of multipliers based on Bregman distances. Math. Program. 96(1): 61-86 (2003)
2001
6EEAvigdor Gal, Jonathan Eckstein: Managing periodically updated data in relational databases: a stochastic modeling approach. J. ACM 48(6): 1141-1183 (2001)
2000
5EEAvigdor 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
3EEJonathan Eckstein: How Much Communication Does Parallel Branch and Bound Need? INFORMS Journal on Computing 9(1): 15-29 (1997)
1994
2EEJonathan 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)

Coauthor Index

1Dimitri P. Bertsekas [1]
2Avigdor Gal [5] [6] [11]
3Mikhail Nediak [8] [9]
4Sarit Reiner [11]
5Benar Fux Svaiter [10]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)