-
19921992
Asymptotic Behavior of the Weber Location Problem on the Plane
Annals of Operations Research40 -
19921992
Light Traffic Heuristic for an M/G/1 Queue with Limited Inventory
Annals of Operations Research40 -
1992
-
1992
-
19921992
The Complexity of the Staggering Problem and Other Classical Inventory Problems
Operations Research Letters12 -
19921992
On the Minimum-Cost-Bounded Diameter and the Fixed-Budget-Minimum-Diameter Edge Addition Problems
Operations Research Letters11 -
1992
-
1992
-
19921992
The Point-to-Point Delivery and Connection Problems: Complexity and Algorithms
Discrete Applied Mathematics36 -
19921992
Hierarchical Design for Probabilistic Distribution Systems in Euclidean Spaces
Management Science38 -
19911991
Controllable Production Rates in a Family Production Context
International Journal of Producdtion Research29 -
1991
-
1991
-
1990
-
1990
-
19901990
Worst-Case Analysis of Heuristics for the Multi-Depot Capacitated Vehicle Routing Problems
ORSA Journal on Computing2 -
1990
-
1990
-
19901990
Scheduling Tasks with Failure Probabilities to Minimize Expected Cost
Naval Research Logistics37 -
19901990
The Complexity of Finding Two Disjoint Paths with Min Max Objective Function
Discrete Applied Mathematics26 -
1989
-
19881988
Minisum Location of a Traveling Salesman on Simple Networks
European Journal of Operations Research36 -
1988
-
19881988
Finding the Optimal A Priori Tour and Location ofa Traveling salesman with Non Homogeneous Customers
Transportation Science22 -
19881988
A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
Operations Research36 -
19871987
Heuristics and Bounds for the Traveling Salesman Location Problem on the Plane
Operations Research Letters6 -
1986