Rothblum Uriel G.

Uriel G. Rothblum

Information about the author Uriel G. Rothblum will soon be added to the site.
Found 27 papers in total
Stochastic scheduling in an in-forest
Stochastic scheduling in an in-forest
2008
Consider a problem of scheduling activities of a research and development project,...
Bounding the inefficiency of Nash equilibria in games with finitely many players
Bounding the inefficiency of Nash equilibria in games with finitely many players
2007
This paper derives bounds on the gap between optimal performance and the performance...
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...
Inducing coordination in supply chains through linear reward schemes
Inducing coordination in supply chains through linear reward schemes
2006
Decentralized decision-making in supply chain management is quite common, and often...
The mean number-in-system vector range for multiclass queueing networks
The mean number-in-system vector range for multiclass queueing networks
2004
In a multiclass network of queues, natural sufficient conditions are given for the...
Index policies for stochastic search in a forest with an application to R&D project management
Index policies for stochastic search in a forest with an application to R&D project management
2004
This paper concerns a stochastic search problem in a forest. As motivation, consider...
A polytope approach to the optimal assembly problem
A polytope approach to the optimal assembly problem
2006
The problem of assembling components into series modules to maximize the system...
Linear-shaped partition problems
Linear-shaped partition problems
2000
We establish the polynomial-time solvability of a class of vector partition problems...
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...
Multiperiod allocation of substitutable resources
Multiperiod allocation of substitutable resources
1995
We consider multiperiod resource allocation problems, where excess resources in one...
Assembly at system level versus component level
Assembly at system level versus component level
1995
Given two system structure functions F and G , the authors consider the assemblage of...
Formulation of linear problems and solution by a universal machine
Formulation of linear problems and solution by a universal machine
1994
Using the predicate language for ordered fields a class of problems referred to as...
Relaxation-based algorithms for minimax optimization problems with resource allocation applications
Relaxation-based algorithms for minimax optimization problems with resource allocation applications
1994
The authors consider minimax optimization problems where each term in the objective...
Some comments on the optimal assembly problem
Some comments on the optimal assembly problem
1995
It is shown that two recent results of Baxter and Harche on monotone and balanced...
Dynamic recomputation cannot extend the optimality-range of priority indices
Dynamic recomputation cannot extend the optimality-range of priority indices
1994
Sequencing rules that rely on priority indices are particularly attractive because...
Optimality of monotone assemblies for coherent systems composed of series modules
Optimality of monotone assemblies for coherent systems composed of series modules
1994
The authors consider a system with m modules as components. These modules are composed...
A class of ‘onto’ multifunctions
A class of ‘onto’ multifunctions
1993
A convex valued, upper continuous multifunction with pointed closed convex domain is...
Minimax resource allocation problems with resource-substitutions represented by graphs
Minimax resource allocation problems with resource-substitutions represented by graphs
1993
Resource allocation problems focus on the allocation of limited resources among...
Stable matchings, optimal assignments, and linear programming
Stable matchings, optimal assignments, and linear programming
1993
Vande Vate described the polytope whose extreme points are the stable (core) matchings...
Majorization and Schur convexity with respect to partial orders
Majorization and Schur convexity with respect to partial orders
1993
Majorization and Schur convexity constitute an important tool for establishing...
Characterizations of max-balanced flows
Characterizations of max-balanced flows
1992
Let G=(V,A) be a graph with vertex set V and arc set a. A flow for G is an arbitrary...
Optimal partitions having disjoint convex and conic hulls
Optimal partitions having disjoint convex and conic hulls
1992
Let A 1 ,...,A n be distinct k -dimensional vectors. The authors consider the problem...
Characterization of stable matchings as extreme points of a polytope
Characterization of stable matchings as extreme points of a polytope
1992
The purpose of this paper is to extend a modified version of a recent result of Vande...
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields
1992
A constructive procedure using Dines-Fourier-Motzkin elimination is given for...
Papers per page: