The following pages link to Jon Lee (Q170438):
Displaying 50 items.
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- An algebraic-perturbation variant of Barvinok's algorithm (Q324705) (← links)
- On the optimal design of water distribution networks: a practical MINLP approach (Q400003) (← links)
- Optimal rank-sparsity decomposition (Q486401) (← links)
- Weak orientability of matroids and polynomial equations (Q491739) (← links)
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems (Q533792) (← links)
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations (Q652290) (← links)
- A comparison of two edge-coloring formulations (Q688209) (← links)
- Discretization orders for distance geometry problems (Q691496) (← links)
- Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization (Q708777) (← links)
- A spectral approach to polyhedral dimension (Q750306) (← links)
- Canonical equation sets for classes of concordant polytopes (Q811401) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Solving maximum-entropy sampling problems using factored masks (Q868455) (← links)
- In situ column generation for a cutting-stock problem (Q868997) (← links)
- An algorithmic framework for convex mixed integer nonlinear programs (Q951092) (← links)
- On test sets for nonlinear integer maximization (Q1003492) (← links)
- The incidence structure of subspaces with well-scaled frames (Q1110520) (← links)
- Turán's triangle theorem and binary matroids (Q1117942) (← links)
- Subspaces with well-scaled frames (Q1122483) (← links)
- A spectral method for concordant polyhedral faces (Q1180392) (← links)
- Crashing a maximum-weight complementary basis (Q1196719) (← links)
- Classification of two-person ordinal bimatrix games (Q1202566) (← links)
- On the Boolean-quadric packing uncapacitated facility-location polytope (Q1273120) (← links)
- Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems (Q1300266) (← links)
- Order selection on a single machine with high set-up costs (Q1309884) (← links)
- More facets from fences for linear ordering and acyclic subgraph polytopes (Q1326756) (← links)
- Geometric comparison of combinatorial polytopes (Q1339395) (← links)
- The volume of relaxed Boolean-quadric and cut polytopes (Q1356562) (← links)
- Cropped cubes (Q1402537) (← links)
- A linear integer programming bound for maximum-entropy sampling (Q1411612) (← links)
- A characterization of the orientations of ternary matroids (Q1569059) (← links)
- All-different polytopes (Q1610663) (← links)
- Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations (Q1650771) (← links)
- Virtuous smoothing for global optimization (Q1683327) (← links)
- On global optimization with indefinite quadratics (Q1707078) (← links)
- Computing with an algebraic-perturbation variant of Barvinok's algorithm (Q1707914) (← links)
- On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation (Q1756762) (← links)
- Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation (Q1774528) (← links)
- Approximating graph-constrained max-cut (Q1800989) (← links)
- The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
- A matroid view of key theorems for edge-swapping algorithms (Q1935946) (← links)
- On convex relaxations of quadrilinear terms (Q1959235) (← links)
- Orienting matroids representable over both GF(3) and GF(5) (Q1970078) (← links)
- Experimental validation of volume-based comparison for double-McCormick relaxations (Q2011595) (← links)
- Mixing convex-optimization bounds for maximum-entropy sampling (Q2044968) (← links)
- Convexification of bilinear forms through non-symmetric lifting (Q2045010) (← links)
- Experimental analysis of local searches for sparse reflexive generalized inverses (Q2052412) (← links)
- Gaining or losing perspective (Q2124806) (← links)
