Jon Lee

9 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0002-8190-1091

IOE Department, University of Michigan, Ann Arbor, Michigan 48109

Publications

• Technical Note—Masking Anstreicher’s linx Bound for Improved Entropy Bounds — Operations Research 2024
• D-Optimal Data Fusion: Exact and Approximation Algorithms — INFORMS Journal on Computing 2024
• On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem — INFORMS Journal on Computing 2023
• Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs — INFORMS Journal on Computing 2021
• On a Binary-Encoded ILP Coloring Formulation — INFORMS Journal on Computing 2007
• Constrained Maximum-Entropy Sampling — Operations Research 1998
• An Exact Algorithm for Maximum Entropy Sampling — Operations Research 1995
• Matroid Applications and Algorithms — ORSA Journal on Computing 1992
• On Constrained Bottleneck Extrema — Operations Research 1992