Abstract
A brief summary is given of recent insights into the distribution problem for structured stochastic integer programming problems, as surveyed during the Gargnano conference. The application of these results within a heuristic approach to certain hierarchical planning problems is discussed as well.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. Beardwood, J.H. Halton & J.M. Hammersley (1959), “The shortest path through many points”, Proc. Cambridge Philos. Soc. 55, 299–327.
M.A.H. Dempster, M.L. Fisher, L. Jansen, B.J. Lageweg, J.K. Lenstra & A.H.G. Rinnooy Kan (1983) “Analysis of heuristics for stochastic programming: results for hierarchical scheduling problems”, Math. Op. Res. 8, 525–538.
P. Erdös & J. Spencer (1974), Probabilistic Methods in Combinatorics, Academic Press.
J.B.G. Frenk & A.H.G. Rinnooy Kan (1984), “The asymptotic optimality of the LPT rule”, Technical report, Erasmus University Rotterdam.
J.B.G. Frenk & A.G.H. Rinnooy Kan (1984a), “Order statistics and the linear assignment problem”, Technical Report, Erasmus University Rotterdam.
J.B.G. Frenk, A.H.G. Rinnooy Kan & L. Stougie (1984), “A hierarchical scheduling model with a well solvable second stage”, Annals of O.R. 1 (to appear).
M. Haimovich (1984), Ph. D. Thesis, M.I.T.
D.S. Hochbaum & J.M. Steele (1982), “Steinhaus geometric location problem for random samples in the plane”, Adv. in Appl. Prob. 14, 59–67.
N. Karmarkar, R.M. Karp, G.S. Lueker & A. Odlyzko (1984), “The probabiility distribution of the optimal value of a partitioning problem”, Manuscript, Bell Laboratories.
R.M. Karp (1977), “Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane”, Math. Op. Res. 2, 209–224.
R.M. Karp (1984), “An upper bound on the expected cost of an optimal assignment”. Manuscript, Computer Science Division, University of California, Berkeley.
R.M. Karp, J.K. Lenstra, C. Mc Diarmid & A.H.G. Rinnoy Kan (1984), “Probabilistic analysis of algorithms: an annotated bibliography” in: M. Oh. Eigeartaigh et al. (eds.) (1985), Combinatorial Optimization: Annotated Bibliographies, Wiley.
R.M. Karp & J.M. Steele (1984), “Probabilistic analysis of the traveling salesman problem” in E. Lawler et al. (eds.) (1985), The Traveling Salesman Problem, Wiley.
J.K. Lenstra & A.H.G. Rinnoy Kan (1979), “Computational complexity of discrete optimization problems”, Ann. Discr. Math. 5, 287–326.
R. Loulou (1982), “Probabilistic behaviour of optimal bin packing solutions”, Technical Report, Mc Gill University, Montreal.
R. Loulou (1982a), “Average behaviour of heuristic and optimal solutions to the maximization assignment problem”, Technical Report, Mc Gill University, Montreal.
G.S. Lueker (1980), “On the average difference between the solutions to linear and integer knapsack problems” in: R.L. Disney & T.J. Ott (eds.) (1982), Applied Probability — Computer Science: The Interface, Volume I, Birkhäuser Boston.
G.S. Lueker (1981), “Optimization problems on graphs with independent random edge weights”, SIAM J. Comp. 10, 338–351.
A. Marchetti Spaccamela, A.H.G. Rinnooy Kan & L. Stougie (1984), “Hierarchical vehicle routing problems”, Networks (to appear).
D.W. Matula (1976), “The largest clique size in a random graph, Technical Report, Southern Methodist University, Dallas.
C.H. Papadimitriou (1980), “Worst case and probabilistic analysis of a geometric location problem”, Technical Report, M.I.T.
J.M. Steele (1981a), “Complete convergence of short paths and Karp's algorithm for the TSP”, Math. Op. Res. 6, 374–378.
J.M. Steele (1981), “Subadditive Euclidean functionals and nonlinear growth in geometric probability”, Ann. Probability 9, 365–376.
D.W. Walkup (1979), “On the expected value of a random assignment problem”, SIAM J. Comp. 8, 440–442.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Rinnooy Kan, A.H.G. (1986). Stochastic integer programming: The distribution problem. In: Archetti, F., Di Pillo, G., Lucertini, M. (eds) Stochastic Programming. Lecture Notes in Control and Information Sciences, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006868
Download citation
DOI: https://doi.org/10.1007/BFb0006868
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16044-1
Online ISBN: 978-3-540-39729-8
eBook Packages: Springer Book Archive