Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Jon
Last name:	Lee
DBLP:	90/4448
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 42 of 42  

Select a publication
Show	Title	Venue	Rating	Date
	Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints.	SIAM J. Discrete Math. 2009, Volume 23	(0)	2010
	Jon Lee, Shmuel Onn, Robert Weismantel. Nonlinear Optimization over a Weighted Independence System.	Algorithmic Aspects in Information and Management, 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings 2009	(0)	2009
	Jon Lee, Maxim Sviridenko, Jan Vondrák. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties.	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings 2009	(0)	2009
	Claudia D'Ambrosio, Jon Lee, Andreas Wächter. A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity.	Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings 2009	(0)	2009
	Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints.	Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009 2009	(0)	2009
	Jon Lee. On the Boundary of Tractability for Nonlinear Discrete Optimization.	Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009 2009	(0)	2009
	Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko. Non-monotone submodular maximization under matroid and knapsack constraints	CoRR 2009, Volume 0	(0)	2009
	Jesús A. De Loera, Jon Lee, S. Margulies, Shmuel Onn. Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz.	Combinatorics, Probability Computing 2009, Volume 18	(0)	2009
	Jon Lee, Shmuel Onn, Robert Weismantel. Approximate Nonlinear Optimization over Weighted Independence Systems.	SIAM J. Discrete Math. 2009, Volume 23	(0)	2009
	Anureet Saxena, Pierre Bonami, Jon Lee. Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs.	Integer Programming and Combinatorial Optimization, 13th International Conference, IPCO 2008, Bertinoro, Italy, May 26-28, 2008, Proceedings 2008	(0)	2008
	Jesús A. De Loera, Jon Lee, P. N. Malkin, S. Margulies. Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility.	Symbolic and Algebraic Computation, International Symposium, ISSAC 2008, Linz/Hagenberg, Austria, July 20-23, 2008, Proceedings 2008	(0)	2008
	Jon Lee, Shmuel Onn, Robert Weismantel. Nonlinear Optimization over a Weighted Independence System	CoRR 2008, Volume 0	(0)	2008
	Jon Lee, Shmuel Onn, Robert Weismantel. On test sets for nonlinear integer maximization.	Oper. Res. Lett. 2008, Volume 36	(0)	2008
	Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn. Nonlinear Matroid Optimization and Experimental Design.	SIAM J. Discrete Math. 2008, Volume 22	(0)	2008
	Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, Jon Lee, Andrea Lodi, François Margot, Nicolas W. Sawaya, Andreas Wächter. An algorithmic framework for convex mixed integer nonlinear programs.	Discrete Optimization 2008, Volume 5	(0)	2008
	Jon Lee. In situ column generation for a cutting-stock problem.	Computers OR 2007, Volume 34	(0)	2007
	Jon Lee. Mixed-integer nonlinear programming: Some modeling and solution issues.	IBM Journal of Research and Development 2007, Volume 51	(0)	2007
	Jon Lee, François Margot. On a Binary-Encoded ILP Coloring Formulation.	INFORMS Journal on Computing 2007, Volume 19	(0)	2007
	Samuel Burer, Jon Lee. Solving maximum-entropy sampling problems using factored masks.	Math. Program. 2007, Volume 109	(0)	2007
	Jon Lee, Adam N. Letchford. Mixed integer programming.	Discrete Optimization 2007, Volume 4	(0)	2007
	Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth. An MINLP Solution Method for a Water Network Problem.	Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings 2006	(0)	2006
	Jon Lee, Janny Leung, Sven de Vries. Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation.	J. Comb. Optim. 2005, Volume 9	(0)	2005
	Don Coppersmith, Jon Lee. Parsimonious binary-encoding in integer programming.	Discrete Optimization 2005, Volume 2	(0)	2005
	Laszlo Ladányi, Jon Lee, Robin Lougee-Heimer. Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem.	Annals OR 2005, Volume 139	(0)	2005
	Jon Lee, François Margot. More on a Binary-Encoded Coloring Formulation.	Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings 2004	(0)	2004
	Jon Lee, Janny Leung, François Margot. Min-up/min-down polytopes.	Discrete Optimization 2004, Volume 1	(0)	2004
	Jon Lee. Cropped Cubes.	J. Comb. Optim. 2003, Volume 7	(0)	2003
	Jon Lee. All-Different Polytopes.	J. Comb. Optim. 2002, Volume 6	(0)	2002
	Vijay S. Iyengar, Jon Lee, Murray Campbell. Evaluating multiple attribute items using queries.	Proceedings 3rd ACM Conference on Electronic Commerce (EC-2001), Tampa, Florida, USA, October 14-17, 2001 2001	(0)	2001
	Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Maximum-entropy remote sampling.	Discrete Applied Mathematics 2001, Volume 108	(0)	2001
	Jon Lee, Dan Wilson. Polyhedral methods for piecewise-linear functions I: the lambda method.	Discrete Applied Mathematics 2001, Volume 108	(0)	2001
	Jon Lee. Orienting Matroids Representable Over Both GF(3) and GF(5).	Eur. J. Comb. 1999, Volume 20	(0)	1999
	Jon Lee, Matt Scobee. A Characterization of the Orientations of Ternary Matroids.	J. Comb. Theory, Ser. B 1999, Volume 77	(0)	1999
	Chun-Wa Ko, Jon Lee, Einar Steingrímsson. The volume of relaxed Boolean-quadric and cut polytopes.	Discrete Mathematics 1997, Volume 163	(0)	1997
	Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams. Continuous Relaxations for Constrained Maximum-Entropy Sampling.	Integer Programming and Combinatorial Optimization, 5th International IPCO Conference, Vancouver, British Columbia, Canada, June 3-5, 1996, Proceedings 1996	(0)	1996
	Jon Lee, Walter D. Morris Jr.. Geometric Comparison of Combinatorial Polytopes.	Discrete Applied Mathematics 1994, Volume 55	(0)	1994
	Janny Leung, Jon Lee. More facets from fences for linear ordering and acyclic subgraph polytopes.	Discrete Applied Mathematics 1994, Volume 50	(0)	1994
	Jon Lee, Jennifer Ryan. Matroid Applications and Algorithms.	INFORMS Journal on Computing 1992, Volume 4	(0)	1992
	Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford. Crashing a maximum-weight complementary basis.	Math. Program. 1992, Volume 54	(0)	1992
	Jon Lee. Canonical equation sets for classes of concordant polytopes.	Discrete Applied Mathematics 1990, Volume 28	(0)	1990
	Jon Lee. The incidence structure of subspaces with well-scaled frames.	J. Comb. Theory, Ser. B 1990, Volume 50	(0)	1990
	Jon Lee. A Spectral Approach to Polyhedral Dimension.	Math. Program. 1990, Volume 47	(0)	1990

Your query returned 42 matches in the database.