The following pages link to Bezalel Gavish (Q556718):
Displayed 50 items.
- LP-based heuristic algorithms for interconnecting token rings via source routing bridges (Q556719) (← links)
- A dynamic programming approach for batch sizing in a multi-stage production process with random yields (Q648335) (← links)
- Fraudulent auctions on the internet (Q876829) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718) (← links)
- Heuristics for unequal weight delivery problems with a fixed error guarantee (Q1095815) (← links)
- Analysis of channel and disk subsystems in computer systems (Q1119018) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- Topological design of computer communication networks -- the overall design problem (Q1194726) (← links)
- Analysis of heuristics for the design of tree networks (Q1197773) (← links)
- Configuration of fully replicated distributed database system over wide area networks (Q1197781) (← links)
- Configuring wide area computer networks. Problems and models (Q1207261) (← links)
- An optimality principle for Markovian decision processes (Q1228554) (← links)
- An approach for solving a class of transportation scheduling problems (Q1251987) (← links)
- Low earth orbit satellite based communication systems -- research opportunities (Q1278815) (← links)
- \(O(n)\) algorithms for load balancing in distributed computing systems (Q1317069) (← links)
- Voting mechanisms and their implications in a GDSS environment (Q1368356) (← links)
- The impact of mobility on cellular network configuration (Q1859211) (← links)
- An Approach to the Optimal Positioning of a New Product (Q3040922) (← links)
- A Fully Polynomial Approximation Scheme for Single-Product Scheduling in a Finite Capacity Facility (Q3200871) (← links)
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees (Q3211137) (← links)
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems (Q3346072) (← links)
- WARRANTY POLICY IMPACT ON NET REVENUES DUE TO OPTIONAL PURCHASES (Q3585094) (← links)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
- ε-Approximations for Multidimensional Weighted Location Problems (Q3694957) (← links)
- Optimal Lot-Sizing Algorithms for Complex Product Structures (Q3738876) (← links)
- An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems (Q3753823) (← links)
- Set query optimization in distributed database systems (Q3775008) (← links)
- Heuristics with Constant Error Guarantees for the Design of Tree Networks (Q3780780) (← links)
- Technical Note—A One-Product Production/Inventory Problem under Continuous Review Policy (Q3896799) (← links)
- Topological design of centralized computer networks—formulations and algorithms (Q3956857) (← links)
- Surrogate Constraints in Integer Programming (Q3976935) (← links)
- Parallel Savings Based Heuristics for the Delivery Problem (Q3978843) (← links)
- Algorithms for the Multi-Resource Generalized Assignment Problem (Q3981148) (← links)
- Backbone Network Design Tools with Economic Tradeoffs (Q4025918) (← links)
- Note—A Note on “The Formulation of the <i>M</i>-Salesman Traveling Salesman Problem” (Q4083207) (← links)
- The zero pivot phenomenon in transportation and assignment problems and its computational implications (Q4127627) (← links)
- Computer Communication Via Satellites--A Queueing Model (Q4131037) (← links)
- The Markovian Queue with Bounded Waiting time (Q4148770) (← links)
- How to Settle an Estate (Q4274644) (← links)
- An Algorithm For Concurrency Control In Replicated File Systems (Q4356611) (← links)
- LEOS—Optimal Satellite Launch Policies: The Static Case (Q4363671) (← links)
- (Q4463406) (← links)
- Models for the combined logical and physical design of databases (Q4732138) (← links)
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem (Q4740330) (← links)
- Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem (Q4745612) (← links)
- Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems (Q4838236) (← links)
- Erratum (Q4887746) (← links)
- Computing the 2‐median on tree networks in O(n lg n) time (Q4894868) (← links)
- Directed Steiner Tree Problem On A Graph: Models, Relaxations And Algorithms (Q5202521) (← links)