Optimum departure times for commuters in congested networks
暂无分享,去创建一个
[1] W. Vickrey. Congestion Theory and Transport Investment , 1969 .
[2] S. A. Piyavskii. An algorithm for finding the absolute extremum of a function , 1972 .
[3] A. Palma,et al. Economics of a bottleneck , 1986 .
[4] Pierre Hansen,et al. Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison , 1989, Math. Program..
[5] Pierre Hansen,et al. Commuters' Paths with Penalties for Early or Late Arrival Time , 1990, Transp. Sci..
[6] Pierre Hansen,et al. Global optimization of univariate Lipschitz functions: I. Survey and properties , 1989, Math. Program..
[7] Chris Hendrickson,et al. Schedule Delay and Departure Time Decisions in a Deterministic Model , 1981 .
[8] Nicola Santoro,et al. Min-max heaps and generalized priority queues , 1986, CACM.
[9] B. Shubert. A Sequential Method Seeking the Global Maximum of a Function , 1972 .
[10] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .