Gavish Bezalel

Bezalel Gavish

Information about the author Bezalel Gavish will soon be added to the site.
Found 18 papers in total
A dynamic programming approach for batch sizing in a multi-stage production process with random yields
A dynamic programming approach for batch sizing in a multi-stage production process with random yields
2011
This paper proposes a dynamic programming approach to modeling and determining batch...
Delivering IS/OR curricula through distance learning
Delivering IS/OR curricula through distance learning
2006
Students in fields such as information systems and operations research, need to...
Low earth orbit satellite based communication systems – research opportunities
Low earth orbit satellite based communication systems – research opportunities
1997
Telecommunication systems are undergoing revolutionary changes that are transforming...
LEOS – optimal satellite launch policies: The static case
LEOS – optimal satellite launch policies: The static case
1997
Low earth orbit satellite (LEOS) systems promise to provide global communication. A...
Lower bounding procedures for multiperiod telecommunications network expansion problems
Lower bounding procedures for multiperiod telecommunications network expansion problems
1995
This paper suggests an improved formulation for the multiperiod network topology and...
Voting mechanisms and their implications in a GDSS environment
Voting mechanisms and their implications in a GDSS environment
1997
There comes a time in most group discussions that a decision has to be made. This is...
Lower bounding procedures for multiperiod telecommunications network expansion problems
Lower bounding procedures for multiperiod telecommunications network expansion problems
1995
This paper suggests an improved formulation for the multiperiod network topology and...
An algorithm for concurrency control in replicated file systems
An algorithm for concurrency control in replicated file systems
1997
The problem of ensuring mutual exclusion in a distributed, replicated file system is...
O(n) algorithms for load balancing in distributed computing systems
O(n) algorithms for load balancing in distributed computing systems
1994
The problem of optimally balancing a given workload among identical processors with...
How to settle an estate
How to settle an estate
1993
This paper considers the equitable division of a set of assets, all or some of which...
Parallel savings based heuristics for the delivery problem
Parallel savings based heuristics for the delivery problem
1991
The delivery problem consists of finding a set of routes for a fleet of capacitated...
Configuration of fully replicated distributed database system over wide area networks
Configuration of fully replicated distributed database system over wide area networks
1992
The cost and performance of a distributed database system (DDS) depends on data...
Analysis of heuristics for the design of tree networks
Analysis of heuristics for the design of tree networks
1992
The authors analyze the tour partitioning heuristics for the Capacitated Minimum...
Topological design of telecommunications networks-Local access design methods
Topological design of telecommunications networks-Local access design methods
1991
Computer communication networks and telecommunication systems are growing at an...
Algorithms for the multi-resource generalized assignment problem
Algorithms for the multi-resource generalized assignment problem
1991
The multi-resource generalized assignment problem is encountered when a set of tasks...
Surrogate constraints in integer programming
Surrogate constraints in integer programming
1991
The authors present an improved algorithm for generating surrogate constraint...
A fully polynomial approximation scheme for single-product scheduling in a finite capacity facility
A fully polynomial approximation scheme for single-product scheduling in a finite capacity facility
1990
This paper considers a version of the economic lot sizing problem for a single product...
Directed Steiner tree problem on a graph: Models, relaxations and algorithms
Directed Steiner tree problem on a graph: Models, relaxations and algorithms
1990
The Steiner problem in graphs is the problem of finding a set of edges (arcs) with...
Papers per page: