The following pages link to Shmuel Onn (Q314826):
Displaying 50 items.
- (Q161038) (redirect page) (← links)
- Huge tables and multicommodity flows are fixed-parameter tractable via unimodular integer Carathéodory (Q314827) (← links)
- Some efficiently solvable problems over integer partition polytopes (Q476314) (← links)
- On nonlinear multi-covering problems (Q511715) (← links)
- Intractability of approximate multi-dimensional nonlinear optimization on independence systems (Q533792) (← links)
- A note on the minimum number of edge-directions of a convex polytope (Q598444) (← links)
- A polynomial oracle-time algorithm for convex integer minimization (Q623465) (← links)
- \(N\)-fold integer programming and nonlinear multi-transshipment (Q628649) (← links)
- The Graver complexity of integer programming (Q659795) (← links)
- Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes (Q666374) (← links)
- Geometry, complexity, and combinatorics of permutation polytopes (Q690026) (← links)
- Nowhere-zero flow polynomials (Q703684) (← links)
- Minimizing Lipschitz-continuous strongly convex functions over integer points in polytopes (Q715233) (← links)
- Primitive zonotopes (Q724942) (← links)
- Edge-directions of standard polyhedra with applications to network flows (Q811875) (← links)
- Nonlinear bipartite matching (Q924630) (← links)
- \(N\)-fold integer programming (Q951095) (← links)
- Nonlinear discrete optimization. An algorithmic theory (Q993280) (← links)
- The convex dimension of a graph (Q997061) (← links)
- On test sets for nonlinear integer maximization (Q1003492) (← links)
- Convex integer maximization via Graver bases (Q1017675) (← links)
- Graphs of transportation polytopes (Q1040845) (← links)
- Two graph isomorphism polytopes (Q1043653) (← links)
- On the diameter of convex polytopes (Q1193432) (← links)
- Separable partitions (Q1283783) (← links)
- Representations and characterizations of vertices of bounded-shape partition polytopes (Q1307294) (← links)
- Hilbert series of group representations and Gröbner bases for generic modules (Q1321591) (← links)
- A quantitative Steinitz' theorem (Q1339977) (← links)
- Lattice-free polytopes and their diameter (Q1346126) (← links)
- Strongly signable and partitionable posets (Q1372625) (← links)
- Determination of social laws for multi-agent mobilization (Q1389600) (← links)
- The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. (Q1408266) (← links)
- Linear-shaped partition problems (Q1577471) (← links)
- (Q1597684) (redirect page) (← links)
- Momentopes, the complexity of vector partitioning, and Davenport-Schinzel sequences (Q1597685) (← links)
- The Radon-split and the Helly-core of a point configuration (Q1601383) (← links)
- Solitaire lattices (Q1606024) (← links)
- Shifted matroid optimization (Q1694792) (← links)
- Small primitive zonotopes (Q1740472) (← links)
- Efficient solutions for weight-balanced partitioning problems (Q1751164) (← links)
- Convex combinatorial optimization (Q1764165) (← links)
- Robust integer programming (Q1785307) (← links)
- The unimodular intersection problem (Q1785442) (← links)
- An adaptive algorithm for vector partitioning (Q1810893) (← links)
- Doubly stochastic matrices and dicycle covers and packings in Eulerian digraphs (Q1816947) (← links)
- Vertex characterization of partition polytopes of bipartitions and of planar point sets (Q1850111) (← links)
- Signable posets and partitionable simplicial complexes (Q1913695) (← links)
- The quadratic Graver cone, quadratic integer minimization, and extensions (Q1925790) (← links)
- \(n\)-fold integer programming in cubic time (Q1942262) (← links)
- Uniform and monotone line sum optimization (Q2028097) (← links)
