Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures

European Journal of Operational Research

Volumn 112, Issue 3, 1999, Pages 635-645

  Amiri, Ali ^a   Rolland, Erik ^b   Barkhi, Reza ^c  

^a WEBER STATE UNIVERSITY   (United States)

^b OHIO STATE UNIVERSITY   (United States)

^c PAMPLIN COLLEGE OF BUSINESS   (United States)

Author keywords

Bandwidth packing; Call routing; Heuristics; Lagrangean relaxation; Path assignment; Sub gradient search; Telecommunications networks

Indexed keywords

BANDWIDTH; COMPUTATIONAL METHODS; COSTS; DATA COMMUNICATION SYSTEMS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; PROBLEM SOLVING; QUEUEING THEORY; RELAXATION PROCESSES; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION TRAFFIC;

BANDWIDTH PACKING PROBLEMS; CALL ROUTING; LAGRANGEAN RELAXATION-BASED HEURISTIC METHOD; SUB-GRADIENT SEARCH METHOD;

CONGESTION CONTROL (COMMUNICATION);

EID: 0033078672     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(97)00401-3     Document Type: Article

References (15)

1. Anderson C.A., Fraughnaugh K., Parker M., Ryan J. Path assignment for call routing: An application of tabu search. Annals of Operations Research. 41:1993;301-312.
2. Bazaraa M.S., Goode J.J. A survey of various tactics for generating Lagrangean multipliers in the context of Lagrangean duality. European Journal of Operational Research. 3:1979;322-328.
3. Cox, L.A., L. Davis, L., Qui, Y., 1991. Dynamic anticipatory routing in circuit-switched telecommunications networks. In: Davis, L. (Ed.), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York.
4. Fisher M.L. Lagrangean relaxation methods for solving integer programming. Management Science. 27:1981;1-18.
5. Ford, L.R., Jr., Fulkerson, D.R., 1962. Flows in Networks. Princeton Univ. Press, Princeton, NJ.
6. Garey, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness, p. 215 W.H. Freeman, New York.
7. Gavish B. On obtaining the 'Best' multipliers for a Lagrangean relaxation for integer programming. Computers and Operations Research. 5:1978;55-71.
8. Gerla, M., 1973. The design of store-and-forward (S/F) networks for computer communications, Ph.D. Dissertation, Computer Science Dept., Univ. of California, Los Angeles.
9. Held M., Wolfe P., Crowder H.P. Validation of subgradient optimization. Mathematical Programming. 5:1974;62-88.
10. Kleinrock, L., 1964. Communications Nets: Stochastic Message Flow and Delay. Dover, New York.
11. Kleinrock, L., 1976. Queueing Systems, vols. 1 & 2. Wiley/Interscience, New York.
12. Laguna M., Glover F. Bandwidth packing: A tabu search approach. Management Science. 39:1993;492-500.
13. Park K., Kang S., Park S. An integer programming approach to the bandwidth packing problem. Management Science. 42:1996;1277-1291.
14. Parker M., Ryan J. A column generation algorithm for bandwidth packing. Telecommunications Systems. 2:1995;185-196.
15. Poljack B.T. A general method of solving extremum problems. Soviet Math. Doklady. 8:1967;593-597.