Eckstein Jonathan

Jonathan Eckstein

Information about the author Jonathan Eckstein will soon be added to the site.
Found 13 papers in total
An Improved Branch‐and‐Bound Method for Maximum Monomial Agreement
An Improved Branch‐and‐Bound Method for Maximum Monomial Agreement
2012
The 𝒩𝒫‐hard maximum monomial agreement problem consists of finding a...
Monitoring an Information Source Under a Politeness Constraint
Monitoring an Information Source Under a Politeness Constraint
2008
We describe scheduling algorithms for monitoring a single information source whose...
Pivot, Cut, and Dive: a heuristic for 0–1 mixed integer programming
Pivot, Cut, and Dive: a heuristic for 0–1 mixed integer programming
2007
This paper describes a heuristic for 0–1 mixed-integer linear programming...
Depth-optimized convexity cuts
Depth-optimized convexity cuts
2005
This paper presents a general, self-contained treatment of convexity or intersection...
YASAI: Yet another add-in for teaching elementary Monte Carlo simulation in Excel
YASAI: Yet another add-in for teaching elementary Monte Carlo simulation in Excel
2002
This report describes YASAI (Yet Another Simulation Add-In), a tool for performing...
Approximate iterations in Bregman-function-based proximal algorithms
Approximate iterations in Bregman-function-based proximal algorithms
1998
This paper establishes convergence of generalized Bregman-function-based proximal...
Data-parallel implementations of dense simplex methods on the Connection Machine CM-2
Data-parallel implementations of dense simplex methods on the Connection Machine CM-2
1995
We describe three data-parallel implementations of the simplex method for dense linear...
How much communication does parallel branch and bound need?
How much communication does parallel branch and bound need?
1997
Consider the classical branch and bound algorithm for mixed integer programming (MIP)....
Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5
Distributed versus centralized storage and control for parallel branch and bound: Mixed integer programming on the CM-5
1997
This paper describes parallel, non-shared-memory implementation of the classical...
How much communication does parallel branch and bound need?
How much communication does parallel branch and bound need?
1997
Consider the classical branch and bound algorithm for mixed integer programming (MIP)....
Stochastic dedication: Designing fixed income portfolios using massively parallel Benders decomposition
Stochastic dedication: Designing fixed income portfolios using massively parallel Benders decomposition
1993
Drawing on recent developments in discrete time fixed income options theory, the...
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
1992
This paper shows, by means of an operator called a splitting operator, that the...
Dual coordinate step methods for linear network flow problems
Dual coordinate step methods for linear network flow problems
1988
The authors review a class of recently-proposed linear-cost network flow methods which...
Papers per page: