The following pages link to Refael Hassin (Q233539):
Displaying 50 items.
- The minimum generalized vertex cover problem (Q2944506) (← links)
- Robust subgraphs for trees and paths (Q2944516) (← links)
- Strategic Overtaking in a Monopolistic M/M/1 Queue (Q2982640) (← links)
- The Price of Anarchy in the Markovian Single Server Queue (Q2983269) (← links)
- Approximations for Maximum Transportation Problem with Permutable Supply Vector and Other Capacitated Star Packing Problems (Q3046502) (← links)
- Dichotomous Search for Random Objects on an Interval (Q3320109) (← links)
- On multicommodity flows in planar graphs (Q3340473) (← links)
- A Dichotomous Search for a Geometric Random Variable (Q3342201) (← links)
- Social and Monopoly Optimization in Observable Queues (Q3387961) (← links)
- Optimizing Chemotherapy Scheduling Using Local Search Heuristics (Q3392023) (← links)
- Rational Queueing (Q3467735) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- Scheduling Arrivals to Queues: A Single-Server Model with No-Shows (Q3523878) (← links)
- The (K,k)-Capacitated Spanning Tree Problem (Q3578356) (← links)
- Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links (Q3639252) (← links)
- An $O(n\log ^2 n)$ Algorithm for Maximum Flow in Undirected Planar Networks (Q3680587) (← links)
- On Shortest Paths in Graphs with Random Weights (Q3699721) (← links)
- An optimal algorithm for finding all the jumps of a monotone step-function (Q3723701) (← links)
- A Deterministic Single-Item Inventory Model with Seller Holding Cost and Buyer Holding and Shortage Costs (Q3750461) (← links)
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs (Q3754451) (← links)
- Equilibrium Arrivals in Queues with Bulk Service at Scheduled Times (Q3765529) (← links)
- (Q3795462) (← links)
- Probabilistic Analysis of the Capacitated Transportation Problem (Q3799791) (← links)
- Solution Bases of Multiterminal Cut Problems (Q3820346) (← links)
- Maximizing Classes of Two-Parameter Objectives Over Matroids (Q3820617) (← links)
- Ranking the Best Binary Trees (Q3833632) (← links)
- Generalizations of Hoffman's existence theorem for circulations (Q3910279) (← links)
- (Q3925820) (← links)
- Minimum cost flow with set-constraints (Q3936464) (← links)
- The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm (Q3967334) (← links)
- Exact Computation of Optimal Inventory Policies Over an Unbounded Horizon (Q3986755) (← links)
- Approximation Schemes for the Restricted Shortest Path Problem (Q4016708) (← links)
- Minimal Length Curves That Are Not Embeddable in an Open Planar Set: The Problem of a Lost Swimmer with a Compass (Q4016757) (← links)
- Mean Passage Times and Nearly Uncoupled Markov Chains (Q4018850) (← links)
- The swapping problem (Q4018998) (← links)
- (Q4201939) (← links)
- (Q4247262) (← links)
- Equilibrium strategies and the value of information in a two line queueing system with threshold jockeying (Q4291648) (← links)
- Restricted delivery problems on a network (Q4347274) (← links)
- Approximation Algorithms for Min–Max Tree Partition (Q4360130) (← links)
- On the Advantage of Being the First Server (Q4363622) (← links)
- Equilibrium Threshold Strategies: The Case of Queues with Priorities (Q4384096) (← links)
- (Q4411286) (← links)
- (Q4437515) (← links)
- Minimum spanning tree with hop restrictions (Q4458878) (← links)
- Capacitated vertex covering (Q4458880) (← links)
- Minimum-diameter covering problems (Q4520238) (← links)
- (Q4537746) (← links)
- The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue (Q4604910) (← links)
- An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection (Q4651462) (← links)
