| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Raymond Hemmecke, Shmuel Onn, Robert Weismantel |
N-fold integer programming and nonlinear multi-transshipment.  |
Optimization Letters  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Raymond Hemmecke, Shmuel Onn, Lyubov Romanchuk |
N-fold integer programming in cubic time |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Raymond Hemmecke, Shmuel Onn, Robert Weismantel |
A polynomial oracle-time algorithm for convex integer minimization. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Convex Discrete Optimization. |
Combinatorial Optimization - Methods and Applications |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadi Nemirovski, Shmuel Onn, Uriel G. Rothblum |
Accuracy Certificates for Computational Problems with Convex Structure. |
Math. Oper. Res. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Shmuel Onn, Lyubov Romanchuk, Robert Weismantel |
The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yael Berstein, Jon Lee, Shmuel Onn, Robert Weismantel |
Parametric nonlinear discrete optimization over well-described sets and matroid intersections. |
Math. Program. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesús A. De Loera, Edward D. Kim, Shmuel Onn, Francisco Santos |
Graphs of transportation polytopes. |
J. Comb. Theory, Ser. A |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Two graph isomorphism polytopes. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Shmuel Onn, Robert Weismantel |
Approximate Nonlinear Optimization over Weighted Independence Systems. |
SIAM J. Discrete Math. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Convex Discrete Optimization. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Jon Lee, Shmuel Onn, Robert Weismantel |
Nonlinear Optimization over a Weighted Independence System. |
AAIM |
2009 |
DBLP DOI BibTeX RDF |
independence system, oracle computation, exponential running time, Frobenius number, approximation algorithm, combinatorial optimization, integer programming, nonlinear optimization, matroid |
| 1 | Jon Lee, Shmuel Onn, Robert Weismantel |
On test sets for nonlinear integer maximization. |
Oper. Res. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Berstein, Shmuel Onn |
Nonlinear bipartite matching. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesús A. De Loera, Raymond Hemmecke, Shmuel Onn, Robert Weismantel |
N-fold integer programming. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Two graph isomorphism polytopes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jon Lee, Shmuel Onn, Robert Weismantel |
Nonlinear Optimization over a Weighted Independence System |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn, Uriel G. Rothblum |
The use of edge-directions and linear programming to enumerate vertices. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Edge-directions, Linear programming, Vertices, Polytopes |
| 1 | Nir Halman, Shmuel Onn, Uriel G. Rothblum |
The convex dimension of a graph. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesús A. De Loera, Shmuel Onn |
All Linear and Integer Programs Are Slim 3-Way Transportation Programs. |
SIAM Journal on Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesús A. De Loera, Shmuel Onn |
Markov bases of three-way tables are arbitrarily complicated. |
J. Symb. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Entry Uniqueness in Margined Tables. |
Privacy in Statistical Databases |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn, Rom Pinchasi |
A note on the minimum number of edge-directions of a convex polytope. |
J. Comb. Theory, Ser. A |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Nowhere-zero flow polynomials. |
J. Comb. Theory, Ser. A |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn, Uriel G. Rothblum |
Convex Combinatorial Optimization. |
Discrete & Computational Geometry |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesús A. De Loera, Shmuel Onn |
The Complexity of Three-Way Statistical Tables. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Jesús A. De Loera, Shmuel Onn |
All Rational Polytopes Are Transportation Polytopes and All Polytopal Integer Sets Are Contingency Tables. |
IPCO |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn, Elisheva Sperber |
Social network coordination and graph routing. |
Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Nowhere-Zero Flow Polynomials |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Onn, Uriel G. Rothblum |
Convex Combinatorial Optimization |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Shmuel Onn |
Convex Matroid Optimization. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Antoine Deza, Shmuel Onn |
Solitaire Lattices. |
Graphs and Combinatorics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sharon Aviran, Shmuel Onn |
Momentopes, the Complexity of Vector Partitioning, and Davenport - Schinzel Sequences. |
Discrete & Computational Geometry |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn, Leonard J. Schulman |
The Vector Partition Problem for Convex Objective Functions. |
Math. Oper. Res. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum |
Linear-shaped partition problems. |
Oper. Res. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank K. Hwang, Shmuel Onn, Uriel G. Rothblum |
A Polynomial Time Algorithm for Shaped Partition Problems. |
SIAM Journal on Optimization |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Shmuel Onn |
Separable Partitions. |
Discrete Applied Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Strongly Signable and Partitionable Posets. |
Eur. J. Comb. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn, Moshe Tennenholtz |
Determination of Social Laws for Multi-Agent Mobilization. |
Artif. Intell. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Kleinschmidt, Shmuel Onn |
Signable Posets and Partitionable Simplicial Complexes. |
Discrete & Computational Geometry |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Imre Bárány, Shmuel Onn |
Colourful Linear Programming. |
IPCO |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Deza, Shmuel Onn |
Lattice-Free Polytopes and Their Diameter. |
Discrete & Computational Geometry |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Kleinschmidt, Shmuel Onn |
Oriented Matroid Polytopes and Polyhedral Fans are Signable. |
IPCO |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
Geometry, Complexity, and Combinatorics of Permutation Polytopes. |
J. Comb. Theory, Ser. A |
1993 |
DBLP BibTeX RDF |
|
| 1 | Peter Kleinschmidt, Shmuel Onn |
On the diameter of convex polytopes. |
Discrete Mathematics |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice. |
SIAM J. Discrete Math. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Onn |
On the Radon Number of the Integer Lattice. |
IPCO |
1990 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")