The following pages link to Jon Lee (Q170438):
Displaying 34 items.
- Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search (Q5003211) (← links)
- Non-monotone submodular maximization under matroid and knapsack constraints (Q5172726) (← links)
- On branching rules for convex mixed-integer nonlinear optimization (Q5178746) (← links)
- On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem (Q5199160) (← links)
- On Proximity for k-Regular Mixed-Integer Linear Optimization (Q5214422) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- Hilbert's Nullstellensatz and an Algorithm for Proving Combinatorial Infeasibility (Q5301623) (← links)
- Computation in multicriteria matroid optimization (Q5406201) (← links)
- An MINLP Solution Method for a Water Network Problem (Q5449573) (← links)
- Integer Programming and Combinatorial Optimization (Q5712460) (← links)
- Characterizations of the Dimension for Classes of Concordant Polytopes (Q5748520) (← links)
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (Q5895002) (← links)
- Submodular Maximization over Multiple Matroids via Generalized Exchange Properties (Q5902164) (← links)
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions (Q5918407) (← links)
- Gaining or losing perspective for piecewise-linear under-estimators of convex univariate functions (Q5925583) (← links)
- Maximum-entropy remote sampling (Q5929307) (← links)
- Polyhedral methods for piecewise-linear functions. I: The lambda method (Q5929311) (← links)
- Polynomial Upper Bounds on the Number of Differing Columns of Δ-Modular Integer Programs (Q6122583) (← links)
- Tridiagonal maximum-entropy sampling and tridiagonal masks (Q6162032) (← links)
- D-Optimal Data Fusion: Exact and Approximation Algorithms (Q6202334) (← links)
- An outer-approximation algorithm for maximum-entropy sampling (Q6202951) (← links)
- On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem (Q6203371) (← links)
- Gaining or Losing Perspective for Convex Multivariate Functions on a Simplex (Q6388578) (← links)
- On computing sparse generalized inverses (Q6451818) (← links)
- Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem (Q6510759) (← links)
- On the Diameter of a 2-Sum of Polyhedra (Q6514110) (← links)
- Good and Fast Row-Sparse ah-Symmetric Reflexive Generalized Inverses (Q6519636) (← links)
- On the Hardness of Short and Sign-Compatible Circuit Walks (Q6520007) (← links)
- Gaining or losing perspective for convex multivariate functions on box domains (Q6530019) (← links)
- Technical note -- Masking Anstreicher's Linx bound for improved entropy bounds (Q6579649) (← links)
- On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs (Q6589745) (← links)
- On disjunction convex hulls by lifting (Q6737395) (← links)
- ADMM for 0/1 D-Opt and MESP relaxations (Q6752150) (← links)
- On a geometric graph-covering problem related to optimal safety-landing-site location (Q6762868) (← links)
