The following pages link to Jon Lee (Q170438):
Displaying 50 items.
- Gaining or losing perspective (Q2124806) (← links)
- Trading off \(1\)-norm and sparsity against rank for linear models using mathematical optimization: \(1\)-norm minimizing partially reflexive ah-symmetric generalized inverses (Q2165590) (← links)
- On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs (Q2174883) (← links)
- On an SDP relaxation for kissing number (Q2174884) (← links)
- Handling separable non-convexities using disjunctive cuts (Q2225053) (← links)
- Improving proximity bounds using sparsity (Q2225054) (← links)
- Approximating max-cut under graph-MSO constraints (Q2294245) (← links)
- On sparse reflexive generalized inverse (Q2294248) (← links)
- Volume computation for sparse Boolean quadric relaxations (Q2297660) (← links)
- Extrapolating curvature lines in rough concept sketches using mixed-integer nonlinear optimization (Q2331356) (← links)
- Min-up/min-down polytopes (Q2386215) (← links)
- On the number of realizations of certain Henneberg graphs arising in protein conformation (Q2448906) (← links)
- Block matrices and multispherical structure of distance matrices (Q2564954) (← links)
- Parsimonious binary-encoding in integer programming (Q2581315) (← links)
- Parametric nonlinear discrete optimization over well-described sets and matroid intersections (Q2638368) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations (Q2638381) (← links)
- Constrained maximum-entropy sampling (Q2781107) (← links)
- An overview of exact algorithms for the Euclidean Steiner tree problem in \(n\)-space (Q2827758) (← links)
- Matroid matching: the power of local search (Q2839182) (← links)
- Techniques for Submodular Maximization (Q2848998) (← links)
- Matroid matching: the power of local search (Q2875164) (← links)
- On a binary-encoded ILP coloring formulation (Q2892353) (← links)
- An Algorithmic Framework for MINLP with Separable Non-Convexity (Q2897302) (← links)
- A Polytope for a Product of Real Linear Functions in 0/1 Variables (Q2897309) (← links)
- A Probing Algorithm for MINLP with Failure Prediction by SVM (Q3003284) (← links)
- Approximate Nonlinear Optimization over Weighted Independence Systems (Q3058525) (← links)
- Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints (Q3058545) (← links)
- Feasibility-Based Bounds Tightening via Fixed Points (Q3066145) (← links)
- Max-Cut Under Graph Constraints (Q3186491) (← links)
- Nonlinear Matroid Optimization and Experimental Design (Q3393425) (← links)
- Branching and bounds tighteningtechniques for non-convex MINLP (Q3396388) (← links)
- Comparison of the Two Formulations of w-u-v and w-F in Nonlinear Plate Analysis (Q3443757) (← links)
- On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond (Q3457191) (← links)
- Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz (Q3552513) (← links)
- Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz – Corrigendum (Q3557531) (← links)
- Nonlinear Integer Programming (Q3565244) (← links)
- Nonlinear Optimization over a Weighted Independence System (Q3638454) (← links)
- A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity (Q3639239) (← links)
- Matroid Applications and Algorithms (Q3993669) (← links)
- On Constrained Bottleneck Extrema (Q4022940) (← links)
- (Q4247165) (← links)
- Local bipartite turán graphs and graph partitioning (Q4291487) (← links)
- Classroom Note:Hoffman's Circle Untangled (Q4337472) (← links)
- (Q4429166) (← links)
- Quantifying Double McCormick (Q4595965) (← links)
- More Virtuous Smoothing (Q4634104) (← links)
- Continuous relaxations for Constrained Maximum-Entropy Sampling (Q4645926) (← links)
- (Q4821529) (← links)
- An Exact Algorithm for Maximum Entropy Sampling (Q4897080) (← links)
