- Full text PDF available (38)
- This year (0)
- Last 5 years (5)
- Last 10 years (18)
Journals and Conferences
Multiple copies may be made for classes, etc. Charges, if any, for reproduced copies must be just enough to recover reasonable costs of reproduction. Reproduction for commercial purposes is prohibited. This cover page must be included in all distributed copies. Comments and suggestions are welcome, and should be sent to email@example.com. v PREFACE… (More)
We describe a variety of interrelated decisions made during daily operations at a container terminal. The ultimate goal of these decisions is to minimize the berthing time of vessels, the resources needed for handling the workload, the waiting time of customer trucks, and the congestion on the roads and at the storage blocks and docks inside the terminal;… (More)
Container terminals are essential intermodal interfaces in the global transportation network. Efficient container handling at terminals is important in reducing transportation costs and keeping shipping schedules. In this paper, we study the storage space allocation problem in the storage yards of terminals. This problem is related to all the resources in… (More)
One of the motivating factors behind the development of the theories of probability and statistics is to obtain good forecasts for future values of random variables that appear in many applications. Managers in industry and business depend heavily on good forecasts of product demand. History shows many examples of Þrms beneÞting from accurate forecasts and… (More)
We establish that in the worst case, the computational effort required for solving a parametric linear program is not bounded above by a polynomial in the size of the problem.
In this paper we briefly review the importance of LP (linear programming), and Dantzig's main contributions to OR (Operations Research), mathematics, and computer science. In [11, 3] gravitational methods for LP have been introduced. Several versions exist. The three main versions discussed there use a ball of (a): 0 radius, (b): small positive radius, and… (More)
We discuss infeasibility analysis (study of changes needed to make an infeasible system feasible) for systems of linear constraints.