Nonlinear Integer Programming (2009)
Hemmecke, Raymond, Köppe, Matthias, Lee, Jon, Weismantel, Robert
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached...
H.: Nonlinear matroid optimization and experimental design (2009)
Yael Berstein, Jon Lee, Hugo Maruri-aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, ...
Abstract. We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multicriteria...
Non-monotone submodular maximization under matroid and knapsack constraints (2009)
Lee, Jon, Mirrokni, Vahab, Nagarjan, Viswanath, Sviridenko, Maxim
Submodular function maximization is a central problem in combinatorial optimization, generalizing many important problems including Max Cut in directed/undirected graphs and in hypergraphs, certain...
Nonlinear optimization for matroid intersection and extensions (2008)
Berstein, Yael, Lee, Jon, Onn, Shmuel, Weismantel, Robert
We address optimization of nonlinear functions of the form $f(Wx)$, where $f:\R^d\to \R$ is a nonlinear function, $W$ is a $d\times n$ matrix, and feasible $x$ are in some large finite set $F$ of...
FULL LENGTH PAPER Solving (2008)
maximum-entropy sampling problems using factored masks
H.: Nonlinear matroid optimization and experimental design (2008)
Yael Berstein, Jon Lee (rip, Hugo Maruri-aguilar, Robert Weismantel (rip, Henry Wynn, ...
Starting in 2007, the MFO publishes a preprint series which mainly contains research results related to a longer stay in Oberwolfach. In particular, this concerns the Research in Pairs-Programme...
A simple pattern-matching algorithm for recovering empty nodes and their antecedents (2008)
Don Coppersmith, Jon Lee, Jon Lee
LIMITED DISTRIBUTION NOTICE: This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research
Nonlinear matroid optimization and experimental design (2008)
Bernstein, Yael, Lee, Jon, Maruri-Aguilar, Hugo, Onn, Shmeul, Riccomagno, Eva, Weismantel, Robert, ...
Research Contributions Overview Shmuel Onn (2008)
Imre Bárány, Yael Berstein, Jesus De Loera, Antoine Deza, Raymond Hemmecke, Peter Kleinschmidt, ...
My research aims at the development of efficient algebraic and geometric methods for discrete optimization, the investigation of the underlying mathematical structures, and the employment of such...
Nonlinear Optimization over a Weighted Independence System (2008)
Jon Lee, Shmuel Onn, Robert Weismantel, Oberwolfach Preprints (owp
Starting in 2007, the MFO publishes a preprint series which mainly contains research results related to a longer stay in Oberwolfach. In particular, this concerns the Research in Pairs-Programme...
Research Report No. 2000{19 INDIVISIBILITY AND DIVISIBILITY POLYTOPES (2007)
We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p |the indivisibility polytopes, aswell as the more general...
New Upper Bounds For Maximum-Entropy Sampling (2007)
Alan Hoffman Jon, Jon Lee, Joy Williams
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the...
INDIVISIBILITY AND DIVISIBILITY POLYTOPES (2007)
We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p |the indivisibility polytopes, aswell as the more general...
Nonlinear Matroid Optimization and Experimental Design (2007)
Berstein, Yael, Lee, Jon, Maruri-Aguilar, Hugo, Onn, Shmuel, Riccomagno, Eva, Weismantel, Robert, ...
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization....
In Situ Column Generation for a Cutting-Stock Problem (2007)
been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be...
Nonlinear Matroid Optimization and Experimental Design (2007)
Yael Berstein, Jon Lee, Hugo Maruri-aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, ...
We study the problem of optimizing nonlinear objective functions over matroids presented by oracles or explicitly. Such functions can be interpreted as the balancing of multi-criteria optimization....
Jesus De Loera, Jon Lee, Susan Margulies, Shmuel Onn
Systems of polynomial equations over the complex or real numbers can be used to model combinatorial problems. In this way, a combinatorial problem is feasible (e.g. a graph is 3-colorable,...
OR (COmputational INfrastructure (2007)
Pierre Bonami, John J. Forrest, Jon Lee, Andreas Wächter
We describe the rapid development of
An MINLP Solution Method for a Water Network Problem,’’ Algorithms—ESA 2006 (2006)
Christiana Bragalli, Jon Lee, Andrea Lodi, Paolo Toth, Cristiana Bragalli, Jon Lee, ...
LIMITED DISTRIBUTION NOTICE: This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. Ithas been issued as a Research Report for...
Pierre Bonami, Lorenz T. Biegler, Andrew R. Conn, Gérard Cornuéjols, Ignacio E. Grossmann, Carl D. Laird, ...
algorithmic framework for convex mixed integer
A masked spectral bound for maximum-entropy sampling (2004)
Kurt Anstreicher, Kurt Anstreicher, Jon Lee, Jon Lee
LIMITED DISTRIBUTION NOTICE: This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for...
New upper bounds for maximum-entropy sampling (2001)
Alan Hoffman, Jon Lee, Joy Williams
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer’s inequality. Further new upper bounds combine the...
New upper bounds for maximum-entropy sampling (2001)
Alan Hoffman, Jon Lee, Joy Williams
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the...
New Upper Bounds for Maximum-Entropy Sampling (2000)
Alan Hoffman, Jon Lee, Joy Williams
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the...
Indivisibility And Divisibility Polytopes (2000)
We study the the polytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p --- the indivisibility polytopes, as well as the more general...
Generalized Maximum-Entropy Sampling (1999)
We introduce the Generalized Constrained Maximum-Entropy Sampling Problem (GCMESP) as a common generalization of the ordinary Constrained Maximum-Entropy Sampling Problem (CMESP) and the Constrained...
Polyhedral Methods for Piecewise-Linear Functions I: The Lambda Method (1999)
The \lambda method" is a well-known method for using integer linear-programming methods to model separable piecewise-linear functions in the context of optimization formulations. We extend the...
A polytope for a product of real linear functions in 0/1 variables (1999)
Don Coppersmith, Jon Lee, Janny Leung
In the context of integer programming, we develop a polyhedral method for linearizing a product of a pair of real linear functions in 0/1 variables. As an example, by writing a pair of integer...
A Characterization of the Orientations of Ternary Matroids (1999)
A matroid or oriented matroid is dyadic if it has a rational representation with all nonzero subdeterminants in f\Sigma2 k : k 2 Zg. Our main theorem is that an oriented matroid is dyadic if and only...
Constrained maximum-entropy sampling (1998)
Information “Chance and chance alone has a message for us. Everything that occurs out of necessity, everything expected, repeated day in and day out, is mute. Only chance can speak to us. We read...
Comparison of Spectral and Hadamard Bounds for D-Optimality (1998)
Chun Wa Ko, Jon Lee, Kevin Wayne
: Weintroduce a spectral bound for D-optimal design problems, based on singular values. We compare the spectral bound to a bound based on Hadamard's inequality whichwas introduced byWelch. In...
Using Continuous Nonlinear Relaxations to Solve Constrained Maximum-Entropy Sampling Problems (1998)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
We consider a new nonlinear relaxation for the Constrained Maximum-Entropy Sampling Problem -- the problem of choosing the s × s principal submatrix with maximal determinant from a given n...
Polyhedral Methods for Piecewise-Linear Functions I: The Lambda Method (1998)
The "lambda method" is a well-known method for using integer linear-programming methods to model separable piecewise-linear functions in the context of optimization formulations. We extend...
Maximum-Entropy Remote Sampling (1998)
Kurt Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
We consider the "remote--sampling" problem of choosing a subset S, with jSj = s, from a set N of observable random variables so as to obtain as much information as possible about a set T of...
A Characterization of the Orientations of Ternary Matroids (1998)
A matroid or oriented matroid is dyadic if it has a rational representation with all nonzero subdeterminants in f\Sigma2 k : k 2 Zg. Our main theorem is that an oriented matroid is dyadic if and only...
The volume of relaxed Boolean-quadric and cut polytopes. (1997)
Chun-Wa Ko, Jon Lee, Einar Steingrimsson
Abstract. For n 2, the boolean quadric polytope Pn is the convex hull in d:= \Gamma n+1 2
Orienting matroids representable over both GF(3) and GF(5) (1997)
For matroids representable over both GF[3] and GF[5], we provide a recipe for constructing an orientation.
Using Continuous Nonlinear Relaxations to Solve Constrained Maximum-Entropy Sampling Problems (1997)
Kurt Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
We consider a new nonlinear relaxation for the Constrained Maximum-Entropy Sampling Problem -- the problem of choosing the s \Theta s principal submatrix with maximal determinant from a given n...
Continuous Relaxations for Constrained Maximum-Entropy Sampling (1996)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
. We consider a new nonlinear relaxation for the Constrained Maximum Entropy Sampling Problem -- the problem of choosing the s \Theta s principal submatrix with maximal determinant from a given n...
Using Continuous Nonlinear Relaxations to Solve Constrained Maximum-Entropy Sampling Problems (1996)
Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
We consider a new nonlinear relaxation for the Constrained Maximum-Entropy Sampling Problem -- the problem of choosing the s \Theta s principal submatrix with maximal determinant from a given n...
Jon Lee, Modelingall Different, Modelingall Different
all different[{yi: i ∈ M}; C] Constraint programming: Don’t instantiate with variables; treat implicitly with combinatorial algorithms and search strategies. IBM/Swiss OR Workshop, July 2003 –...
New upper bounds for maximum-entropy sampling
HOFFMAN, Alan, LEE, Jon, WILLIAMS, Joy
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use...
Indivisibility and divisibility polytopes.
We study thep olytopes of binary n-strings that encode (positive) integers that are not divisible by a particular positive integer p - the indivisibility polytopes, as well as the more general...