Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River. Alpert, C. J. and Kahng, A. B. (1995). Recent directions in netlist partition- ing: A survey. Integration, the VLSI Journal, 19:1–81. Anily, S. and Bramel, J. (1999). Approximation algorithms for the capaci- tated traveling salesman problem with pickups and deliveries. Naval Re- search Logistics, 46:654–670. Anily, S., Gendreau, M., and Laporte, G. (1999). The swapping problem on a line. SIAM Journal on Computing, 29:327–335. Anily, S. and Hassin, R. (1992). The swapping problem. Networks, 22:419– 433. Applegate, D. L., Bixby, R. E., Chvátal, V., and Cook, W. J. (2006). The Traveling Salesman Problem: A Computational Study. Princeton Univer- sity Press, Princeton. Asbach, L., Dorndorf, U., and Pesch, E. (2009). Analysis, modeling and solution of the concrete delivery problem. European Journal of Operational Research, 193:820–835. Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., and Vance, P. H. (1998). Branch-and-price: Column generation for solving huge integer programs. Operations Research, 46:316–329. 126 Bibliography Battiti, R. and Tecchiolli, G. (1994). The reactive tabu search. ORSA Journal on Computing, 6:126–140. Bektas, T. (2006). The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega, 34:209–219. Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4:238–252. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., and Laporte, G. (2007)...
You are not authenticated to view the full text of this chapter or article.
This site requires a subscription or purchase to access the full text of books or journals.
Do you have any questions? Contact us.Or login to access all content.