Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
David Simchi-Levi
Information about the author David Simchi-Levi will soon be added to the site.
Found
59 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
A probabilistic analysis of tour partitioning heuristics for the Capacitated Vehicle Routing Problem with unsplit demands
1993
In the Capacitated Vehicle Routing Problem with unsplit demands, a customer’s...
Asymptotic behavior of the Weber location problem on the plane
1993
The asymptotic behavior of the Weber location problem is investigated. The authors...
Light traffic heuristic for an M/G/1 queue with limited inventory
1993
Motivated by solving a stylized location problem, the authors develop a light traffic...
Probabilistic analysis of the capacitated vehicle routing problem with unsplit demands
1992
In the capacitated vehicle routing problem with unsplit demands, the demand of a...
The complexity of the staggering problem, and other classical inventory problems
1992
The authors consider a multi-item inventory system with a constraint or penalty...
On the distance constrained vehicle routing problem
1992
The authors analyze the vehicle routing problem with constraints on the total distance...
Analysis of heuristics for the design of tree networks
1992
The authors analyze the tour partitioning heuristics for the Capacitated Minimum...
Controllable production rates in a family production context
1991
The authors consider a single facility dedicated to the production of a family of...
The capacitated traveling salesmen location problem
1991
The capacitated traveling salesmen location problem is the problem of locating one...
Queueing-location problems on the plane
1990
In this article the authors present a queueing-location problem where a location of a...
Scheduling tasks with failure probabilities to minimize expected cost
1990
A project is made of several tasks which can be executed in parallel. Each task is...
First Page
1
2
3
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers