default search action
Jon Lee 0001
Person information
- affiliation: University of Michigan, Deptartment of Industrial and Operations Engineering, Ann Arbor, MI, USA
- affiliation: IBM T. J. Watson Research Center, Yorktown Heights, NY, USA
- affiliation: University of Kentucky, Department of Mathematics, Lexington, KY, USA
- affiliation: Yale University, New Haven, CT, USA
- affiliation: Cornell University, Ithaca, NY, USA
Other persons with the same name
- Jon Lee 0002 — Wright-Patterson Air Force Base, Flight Dynamics Laboratory, OH, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j103]Marcia Fampa, Jon Lee
:
An outer-approximation algorithm for maximum-entropy sampling. Discret. Appl. Math. 347: 271-284 (2024) - [j102]Yongchun Li
D-Optimal Data Fusion: Exact and Approximation Algorithms. INFORMS J. Comput. 36(1): 97-120 (2024) - [j101]Zhongzhu Chen
Technical Note - Masking Anstreicher's linx Bound for Improved Entropy Bounds. Oper. Res. 72(2): 591-603 (2024) - [j100]Luze Xu
Gaining or losing perspective for convex multivariate functions on a simplex. J. Glob. Optim. 89(2): 379-413 (2024) - [j99]Elisabeth Gaar
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Math. Program. 206(1): 91-124 (2024) - [j98]Gabriel Ponte
On computing sparse generalized inverses. Oper. Res. Lett. 52: 107058 (2024) - [j97]Steffen Borgwardt
On the Combinatorial Diameters of Parallel and Series Connections. SIAM J. Discret. Math. 38(1): 485-503 (2024) - [c33]Yushan Qu, Jon Lee:
On Disjunction Convex Hulls by Lifting. ISCO 2024: 3-15 - [c32]Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Felipe Sinnecker:
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location. ISCO 2024: 16-29 - [c31]Gabriel Ponte
Convex Relaxation for the Generalized Maximum-Entropy Sampling Problem. SEA 2024: 25:1-25:14 - 2023
- [j96]Hessa Al-Thani, Jon Lee
Tridiagonal maximum-entropy sampling and tridiagonal masks. Discret. Appl. Math. 337: 120-138 (2023) - [j95]Zhongzhu Chen
On Computing with Some Convex Relaxations for the Maximum-Entropy Sampling Problem. INFORMS J. Comput. 35(2): 368-385 (2023) - [j94]Jon Lee
Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions. J. Optim. Theory Appl. 196(1): 1-35 (2023) - [c30]Zhongzhu Chen, Marcia Fampa, Jon Lee:
Generalized Scaling for the Constrained Maximum-Entropy Sampling Problem. ACDA 2023: 110-118 - 2022
- [j93]Jon Lee, Ali Ridha Mahjoub, Giovanni Rinaldi:
Preface: Combinatorial Optimization ISCO 2018. Discret. Appl. Math. 308: 1-3 (2022) - [j92]Jon Lee
Gaining or losing perspective. J. Glob. Optim. 82(4): 835-862 (2022) - [c29]Elisabeth Gaar
SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. IPCO 2022: 262-276 - [c28]Marcia Fampa, Jon Lee:
An Outer-Approximation Algorithm for Maximum-Entropy Sampling. ISCO 2022: 130-142 - [i15]Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis:
On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. CoRR abs/2207.05014 (2022) - 2021
- [j91]Yan Deng, Huiwen Jia
Scenario Grouping and Decomposition Algorithms for Chance-Constrained Programs. INFORMS J. Comput. 33(2): 757-773 (2021) - [j90]Marcia Fampa, Jon Lee
Convexification of bilinear forms through non-symmetric lifting. J. Glob. Optim. 80(2): 287-305 (2021) - [j89]Marcia Fampa, Jon Lee
Experimental analysis of local searches for sparse reflexive generalized inverses. J. Glob. Optim. 81(4): 1057-1093 (2021) - [j88]Zhongzhu Chen, Marcia Fampa, Amélie Lambert, Jon Lee
Mixing convex-optimization bounds for maximum-entropy sampling. Math. Program. 188(2): 539-568 (2021) - [j87]Marcia Fampa, Jon Lee, Gabriel Ponte
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. Open J. Math. Optim. 2: 1-14 (2021) - [j86]Luze Xu
Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search. SIAM J. Optim. 31(3): 1722-1747 (2021) - [c27]Hessa Al-Thani, Jon Lee:
Tridiagonal Maximum-Entropy Sampling and Tridiagonal Masks. LAGOS 2021: 127-134 - [i14]Elisabeth Gaar, Jon Lee, Ivana Ljubic, Markus Sinnl, Kübra Taninmis
SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs. CoRR abs/2111.06824 (2021) - 2020
- [j85]Jon Lee
Volume computation for sparse Boolean quadric relaxations. Discret. Appl. Math. 275: 79-94 (2020) - [j84]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge
Correction to: Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 36(1): 177-179 (2020) - [j83]Jon Lee
Generalized maximum-entropy sampling. INFOR Inf. Syst. Oper. Res. 58(2): 168-181 (2020) - [j82]Claudia D'Ambrosio, Marcia Fampa
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. Optim. Lett. 14(2): 409-415 (2020) - [j81]Jon Lee
On an SDP relaxation for kissing number. Optim. Lett. 14(2): 417-422 (2020) - [j80]Hessa Al-Thani, Jon Lee
An R Package for Generating Covariance Matrices for Maximum-Entropy Sampling from Precipitation Chemistry Data. Oper. Res. Forum 1(3) (2020) - [c26]Claudia D'Ambrosio, Jon Lee, Daphne E. Skipper, Dimitri Thomopulos
Handling Separable Non-convexities Using Disjunctive Cuts. ISCO 2020: 102-114 - [c25]Jon Lee, Joseph Paat, Ingo Stallknecht, Luze Xu
Improving Proximity Bounds Using Sparsity. ISCO 2020: 115-127 - [i13]Hessa Al-Thani, Jon Lee:
An R Package for generating covariance matrices for maximum-entropy sampling from precipitation chemistry data. CoRR abs/2003.06316 (2020) - [i12]Jon Lee, Daphne E. Skipper, Emily Speakman, Luze Xu:
Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions. CoRR abs/2009.07178 (2020) - [i11]Marcia Fampa, Jon Lee, Gabriel Ponte:
Trading off 1-norm and sparsity against rank for linear models using mathematical optimization: 1-norm minimizing partially reflexive ah-symmetric generalized inverses. CoRR abs/2011.02509 (2020)
2010 – 2019
- 2019
- [j79]Luze Xu
More Virtuous Smoothing. SIAM J. Optim. 29(2): 1240-1259 (2019) - [c24]Victor K. Fuentes, Marcia Fampa, Jon Lee:
Diving for Sparse Partially-Reflexive Generalized Inverses. WCGO 2019: 89-98 - [c23]Jon Lee, Daphne E. Skipper, Emily Speakman:
Gaining or Losing Perspective. WCGO 2019: 387-397 - [c22]Luze Xu
On Proximity for k-Regular Mixed-Integer Linear Optimization. WCGO 2019: 438-447 - 2018
- [j78]Jon Lee
Computing with an algebraic-perturbation variant of Barvinok's algorithm. Discret. Appl. Math. 240: 63-77 (2018) - [j77]Emily Speakman
On branching-point selection for trilinear monomials in spatial branch-and-bound: the hull relaxation. J. Glob. Optim. 72(2): 129-153 (2018) - [j76]Jon Lee
Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations. Math. Program. 170(1): 121-140 (2018) - [j75]Xiangkun Shen
Approximating graph-constrained max-cut. Math. Program. 172(1-2): 35-58 (2018) - [j74]Martin Koutecký
Approximating max-cut under graph-MSO constraints. Oper. Res. Lett. 46(6): 592-598 (2018) - [j73]Marcia Fampa
On sparse reflexive generalized inverse. Oper. Res. Lett. 46(6): 605-610 (2018) - [e2]Jon Lee, Giovanni Rinaldi, Ali Ridha Mahjoub:
Combinatorial Optimization - 5th International Symposium, ISCO 2018, Marrakesh, Morocco, April 11-13, 2018, Revised Selected Papers. Lecture Notes in Computer Science 10856, Springer 2018, ISBN 978-3-319-96150-7 [contents] - [i10]Martin Koutecký, Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Approximating Max-Cut under Graph-MSO Constraints. CoRR abs/1803.05718 (2018) - [i9]Marcia Fampa, Jon Lee:
On Sparse Reflexive Generalized Inverses. CoRR abs/1807.03074 (2018) - 2017
- [j72]Marcia Fampa
On global optimization with indefinite quadratics. EURO J. Comput. Optim. 5(3): 309-337 (2017) - [j71]Jon Lee
Another pedagogy for mixed-integer Gomory. EURO J. Comput. Optim. 5(4): 455-466 (2017) - [j70]Jon Lee
Virtuous smoothing for global optimization. J. Glob. Optim. 69(3): 677-697 (2017) - [j69]Emily Speakman, Jon Lee:
Quantifying Double McCormick. Math. Oper. Res. 42(4): 1230-1253 (2017) - [j68]Qi He, Jon Lee:
Another pedagogy for pure-integer Gomory. RAIRO Oper. Res. 51(1): 189-197 (2017) - [c21]Emily Speakman, Han Yu, Jon Lee:
Experimental Validation of Volume-Based Comparison for Double-McCormick Relaxations. CPAIOR 2017: 229-243 - 2016
- [j67]Marcia Fampa
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space. Comput. Optim. Appl. 65(1): 47-71 (2016) - [j66]Volker Kaibel, Jon Lee, Matthias Walter
Extended Formulations for Independence Polytopes of Regular Matroids. Graphs Comb. 32(5): 1931-1944 (2016) - [j65]Marcia Fampa
An overview of exact algorithms for the Euclidean Steiner tree problem in n-space. Int. Trans. Oper. Res. 23(5): 861-874 (2016) - [c20]Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Max-Cut Under Graph Constraints. IPCO 2016: 50-62 - [c19]Victor K. Fuentes, Jon Lee:
Low-Rank/Sparse-Inverse Decomposition via Woodbury. OR 2016: 111-117 - 2015
- [j64]Jesús A. De Loera, Jon Lee
Weak orientability of matroids and polynomial equations. Eur. J. Comb. 50: 56-71 (2015) - [j63]Jon Lee, Daphne E. Skipper:
An algebraic-perturbation variant of Barvinok's algorithm. Electron. Notes Discret. Math. 50: 15-20 (2015) - [j62]Jon Lee, Jens Vygen:
Preface. Math. Program. 154(1-2): 1-2 (2015) - [j61]Jesús A. De Loera, Raymond Hemmecke, Jon Lee:
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds-Karp to Bland and Beyond. SIAM J. Optim. 25(4): 2494-2511 (2015) - [c18]Claudia D'Ambrosio, Marcia Fampa
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. SEA 2015: 122-133 - [c17]Andrew Orso, Jon Lee, Siqian Shen:
Submodular Minimization in the Context of Modern LP and MILP Methods and Solvers. SEA 2015: 193-204 - [i8]Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge:
Extended Formulations for Independence Polytopes of Regular Matroids. CoRR abs/1504.03872 (2015) - [i7]Jon Lee, Viswanath Nagarajan, Xiangkun Shen:
Max-Cut under Graph Constraints. CoRR abs/1511.08152 (2015) - 2014
- [j60]Leo Liberti
On the number of realizations of certain Henneberg graphs arising in protein conformation. Discret. Appl. Math. 165: 213-232 (2014) - [j59]Jon Lee
Optimal rank-sparsity decomposition. J. Glob. Optim. 60(2): 307-315 (2014) - [e1]Jon Lee, Jens Vygen:
Integer Programming and Combinatorial Optimization - 17th International Conference, IPCO 2014, Bonn, Germany, June 23-25, 2014. Proceedings. Lecture Notes in Computer Science 8494, Springer 2014, ISBN 978-3-319-07556-3 [contents] - 2013
- [j58]Jesús A. De Loera, Jon Lee
Systems of Polynomials for Detecting Orientable Matroids. Electron. Notes Discret. Math. 43: 343-353 (2013) - [j57]Binyamin Krauss, Jon Lee, Daniel Newman:
Optimizing the Assignment of Students to Classes in an Elementary School. INFORMS Trans. Educ. 14(1): 39-44 (2013) - [j56]Pierre Bonami, Jon Lee
On branching rules for convex mixed-integer nonlinear optimization. ACM J. Exp. Algorithmics 18 (2013) - [j55]Jon Lee
Matroid Matching: The Power of Local Search. SIAM J. Comput. 42(1): 357-379 (2013) - 2012
- [j54]Jon Lee
A matroid view of key theorems for edge-swapping algorithms. Math. Methods Oper. Res. 76(2): 125-127 (2012) - [j53]Jon Lee
The quadratic Graver cone, quadratic integer minimization, and extensions. Math. Program. 136(2): 301-323 (2012) - [j52]Carlile Lavor
Discretization orders for distance geometry problems. Optim. Lett. 6(4): 783-796 (2012) - 2011
- [j51]Jesús A. De Loera, Jon Lee
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz. J. Symb. Comput. 46(11): 1260-1283 (2011) - [j50]Anureet Saxena, Pierre Bonami, Jon Lee
Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130(2): 359-413 (2011) - [c16]Leo Liberti
On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem. COCOA 2011: 322-342 - [c15]Giacomo Nannicini, Pietro Belotti
A Probing Algorithm for MINLP with Failure Prediction by SVM. CPAIOR 2011: 154-169 - 2010
- [j49]Sonia Cafieri
On convex relaxations of quadrilinear terms. J. Glob. Optim. 47(4): 661-685 (2010) - [j48]Jon Lee
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. Math. Oper. Res. 35(4): 795-806 (2010) - [j47]Yael Berstein, Jon Lee
Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124(1-2): 233-253 (2010) - [j46]Anureet Saxena, Pierre Bonami, Jon Lee
Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1-2): 383-411 (2010) - [j45]John A. Gunnels, Jon Lee
Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization. Math. Program. Comput. 2(2): 103-124 (2010) - [j44]Jon Lee
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints. SIAM J. Discret. Math. 23(4): 2053-2078 (2010) - [c14]Pietro Belotti
Feasibility-Based Bounds Tightening via Fixed Points. COCOA (1) 2010: 65-76 - [c13]Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti:
On the Convergence of Feasibility based Bounds Tightening. CTW 2010: 21-24 - [c12]Jon Lee
Matroid matching: the power of local search. STOC 2010: 369-378 - [p1]Raymond Hemmecke, Matthias Köppe
Nonlinear Integer Programming. 50 Years of Integer Programming 2010: 561-618 - [i6]Jon Lee, Shmuel Onn, Robert Weismantel:
Intractability of approximate multi-dimensional nonlinear optimization on independence systems. CoRR abs/1001.5056 (2010) - [i5]Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel:
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions. CoRR abs/1006.0773 (2010) - [i4]Leo Liberti, Benoît Masson, Jon Lee, Carlile Lavor, Antonio Mucherino:
On the number of solutions of the discretizable molecular distance geometry problem. CoRR abs/1010.1834 (2010)
2000 – 2009
- 2009
- [j43]Jesús A. De Loera, Jon Lee
Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Comb. Probab. Comput. 18(4): 551-582 (2009) - [j42]Jesús A. De Loera, David C. Haws, Jon Lee, Allison O'Hair:
Computation in multicriteria matroid optimization. ACM J. Exp. Algorithmics 14 (2009) - [j41]Pietro Belotti
Branching and bounds tighteningtechniques for non-convex MINLP. Optim. Methods Softw. 24(4-5): 597-634 (2009) - [j40]Jon Lee
Approximate Nonlinear Optimization over Weighted Independence Systems. SIAM J. Discret. Math. 23(4): 1667-1681 (2009) - [c11]Jon Lee
Nonlinear Optimization over a Weighted Independence System. AAIM 2009: 251-264 - [c10]Jon Lee
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. APPROX-RANDOM 2009: 244-257 - [c9]Jon Lee:
On the Boundary of Tractability for Nonlinear Discrete Optimization. CTW 2009: 373-383 - [c8]Claudia D'Ambrosio
A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. ESA 2009: 107-118 - [c7]Jon Lee
Non-monotone submodular maximization under matroid and knapsack constraints. STOC 2009: 323-332 - [i3]Jon Lee, Vahab S. Mirrokni, Viswanath Nagarajan, Maxim Sviridenko:
Non-monotone submodular maximization under matroid and knapsack constraints. CoRR abs/0902.0353 (2009) - 2008
- [j39]Pierre Bonami, Lorenz T. Biegler
An algorithmic framework for convex mixed integer nonlinear programs. Discret. Optim. 5(2): 186-204 (2008) - [j38]Jon Lee
On test sets for nonlinear integer maximization. Oper. Res. Lett. 36(4): 439-443 (2008) - [j37]Yael Berstein, Jon Lee
Nonlinear Matroid Optimization and Experimental Design. SIAM J. Discret. Math. 22(3): 901-919 (2008) - [c6]Anureet Saxena, Pierre Bonami, Jon Lee
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. IPCO 2008: 17-33 - [c5]Jesús A. De Loera, Jon Lee
Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility. ISSAC 2008: 197-206 - [i2]Jon Lee, Shmuel Onn, Robert Weismantel:
Nonlinear Optimization over a Weighted Independence System. CoRR abs/0805.0954 (2008) - 2007
- [j36]Jon Lee
In situ column generation for a cutting-stock problem. Comput. Oper. Res. 34(8): 2345-2358 (2007) - [j35]Jon Lee
Mixed integer programming. Discret. Optim. 4(1): 1-2 (2007) - [j34]Jon Lee
Mixed-integer nonlinear programming: Some modeling and solution issues. IBM J. Res. Dev. 51(3/4): 489-497 (2007) - [j33]Jon Lee, François Margot:
On a Binary-Encoded ILP Coloring Formulation. INFORMS J. Comput. 19(3): 406-415 (2007) - [j32]Samuel Burer, Jon Lee
Solving maximum-entropy sampling problems using factored masks. Math. Program. 109(2-3): 263-281 (2007) - [i1]Yael Berstein, Jon Lee, Hugo Maruri-Aguilar, Shmuel Onn, Eva Riccomagno, Robert Weismantel, Henry P. Wynn:
Nonlinear Matroid Optimization and Experimental Design. CoRR abs/0707.4618 (2007) - 2006
- [j31]Jon Lee, John F. Raffensperger
Using AMPL for Teaching the TSP. INFORMS Trans. Educ. 7(1): 37-69 (2006) - [c4]Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth:
An MINLP Solution Method for a Water Network Problem. ESA 2006: 696-707 - 2005
- [j30]Laszlo Ladányi, Jon Lee
Rapid Prototyping of Optimization Algorithms Using COIN-OR: A Case Study Involving the Cutting-Stock Problem. Ann. Oper. Res. 139(1): 243-265 (2005) - [j29]Don Coppersmith, Jon Lee
Parsimonious binary-encoding in integer programming. Discret. Optim. 2(3): 190-200 (2005) - [j28]Jon Lee
Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. J. Comb. Optim. 9(1): 59-67 (2005) - 2004
- [j27]Jon Lee
Min-up/min-down polytopes. Discret. Optim. 1(1): 77-85 (2004) - [c3]Jon Lee, François Margot:
More on a Binary-Encoded Coloring Formulation. IPCO 2004: 271-282 - 2003
- [j26]Jon Lee
Cropped Cubes. J. Comb. Optim. 7(2): 169-178 (2003) - [j25]Jon Lee, Joy Williams:
A linear integer programming bound for maximum-entropy sampling. Math. Program. 94(2-3): 247-256 (2003) - 2002
- [j24]Jon Lee
All-Different Polytopes. J. Comb. Optim. 6(3): 335-352 (2002) - 2001
- [j23]Kurt M. Anstreicher, Marcia Fampa
Maximum-entropy remote sampling. Discret. Appl. Math. 108(3): 211-226 (2001) - [j22]Jon Lee
Polyhedral methods for piecewise-linear functions I: the lambda method. Discret. Appl. Math. 108(3): 269-285 (2001) - [c2]Vijay S. Iyengar, Jon Lee, Murray Campbell:
Evaluating multiple attribute items using queries. EC 2001: 144-153
1990 – 1999
- 1999
- [j21]Jon Lee:
Orienting Matroids Representable Over Both GF(3) and GF(5). Eur. J. Comb. 20(8): 833-838 (1999) - [j20]Jon Lee
A Characterization of the Orientations of Ternary Matroids. J. Comb. Theory B 77(2): 263-291 (1999) - [j19]Kurt M. Anstreicher, Marcia Fampa
Using continuous nonlinear relaxations to solve. constrained maximum-entropy sampling problems. Math. Program. 85(2): 221-240 (1999) - 1998
- [j18]Jill Hardin, Jon Lee, Janny Leung:
On the boolean-quadric packinguncapacitated facility-location polytope. Ann. Oper. Res. 83: 77-94 (1998) - [j17]Jon Lee:
Constrained Maximum-Entropy Sampling. Oper. Res. 46(5): 655-664 (1998) - 1997
- [j16]Chun-Wa Ko, Jon Lee, Einar Steingrímsson
The volume of relaxed Boolean-quadric and cut polytopes. Discret. Math. 163(1-3): 293-298 (1997) - [j15]Jon Lee:
Classroom Note: Hoffman's Circle Untangled. SIAM Rev. 39(1): 98-105 (1997) - 1996
- [c1]Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams:
Continuous Relaxations for Constrained Maximum-Entropy Sampling. IPCO 1996: 234-248 - 1995
- [j14]Chun-Wa Ko, Jon Lee, Maurice Queyranne:
An Exact Algorithm for Maximum Entropy Sampling. Oper. Res. 43(4): 684-691 (1995) - 1994
- [j13]Janny Leung
More facets from fences for linear ordering and acyclic subgraph polytopes. Discret. Appl. Math. 50(2): 185-200 (1994) - [j12]Jon Lee
Geometric Comparison of Combinatorial Polytopes. Discret. Appl. Math. 55(2): 163-182 (1994) - [j11]Jon Lee, Jennifer Ryan:
Local bipartite turán graphs and graph partitioning. Networks 24(3): 131-145 (1994) - 1993
- [j10]Brenda L. Dietrich, Jon Lee
Order selection on a single machine with high set-up costs. Ann. Oper. Res. 43(7): 379-396 (1993) - [j9]Jon Lee
A comparison of two edge-coloring formulations. Oper. Res. Lett. 13(4): 215-223 (1993) - 1992
- [j8]Jon Lee, Jennifer Ryan:
Matroid Applications and Algorithms. INFORMS J. Comput. 4(1): 70-98 (1992) - [j7]Jon Lee:
On Constrained Bottleneck Extrema. Oper. Res. 40(4): 813-814 (1992) - [j6]Kurt M. Anstreicher, Jon Lee
Crashing a maximum-weight complementary basis. Math. Program. 54: 281-294 (1992) - 1990
- [j5]Jon Lee
Canonical equation sets for classes of concordant polytopes. Discret. Appl. Math. 28(3): 207-221 (1990) - [j4]Jon Lee
The incidence structure of subspaces with well-scaled frames. J. Comb. Theory B 50(2): 265-287 (1990) - [j3]Jon Lee:
Characterizations of the Dimension for Classes of Concordant Polytopes. Math. Oper. Res. 15(1): 139-154 (1990) - [j2]Jon Lee
A Spectral Approach to Polyhedral Dimension. Math. Program. 47: 441-459 (1990)
1980 – 1989
- 1989
- [j1]Jon Lee:
Turán's Triangle Theorem and Binary Matroids. Eur. J. Comb. 10(1): 85-90 (1989)
Coauthor Index
Marcia Helena Costa Fampa
aka: Marcia Fampa
aka: Marcia Fampa
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: