Search

This paper extends the current state of public facilities location problems on a road network to cover situations in which the number of users at each node may be a random variable. The basic location model is reformulated as a chance-constrained programming problem with fractile criterion. A computational procedure for solving the non-linear deterministic equivalent problem derived is presented. Finally, a hypothetical numerical example illustrates the possibility of changes in the location decision when the stochastic nature of the problem is taken into account. [ABSTRACT FROM AUTHOR]

Easily manipulated list structures for recording the basis tree for adjacent extreme point (“simplex type”) network algorithms are paramount to the development of computationally efficient network algorithms. This paper presents a new list structure which is shown to be computationally more efficient and to require one-third less computer memory to implement than all alternate list structures. [ABSTRACT FROM AUTHOR]

Copyright of INFOR is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)