Onn Shmuel

Shmuel Onn

Information about the author Shmuel Onn will soon be added to the site.
Found 11 papers in total
Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes
Generating uniform random vectors over a simplex with implications to the volume of a certain polytope and to multivariate extremes
2011
A uniform random vector over a simplex is generated. An explicit expression for the...
N‐fold integer programming and nonlinear multi‐transshipment
N‐fold integer programming and nonlinear multi‐transshipment
2011
The multi‐transshipment problem is NP‐hard already for two commodities...
Accuracy certificates for computational problems with convex structure
Accuracy certificates for computational problems with convex structure
2010
The goal of this paper is to introduce the notion of certificates, which verify the...
On test sets for nonlinear integer maximization
On test sets for nonlinear integer maximization
2008
A finite test set for an integer optimization problem enables us to verify whether a...
N-fold integer programming
N-fold integer programming
2008
In this article we study a broad class of integer programming problems in variable...
The use of edge-directions and linear programming to enumerate vertices
The use of edge-directions and linear programming to enumerate vertices
2007
Given a list of vectors that contains directions of the edges of a given polytope...
Linear-shaped partition problems
Linear-shaped partition problems
2000
We establish the polynomial-time solvability of a class of vector partition problems...
The vector partition problem for convex objective functions
The vector partition problem for convex objective functions
2001
The partition problem concerns the partitioning of a given set of n vectors in d...
Colourful linear programming and its relatives
Colourful linear programming and its relatives
1997
We consider the following Colourful generalization of Linear Programming: given sets...
Explicit solution of partitioning problems over a 1-dimensional parameter space
Explicit solution of partitioning problems over a 1-dimensional parameter space
2000
We consider a class of partitioning problems where the partitioned set is a finite set...
Separable partitions
Separable partitions
1999
An ordered partition of a set of n points in the d -dimensional Euclidean space is...
Papers per page: