The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jon Lee: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Cristiana Bragalli, Claudia D'Ambrosio, Jon Lee, Andrea Lodi, Paolo Toth
    An MINLP Solution Method for a Water Network Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:696-707 [Conf]
  2. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
    Continuous Relaxations for Constrained Maximum-Entropy Sampling. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:234-248 [Conf]
  3. Jon Lee, François Margot
    More on a Binary-Encoded Coloring Formulation. [Citation Graph (0, 0)][DBLP]
    IPCO, 2004, pp:271-282 [Conf]
  4. Vijay S. Iyengar, Jon Lee, Murray Campbell
    Evaluating multiple attribute items using queries. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Electronic Commerce, 2001, pp:144-153 [Conf]
  5. Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
    Maximum-entropy remote sampling. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:3, pp:211-226 [Journal]
  6. Jon Lee, Walter D. Morris Jr.
    Geometric Comparison of Combinatorial Polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:2, pp:163-182 [Journal]
  7. Jon Lee, Dan Wilson
    Polyhedral methods for piecewise-linear functions I: the lambda method. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:3, pp:269-285 [Journal]
  8. Janny Leung, Jon Lee
    More facets from fences for linear ordering and acyclic subgraph polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:50, n:2, pp:185-200 [Journal]
  9. Jon Lee
    Orienting Matroids Representable Over Both GF(3) and GF(5). [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:8, pp:833-838 [Journal]
  10. Jon Lee
    All-Different Polytopes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2002, v:6, n:3, pp:335-352 [Journal]
  11. Jon Lee
    Cropped Cubes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:2, pp:169-178 [Journal]
  12. Jon Lee, Janny Leung, Sven de Vries
    Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2005, v:9, n:1, pp:59-67 [Journal]
  13. Jon Lee
    The incidence structure of subspaces with well-scaled frames. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:50, n:2, pp:265-287 [Journal]
  14. Jon Lee, Matt Scobee
    A Characterization of the Orientations of Ternary Matroids. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:77, n:2, pp:263-291 [Journal]
  15. Kurt M. Anstreicher, Jon Lee, Thomas F. Rutherford
    Crashing a maximum-weight complementary basis. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1992, v:54, n:, pp:281-294 [Journal]
  16. Jon Lee
    A Spectral Approach to Polyhedral Dimension. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:47, n:, pp:441-459 [Journal]
  17. Samuel Burer, Jon Lee
    Solving maximum-entropy sampling problems using factored masks. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:109, n:2-3, pp:263-281 [Journal]
  18. Chun-Wa Ko, Jon Lee, Einar Steingrímsson
    The volume of relaxed Boolean-quadric and cut polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:293-298 [Journal]

  19. Nonlinear Optimization over a Weighted Independence System. [Citation Graph (, )][DBLP]


  20. Submodular Maximization over Multiple Matroids via Generalized Exchange Properties. [Citation Graph (, )][DBLP]


  21. A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. [Citation Graph (, )][DBLP]


  22. Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs. [Citation Graph (, )][DBLP]


  23. Hilbert's nullstellensatz and an algorithm for proving combinatorial infeasibility. [Citation Graph (, )][DBLP]


  24. Non-monotone submodular maximization under matroid and knapsack constraints. [Citation Graph (, )][DBLP]


  25. Matroid matching: the power of local search. [Citation Graph (, )][DBLP]


  26. On the Boundary of Tractability for Nonlinear Discrete Optimization. [Citation Graph (, )][DBLP]


  27. In situ column generation for a cutting-stock problem. [Citation Graph (, )][DBLP]


  28. Nonlinear Optimization over a Weighted Independence System [Citation Graph (, )][DBLP]


  29. Non-monotone submodular maximization under matroid and knapsack constraints [Citation Graph (, )][DBLP]


  30. The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions [Citation Graph (, )][DBLP]


  31. Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. [Citation Graph (, )][DBLP]


  32. Canonical equation sets for classes of concordant polytopes. [Citation Graph (, )][DBLP]


Search in 0.037secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002