Solving multicommodity integral flow problems by simulated allocation

Telecommunication Systems

Volumn 7, Issue 1-3, 1997, Pages 17-28

  Pióro, Michal ^a,b,c   Gajowniczek, Piotr ^a  

^a WARSAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b Franco Polish School of New Information and Communication Technologies   (Poland)

^c Polish Telecom   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21744462853     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1019151707785     Document Type: Article

References (5)

1. J.E. Beasley, Distributing test problems by Electronic mail, Journal of Operational Research Society 41(11) 1990.
2. W. Feller, An Introduction to Probability Theory and its Applications, Vol. I (Wiley, New York, 1968).
3. M.R. Garey and D.S. Johnson, Computers and Intractability - A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
4. S. Khuri, T. Bäck and J. Heitkötter, The zero/one multiple knapsack problem and genetic algorithms, in: Proceedings of ACM Symposium of Applied Computation (SAC '94) (ACM Press, 1993).
5. M. Pióro and P. Gajowniczek, Stochastic allocation of virtual paths to ATM links, in: Performance Modelling and Evaluation of ATM Networks, ed. D. Kouvatsos (Chapman & Hall, London, 1995).