Searching for authors named "Jon Lee" – sorted by Relevance.
-
In Situ Column Generation for a Cutting-Stock Problem
- Cutting-Stock Problem Jon Lee IBM Research Division Thomas J. Watson Research Center P.O. Box 218 Yorktown
- Cited by 2 (0 self) – Add To MetaCart
-
Constrained maximum-entropy sampling
- IBM T.J. Watson Research Center Maximum Entropy Sampling Jon Lee Mathematical Sciences
- Cited by 10 (6 self) – Add To MetaCart
-
Orienting matroids representable over both GF(3) and GF(5)
- Orienting matroids representable over both GF [3] and GF [5] Jon Lee jlee@(email omitted); University
- Cited by 1 (1 self) – Add To MetaCart
-
A Characterization of the Orientations of Ternary Matroids
- A characterization of the orientations of ternary matroids Jon Lee Matt Scobee y May 5, 1997
- Cited by 4 (0 self) – Add To MetaCart
-
A simple pattern-matching algorithm for recovering empty nodes and their antecedents
- PARSIMONIOUS BINARY-ENCODING IN INTEGER PROGRAMMING DON COPPERSMITH AND JON LEE Abstract. We
- Cited by 1 (1 self) – Add To MetaCart
-
Polyhedral Methods for Piecewise-Linear Functions I: The Lambda Method
- Polyhedral Methods for Piecewise-Linear Functions I: The Lambda Method Jon Lee Dan Wilson y 12
- Cited by 2 (0 self) – Add To MetaCart
-
A masked spectral bound for maximum-entropy sampling
- for Maximum-Entropy Sampling Kurt Anstreicher University of Iowa Iowa City, IA Jon Lee IBM Research Division
- Cited by 1 (1 self) – Add To MetaCart
-
The Yamabe problem
- Modeling integers in binary Jon Lee jonlee@(email omitted); IBM T.J. Watson Research Center Department
- Cited by 39 (3 self) – Add To MetaCart
-
The volume of relaxed Boolean-quadric and cut polytopes.
- Jersey City, New Jersey 07310 USA Jon Lee** Department of Mathematics University of Kentucky Lexington
- Cited by 2 (0 self) – Add To MetaCart
-
New Upper Bounds for Maximum-Entropy Sampling
- FOR MAXIMUM-ENTROPY SAMPLING Alan HOFFMAN 1 , Jon LEE 2 &Joy WILLIAMS 3 February 2000 Abstract We develop
- Cited by 1 (1 self) – Add To MetaCart

