Pendekatan Pencarian Lokal Dalam Optimisasi Kombinatorik
DAFTAR PUSTAKA
Arkin, E.M., dan Hassin, R. (1998). On Local Search for Weighted k-set packing.
Math. Oper. Res., 23, pp. 640 - 648.
Ausiello,G., dan Protasi,M. (1995). Local Search, Reducibility and Approximability of NP-Optimization Problems. Inform. Process. Lett. 54. pp. 73-79.
Baghel,M., Agrawal,S., dan Silakari,S. (2012). Survey Of Metaheuristic Algorithms
for Combinatorial Optimization. International J Comput. Vol 58. 0975-8887.
Choudhary,S., dan Purohit,G.N. (2011). Solving Combinatorial Optimization
Problem Using Distributed Approach. International Journal of Computer
Applications Vol 35. 0975-8887.
Fischer, S.T. (1995). A Note on The Complexity of local Search Problems. Inform.
Process. Left. 53 pp. 69-75.
Khana, S., Motwani, R., Sudan, M., Vazirani, U. (1998). On Syntactic Versus
Computational Views of Approximability. SIAM J. Comput. 19 pp. 742-749
Klauck,H. (1996). On The Hardness of Global and Local Approximation. Proceedings of the 5th Scandinavian Workshop on Algoritm Theory, Editor: Karlsson R.
Lawler, E., (1976). Combinatorial Optimization Networks and Matroids. Library of
Congress Cataloging in Publication Data. University of California at Berkeley.
Lee, J. (2004). A First Course in Combinatorial Optimization. Cambridge University Press.
Lin, S. (1965). Computer Solutions of The Traveling Salesman Problem. Bell System Tech. J. 44 pp. 2245-2269.
Orlin, J.B., Punnen,A.P., dan Schulz,S. (2004). Approximate Local Search in Combinatorial Optimization. SIAM J Comput. Vol 33. No.5. pp 1201-1214.
Papadimitriou, C.H., dan Steiglitz, K. (1977). On the Complexity of Local Search
for the Travelling Salesman Problem. SIAM J. Comput. 6. pp. 76-83.
Schaffer, A.A., dan Yannakakis, M. (1991). Simple Local Search Problems That
Are Hard to Solve. SIAM J. Comput. Vol 20. pp. 56-87.
Schulz, A.S., dan Weismantel, R. (1995). 0/1 Integer Programming : Optimization
and Augmentation are Equivalent. Lecture Note in Comput. Sci. Springer,
pp .473-483.
Schulz, A.S., dan Weismantel, R. (1999). An Oracle-Polynomial Time Augmentation Algoritm for Integer Programming. MD SIAM pp .967-968.
Schulz, A.S., dan Weismantel, R. (2002). The Complexity of Generic Primal Algorithms for Solving General Integer Programs, Math.Oper.Res. 27. pp .681-692.
Sharma, P. (2003). Local Search for Combinatorial Optimization Problem. 263,
275–310.
Yannakakis,M. (1997). Computational Complexity, Local Search in Combinatorial
Optimization. Wiley, Chichester, pp. 1955.
26
Universitas Sumatera Utara
Arkin, E.M., dan Hassin, R. (1998). On Local Search for Weighted k-set packing.
Math. Oper. Res., 23, pp. 640 - 648.
Ausiello,G., dan Protasi,M. (1995). Local Search, Reducibility and Approximability of NP-Optimization Problems. Inform. Process. Lett. 54. pp. 73-79.
Baghel,M., Agrawal,S., dan Silakari,S. (2012). Survey Of Metaheuristic Algorithms
for Combinatorial Optimization. International J Comput. Vol 58. 0975-8887.
Choudhary,S., dan Purohit,G.N. (2011). Solving Combinatorial Optimization
Problem Using Distributed Approach. International Journal of Computer
Applications Vol 35. 0975-8887.
Fischer, S.T. (1995). A Note on The Complexity of local Search Problems. Inform.
Process. Left. 53 pp. 69-75.
Khana, S., Motwani, R., Sudan, M., Vazirani, U. (1998). On Syntactic Versus
Computational Views of Approximability. SIAM J. Comput. 19 pp. 742-749
Klauck,H. (1996). On The Hardness of Global and Local Approximation. Proceedings of the 5th Scandinavian Workshop on Algoritm Theory, Editor: Karlsson R.
Lawler, E., (1976). Combinatorial Optimization Networks and Matroids. Library of
Congress Cataloging in Publication Data. University of California at Berkeley.
Lee, J. (2004). A First Course in Combinatorial Optimization. Cambridge University Press.
Lin, S. (1965). Computer Solutions of The Traveling Salesman Problem. Bell System Tech. J. 44 pp. 2245-2269.
Orlin, J.B., Punnen,A.P., dan Schulz,S. (2004). Approximate Local Search in Combinatorial Optimization. SIAM J Comput. Vol 33. No.5. pp 1201-1214.
Papadimitriou, C.H., dan Steiglitz, K. (1977). On the Complexity of Local Search
for the Travelling Salesman Problem. SIAM J. Comput. 6. pp. 76-83.
Schaffer, A.A., dan Yannakakis, M. (1991). Simple Local Search Problems That
Are Hard to Solve. SIAM J. Comput. Vol 20. pp. 56-87.
Schulz, A.S., dan Weismantel, R. (1995). 0/1 Integer Programming : Optimization
and Augmentation are Equivalent. Lecture Note in Comput. Sci. Springer,
pp .473-483.
Schulz, A.S., dan Weismantel, R. (1999). An Oracle-Polynomial Time Augmentation Algoritm for Integer Programming. MD SIAM pp .967-968.
Schulz, A.S., dan Weismantel, R. (2002). The Complexity of Generic Primal Algorithms for Solving General Integer Programs, Math.Oper.Res. 27. pp .681-692.
Sharma, P. (2003). Local Search for Combinatorial Optimization Problem. 263,
275–310.
Yannakakis,M. (1997). Computational Complexity, Local Search in Combinatorial
Optimization. Wiley, Chichester, pp. 1955.
26
Universitas Sumatera Utara