2012 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
Mathematical optimization, Heuristics, Capacitated minimum spanning tree, Telecommunications and Node are his primary areas of study. His work in Mathematical optimization addresses subjects such as Algorithm, which are connected to disciplines such as Lagrangian relaxation. His Capacitated minimum spanning tree research includes elements of Tree, Development and Network planning and design.
His Telecommunications research is multidisciplinary, incorporating perspectives in Computer network, Information system and File allocation. Bezalel Gavish focuses mostly in the field of Node, narrowing it down to matters related to Optimization problem and, in some cases, Heuristic, Combinatorial optimization, Topology and Telecommunications network. His biological study spans a wide range of topics, including Scheduling, Quadratic assignment problem, Material requirements planning and Time horizon.
His primary scientific interests are in Mathematical optimization, Algorithm, Telecommunications, Travelling salesman problem and Heuristics. His work on Mathematical optimization deals in particular with Branch and bound, Relaxation, Knapsack problem, Integer programming and Subgradient method. In his work, Fusion tree is strongly intertwined with Discrete mathematics, which is a subfield of Algorithm.
His Telecommunications research is multidisciplinary, incorporating elements of Computer network and Design methods. When carried out as part of a general Travelling salesman problem research project, his work on 2-opt, Christofides algorithm and Lin–Kernighan heuristic is frequently linked to work in Technical note, therefore connecting diverse disciplines of study. He has included themes like Node, Network topology, Upper and lower bounds and Heuristic in his Heuristics study.
His scientific interests lie mostly in Communications system, Telecommunications, Low earth orbit, Knowledge management and Anonymity. The study incorporates disciplines such as Quality of service and Underdevelopment in addition to Communications system. His study connects Computer network and Telecommunications.
His work on Team composition is typically connected to Specialization and Limit as part of general Knowledge management study, connecting several disciplines of science. Bezalel Gavish has researched Anonymity in several fields, including Decision support system, Group and Process management. As part of one scientific family, he deals mainly with the area of Process management, narrowing it down to issues related to the Management science, and often Telecommunications network.
Bezalel Gavish mainly investigates Decision support system, Anonymity, Communications system, Telecommunications and Computer security. Bezalel Gavish combines subjects such as Theory of computation, Group and Process management with his study of Decision support system. He applies his multidisciplinary studies on Anonymity and Voting in his research.
In most of his Communications system studies, his work intersects topics such as Broadband. Bezalel Gavish interconnects Default gateway and Underdevelopment in the investigation of issues within Telecommunications.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
Panayotis Afentakis;Bezalel Gavish;Uday Karmarkar.
Management Science (1984)
Topological design of centralized computer networks—formulations and algorithms
Bezalel Gavish.
Networks (1982)
Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
Bezalel Gavish;Hasan Pirkul.
Mathematical Programming (1985)
The Travelling Salesman Problem and Related Problems
Bezalel Gavish;Stephen C. Graves.
(1978)
Parallel Savings Based Heuristics for the Delivery Problem
Kemal Altinkemer;Bezalel Gavish.
Operations Research (1991)
Optimal Lot-Sizing Algorithms for Complex Product Structures
Panayotis Afentakis;Bezalel Gavish.
Operations Research (1986)
Topological design of telecommunication networks-local access design methods
Bezalel Gavish.
Annals of Operations Research (1991)
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
Bezalel Gavish.
Journal of the ACM (1983)
Topological design of computer communication networks — The overall design problem
Bezalel Gavish.
European Journal of Operational Research (1992)
Algorithms for the multi-resource generalized assignment problem
Bezalel Gavish;Hasan Pirkul.
Management Science (1991)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Colorado Boulder
Institute of Theoretical and Applied Informatics
California State University, Fullerton
Carleton University
University of Waterloo
Korea Advanced Institute of Science and Technology
Hong Kong Polytechnic University
Seoul National University
Heinrich Heine University Düsseldorf
Hong Kong University of Science and Technology
Umeå University
University of Queensland
Zoetis (United States)
University of Tübingen
Umeå University
University of South Florida St. Petersburg
Utrecht University
Otto-von-Guericke University Magdeburg
National Institutes of Health
Pompeu Fabra University
National Taiwan Ocean University
University of Haifa
Pennsylvania State University