Lee Jon

Jon Lee

Information about the author Jon Lee will soon be added to the site.
Found 20 papers in total
Another pedagogy for pure-integer Gomory
Another pedagogy for pure-integer Gomory
2017
We present pure‐integer Gomory cuts in a way so that they are derived with...
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space
2016
The Euclidean Steiner tree problem (ESTP) in Rn is to find a shortest network...
A matroid view of key theorems for edge‐swapping algorithms
A matroid view of key theorems for edge‐swapping algorithms
2012
We demonstrate that two key theorems of Amaldi et al. (2009), which they presented...
Discretization orders for distance geometry problems
Discretization orders for distance geometry problems
2012
Given a weighted, undirected simple graph G = ( V , E , d ) (where d : E → ℝ...
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
2010
Submodular function maximization is a central problem in combinatorial optimization,...
On test sets for nonlinear integer maximization
On test sets for nonlinear integer maximization
2008
A finite test set for an integer optimization problem enables us to verify whether a...
On a binary-encoded ILP coloring formulation
On a binary-encoded ILP coloring formulation
2007
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors...
An algorithmic framework for convex mixed integer nonlinear programs
An algorithmic framework for convex mixed integer nonlinear programs
2008
This paper is motivated by the fact that mixed integer nonlinear programming is an...
In situ column generation for a cutting-stock problem
In situ column generation for a cutting-stock problem
2007
Working with an integer bilinear programming formulation of a one-dimensional...
Using AMPL for teaching the traveling salesman problem
Using AMPL for teaching the traveling salesman problem
2006
In this paper, we discuss the use of AMPL in teaching students about the traveling...
Rapid prototyping of optimization algorithms using COIN-OR: A case study involving the cutting-stock problem
Rapid prototyping of optimization algorithms using COIN-OR: A case study involving the cutting-stock problem
2005
The rate at which research ideas can be prototyped is significantly increased when...
On the Boolean Quadric Forest Polytope
On the Boolean Quadric Forest Polytope
2004
We study the Boolean Quadric Forest Polytope, namely the convex hull of the...
Constrained maximum-entropy sampling
Constrained maximum-entropy sampling
1998
A fundamental experimental design problem is to select a most informative subset,...
On the boolean-quadric packing uncapacitated facility-location polytope
On the boolean-quadric packing uncapacitated facility-location polytope
1998
We introduce and study the boolean-quadric uncapacitated packing facility-location...
An exact algorithm for maximum entropy sampling
An exact algorithm for maximum entropy sampling
1995
We study the experimental design problem of selecting a most informative subset,...
More facets from fences for linear ordering and acyclic subgraph polytopes
More facets from fences for linear ordering and acyclic subgraph polytopes
1994
The authors present new facets for the linear ordering polytope. These new facets...
A comparison of two edge-coloring formulations
A comparison of two edge-coloring formulations
1993
A fundamental theorem of Vizing relates the maximum degree, ℝ ( G) , of a simple...
Order selection on a single machine with high set-up costs
Order selection on a single machine with high set-up costs
1993
The paper studies the problem of allocating a limited quantity of a single...
Crashing a maximum-weight complementary basis
Crashing a maximum-weight complementary basis
1992
The authors consider the problem of finding a maximum-weight complementary basis of an...
A spectral approach to polyhedral dimension
A spectral approach to polyhedral dimension
1990
The spectrum spec( 𝒫) of a convex polytope 𝒫⊆ℝ E is defined as the...
Papers per page: