G. P. Agrawal,
Fiber-Optic Communication Systems, 3rd ed. New York: Wiley-Interscience, 2002.
M. Premaratne and P. Premaratne, "Optimal configuration of discrete-value dispersion compensator modules for a given dispersion map in a fiber optic communication link", in Proc. CLEO/Pacific Rim, Taipei, Taiwan, R.O.C., 2003,TU3A-(13)-4,. pp. 1-3.
B. Ramamurthy and B. Mukherjee,
"Optical components for WDM lightwave networks",
Proc. IEEE, vol. 85, no. 8, pp. 1274-1307, Aug. 1997.
R. K. Ahuja,
T. L. Magnanti and J. B. Orlin,
Network Flows, Englewood Cliffs, NJ: Prentice-Hall, 1993.
R. Ramaswami and K. N. Sivarajan,
Optical Networks: A Practical Perspective, San Francisco, CA: Morgan Kaufmann, 1998.
B. Sanso and P. Soriano,
Telecommunications Network Planning, Norwell, MA: Kluwer, 1999.
T. E. Stern and K. Bala,
Multiwavelength Optical Networks: A Layered Approach, Reading, MA: Addison-Wesley, 1999.
J. Iness and B. Mukherjee,
"Optimizing amplifier placements in a multiwavelength optical LAN/MAN: The unequally powered wavelengths case",
IEEE/ACM Trans. Netw., vol. 6, no. 6, pp. 755-767, Dec. 1998.
A. R. Minagar and M. Premaratne, "Dynamic programming approach for allocating optimal combination of dispersion compensator modules in optical networks", in Proc. ICOCN, Bangalore, India, 2003,S2A-5,. pp. 1-4.
A. R. Minagar, M. Premaratne and G. K. Egan, "Analysis of selection of dispersion compensation module combinations in optical networks: Special cases", in Proc. OECC/COIN, Yokohama, Japan, 2004, pp. 130-131.
H. Nagesh and V. Poosala,
"Constraint-based design of optical transmission systems",
J. Lightw. Technol., vol. 21, no. 11, pp. 2499-2510, Nov. 2003.
C. H. Papadimitriou,
Computational Complexity, New York: Addison-Wesley, 1994.
Dynamic Programming, New York: Marcel Dekker, 1992.
"Dynamic programming revisited: Improving knapsack algorithms",
Computing, vol. 63, no. 4, pp. 419-430, 1999.
S. Martello and P. Toth,
Knapsack Problems: Algorithms and Computer Implementations, New York: Wiley, 1990.
U. Pferschy and D. Pisinger,
Knapsack Problems, New York: Springer-Verlag, 2004.
M. Hifi and R. Ouafi,
"Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates",
Comput. Ind. Eng., vol. 32, no. 1, pp. 187-205, Jan. 1997.