1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ (1993).
2. M. F. Argüello, “Framework for Exact Solutions and Heuristics for Approximate Solutions to Airlines Irregular Operations Control Aircraft Routing Problem,” Ph.D. Dissertation, Department of Mechanical Engineering, University of Texas, Austin (1997).
3. M. F. Argüello, T. A. Feo, and O. Goldschmidt, “Randomized Methods for the Number Partitioning Problem,” Computers & Operations Research, 23(2), 103–111 (1996).
4. C. Barnhart, E. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance, “Branch-and-Price: Column Generation for Solving Huge Integer Programs,” School of Industrial and Systems Engineering Report, Georgia Institute of Technology (1994).
5. M. Desrochers, J. Desrosiers, and M. Solomon, “A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows,” Operations Research, 40(2), 342–354 (1992).