Jonathan Eckstein How Much Communication Does Parallel Branch and Bound Need? [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 1997, v:9, n:1, pp:15-29 [Journal]

Jonathan Eckstein A practical general approximation criterion for methods of multipliers based on Bregman distances. [Citation Graph (0, 0)][DBLP] Math. Program., 2003, v:96, n:1, pp:61-86 [Journal]

Jonathan Eckstein Approximate iterations in Bregman-function-based proximal algorithms. [Citation Graph (0, 0)][DBLP] Math. Program., 1998, v:83, n:, pp:113-123 [Journal]