Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Shmuel Onn
2010 – today
- 2013
[j42]Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk: n-Fold integer programming in cubic time. Math. Program. 137(1-2): 325-341 (2013)- 2012
- [j41]Michel Baes, Alberto Del Pia, Yurii Nesterov, Shmuel Onn, Robert Weismantel: Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes. Math. Program. 134(1): 305-322 (2012)
- [j40]Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel: The quadratic Graver cone, quadratic integer minimization, and extensions. Math. Program. 136(2): 301-323 (2012)
- [i7]Shmuel Onn, Michal Rozenblit: Convex Integer Optimization by Constantly Many Linear Counterparts. CoRR abs/1208.5639 (2012)
- 2011
- [j39]Shmuel Onn, Ishay Weissman: Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes. Annals OR 189(1): 331-342 (2011)
- [j38]Raymond Hemmecke, Shmuel Onn, Robert Weismantel: A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126(1): 97-117 (2011)
- [j37]Raymond Hemmecke, Shmuel Onn, Robert Weismantel: N-fold integer programming and nonlinear multi-transshipment. Optimization Letters 5(1): 13-25 (2011)
- [p1]Shmuel Onn: Convex Discrete Optimization. Combinatorial Optimization - Methods and Applications 2011: 183-228
- [i6]Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk: N-fold integer programming in cubic time. CoRR abs/1101.3267 (2011)
- 2010
- [j36]Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum: Accuracy Certificates for Computational Problems with Convex Structure. Math. Oper. Res. 35(1): 52-78 (2010)
- [j35]Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel: Parametric nonlinear discrete optimization over well-described sets and matroid intersections. Math. Program. 124(1-2): 233-253 (2010)
- [i5]Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel: The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions. CoRR abs/1006.0773 (2010)
2000 – 2009
- 2009
- [j34]Jesús A. De Loera, Jon Lee, Susan Margulies, Shmuel Onn: Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz. Combinatorics, Probability & Computing 18(4): 551-582 (2009)
- [j33]
- [j32]Jesús A. De Loera, Edward D. Kim, Shmuel Onn, Francisco Santos: Graphs of transportation polytopes. J. Comb. Theory, Ser. A 116(8): 1306-1325 (2009)
- [j31]Jon Lee, Shmuel Onn, Robert Weismantel: Approximate Nonlinear Optimization over Weighted Independence Systems. SIAM J. Discrete Math. 23(4): 1667-1681 (2009)
- [c6]Jon Lee, Shmuel Onn, Robert Weismantel: Nonlinear Optimization over a Weighted Independence System. AAIM 2009: 251-264
- [r1]
- 2008
- [j30]
- [j29]Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel: N-fold integer programming. Discrete Optimization 5(2): 231-241 (2008)
- [j28]Jon Lee, Shmuel Onn, Robert Weismantel: On test sets for nonlinear integer maximization. Oper. Res. Lett. 36(4): 439-443 (2008)
- [j27]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. 22(3): 901-919 (2008)
- [i4]
- [i3]Jon Lee, Shmuel Onn, Robert Weismantel: Nonlinear Optimization over a Weighted Independence System. CoRR abs/0805.0954 (2008)
- 2007
- [j26]Nir Halman, Shmuel Onn, Uriel G. Rothblum: The convex dimension of a graph. Discrete Applied Mathematics 155(11): 1373-1383 (2007)
- [j25]Shmuel Onn, Uriel G. Rothblum: The use of edge-directions and linear programming to enumerate vertices. J. Comb. Optim. 14(2-3): 153-164 (2007)
- 2006
- [j24]Jesús A. De Loera, Shmuel Onn: Markov bases of three-way tables are arbitrarily complicated. J. Symb. Comput. 41(2): 173-181 (2006)
- [j23]Jesús A. De Loera, Shmuel Onn: All Linear and Integer Programs Are Slim 3-Way Transportation Programs. SIAM Journal on Optimization 17(3): 806-821 (2006)
- [c5]
- 2005
- [j22]Shmuel Onn, Uriel G. Rothblum, Yoav Tangir: Edge-Directions of Standard Polyhedra with Applications to Network Flows. J. Global Optimization 33(1): 109-122 (2005)
- 2004
- [j21]Shmuel Onn, Uriel G. Rothblum: Convex Combinatorial Optimization. Discrete & Computational Geometry 32(4): 549-566 (2004)
- [j20]Shmuel Onn, Rom Pinchasi: A note on the minimum number of edge-directions of a convex polytope. J. Comb. Theory, Ser. A 107(1): 147-151 (2004)
- [j19]
- [j18]Jesús A. De Loera, Shmuel Onn: The Complexity of Three-Way Statistical Tables. SIAM J. Comput. 33(4): 819-836 (2004)
- [c4]Jesús A. De Loera, Shmuel Onn: All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables. IPCO 2004: 338-351
- 2003
- [j17]Shmuel Onn, Elisheva Sperber: Social network coordination and graph routing. Networks 41(1): 44-50 (2003)
- [j16]
- [i2]
- [i1]
- 2002
- [j15]Sharon Aviran, Nissan Lev-Tov, Shmuel Onn, Uriel G. Rothblum: Vertex characterization of partition polytopes of bipartitions and of planar point sets. Discrete Applied Mathematics 124(1-3): 1-15 (2002)
- [j14]Sharon Aviran, Shmuel Onn: Momentopes, the Complexity of Vector Partitioning, and Davenport - Schinzel Sequences. Discrete & Computational Geometry 27(3): 409-417 (2002)
- [j13]
- 2001
- [j12]Shmuel Onn, Leonard J. Schulman: The Vector Partition Problem for Convex Objective Functions. Math. Oper. Res. 26(3): 583-590 (2001)
- 2000
- [j11]Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum: Linear-shaped partition problems. Oper. Res. Lett. 26(4): 159-163 (2000)
1990 – 1999
- 1999
- [j10]
- [j9]Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum: A Polynomial Time Algorithm for Shaped Partition Problems. SIAM Journal on Optimization 10(1): 70-81 (1999)
- 1997
- [j8]Shmuel Onn, Moshe Tennenholtz: Determination of Social Laws for Multi-Agent Mobilization. Artif. Intell. 95(1): 155-167 (1997)
- [j7]
- [j6]
- 1996
- [j5]Peter Kleinschmidt, Shmuel Onn: Signable Posets and Partitionable Simplicial Complexes. Discrete & Computational Geometry 15(4): 443-466 (1996)
- [c3]
- 1995
- [j4]Michel Deza, Shmuel Onn: Lattice-Free Polytopes and Their Diameter. Discrete & Computational Geometry 13: 59-75 (1995)
- [c2]Peter Kleinschmidt, Shmuel Onn: Oriented Matroid Polytopes and Polyhedral Fans are Signable. IPCO 1995: 198-211
- 1993
- [j3]Shmuel Onn: Geometry, Complexity, and Combinatorics of Permutation Polytopes. J. Comb. Theory, Ser. A 64(1): 31-49 (1993)
- 1992
- [j2]Peter Kleinschmidt, Shmuel Onn: On the diameter of convex polytopes. Discrete Mathematics 102(1): 75-77 (1992)
- 1991
- [j1]Shmuel Onn: On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice. SIAM J. Discrete Math. 4(3): 436-447 (1991)
- 1990
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:51 CEST by the dblp team