General Bibliography
ACHUTHAN N.R., CACCETTA L., HILL S.P., “An Improved Branch-and-cut Algorithm for the Capacitated Vehicle Routing Problem”, Transportation Science, vol. 37, pp. 153–169, 2003.
ADDINNOUR-HELM S., VENKATARAMANAN M.A., “Solution Approaches to Hub Location Problems”, Annals of Operations Research, vol. 78, pp. 31–50, 1998.
AGGARWAL A., PARK J.K., “Improved algorithms for economic lot size problems”, Operations Research, vol. 41, no. 3, pp. 549–571, 1993.
AHUJA R.K., ORLIN J.B., SHARMA D., “Multiexchange neighbourhood structures for the capacitated minimum spanning tree problem”, Math. Programming 91, pp. 71–97, 2001.
AHUJA R.K., MAGNANTI T.L., ORLIN J.B., Network Flows – Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, 1993.
AHUJA R.K., MAGNANTI T.L., ORLIN J.B., REDDY M.R., “Applications of network optimization”, Chapter 1 of Network Models, Handbook of Operation Research and Management Science 7, pp. 1–83, 1995.
AlKENS C.H., “Facility Location Models for Distribution Planning”, European Journal of Operational Research, vol. 22, pp. 263–279, 1985.
ANFRADE R., LISSER A., PLATEAU G., MACULAN N., “Simulation of the integer capacity planning under uncertain demand problem in telecommunication networks”, Proceedings EUROSIM 2001, Delft, 2001.
ANDERSSON P. A., “On the Convergence of Iterative Methods for the Distribution Balancing Problem”, Transportation Research B: Methodological, vol. 15B, pp. 173–217, 1981.
ANSTREICHER K.M., BRIXIUS N.W., “A ...
Get Applications of Combinatorial Optimization, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
