J. Sakuma and S. Kobayashi, A genetic algorithm for privacy preserving combinatorial optimization, Proceedings of the 9th annual conference on Genetic and evolutionary computation , GECCO '07, pp.1372-1379, 2007.
DOI : 10.1145/1276958.1277214

C. Clifton, A. Iyer, R. Cho, W. Jiang, M. Kantarcioglu et al., An Approach to Securely Identifying Beneficial Collaboration in Decentralized Logistics Systems, Manufacturing & Service Operations Management, vol.10, issue.1, 2008.
DOI : 10.1287/msom.1070.0167

Y. Hong, J. Vaidya, and H. Lu, Secure and efficient distributed linear programming, Journal of Computer Security, vol.20, issue.5, pp.583-634, 2012.
DOI : 10.3233/JCS-2012-0452

Y. Hong, J. Vaidya, H. Lu, and B. Shafiq, Privacy-Preserving Tabu Search for Distributed Graph Coloring, 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing, pp.951-958, 2011.
DOI : 10.1109/PASSAT/SocialCom.2011.116

Y. Hong, J. Vaidya, and S. Wang, A Survey of Privacy-Aware Supply Chain Collaboration: From Theory to Applications, Journal of Information Systems, vol.28, issue.1, 2014.
DOI : 10.2308/isys-50692

A. C. Yao, How to generate and exchange secrets, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.162-167, 1986.
DOI : 10.1109/SFCS.1986.25

O. Goldreich, The Foundations of Cryptography, 2004.

J. Li and M. J. Atallah, Secure and Private Collaborative Linear Programming, 2006 International Conference on Collaborative Computing: Networking, Applications and Worksharing, pp.1-8, 2006.
DOI : 10.1109/COLCOM.2006.361848

J. Vaidya, A Secure Revised Simplex Algorithm for Privacy-Preserving Linear Programming, 2009 International Conference on Advanced Information Networking and Applications, 2009.
DOI : 10.1109/AINA.2009.133

O. Catrina and S. De-hoogh, Secure Multiparty Linear Programming Using Fixed-Point Arithmetic, ESORICS, pp.134-150, 2010.
DOI : 10.1007/978-3-642-15497-3_9

W. Du, A Study of Several Specific Secure Two-party Computation Problems, 2001.

J. Vaidya, Privacy-preserving linear programming, Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, 2002.
DOI : 10.1145/1529282.1529729

A. Bednarz, N. Bean, and M. Roughan, Hiccups on the road to privacy-preserving linear programming, Proceedings of the 8th ACM workshop on Privacy in the electronic society, WPES '09, pp.117-120, 2009.
DOI : 10.1145/1655188.1655207

A. Bednarz, Methods for Two-party Privacy-preserving Linear Programming, 2012.

Y. Hong, J. Vaidya, and H. Lu, Efficient Distributed Linear Programming with Limited Disclosure, DBSec, pp.170-185, 2011.
DOI : 10.1007/978-3-642-22348-8_14

O. L. Mangasarian, Privacy-preserving horizontally partitioned linear programs, Optimization Letters, vol.185, issue.3, pp.431-436, 2012.
DOI : 10.1007/s11590-010-0268-9

O. L. Mangasarian, Privacy-preserving linear programming, Optimization Letters, vol.185, issue.1, pp.165-172, 2011.
DOI : 10.1007/s11590-010-0199-5

W. Li, H. Li, and C. Deng, Privacy-preserving horizontally partitioned linear programs with inequality constraints, Optimization Letters, vol.185, issue.1, pp.137-144, 2013.
DOI : 10.1007/s11590-011-0403-2

Y. Hong and J. Vaidya, An inference???proof approach to privacy-preserving horizontally partitioned linear programs, Optimization Letters, vol.185, issue.1, pp.267-277, 2014.
DOI : 10.1007/s11590-012-0572-7

O. Goldreich, S. Micali, and A. Wigderson, How to play any mental game -a completeness theorem for protocols with honest majority, Proceedings of the 19th ACM Symposium on the Theory of Computing, pp.218-229, 1987.

M. Ben-or, S. Goldwasser, and A. Wigderson, Completeness theorems for noncryptographic fault-tolerant distributed computation, Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp.1-10, 1998.

C. H. Papadimitriou and K. Steiglitz, Combinatorial optimization: algorithms and complexity, 1982.

S. Kirkpatrick, C. D. Gelatt, and M. P. Jr, Optimization by Simulated Annealing, Science, vol.220, issue.4598, pp.671-680, 1983.
DOI : 10.1126/science.220.4598.671

G. A. Croes, A Method for Solving Traveling-Salesman Problems, Operations Research, vol.6, issue.6, pp.791-812, 1958.
DOI : 10.1287/opre.6.6.791

P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, Advances in Cryptology -Eurocrypt '99 Proceedings, LNCS 1592, pp.223-238, 1999.
DOI : 10.1007/3-540-48910-X_16

N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of State Calculations by Fast Computing Machines, The Journal of Chemical Physics, vol.21, issue.6, p.1087, 1953.
DOI : 10.1063/1.1699114

A. Ben-david, N. Nisan, and B. Pinkas, FairplayMP, Proceedings of the 15th ACM conference on Computer and communications security, CCS '08, pp.257-266, 2008.
DOI : 10.1145/1455770.1455804

I. Ioannidis and A. Grama, An efficient protocol for Yao's millionaires' problem, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the, pp.205-210, 2003.
DOI : 10.1109/HICSS.2003.1174464

B. Kim, J. Shim, and M. Zhang, Comparison of tsp algorithms, Project for Models in Facilities Planning and Materials Handling, 1998.

D. Bogdanov, S. Laur, and J. Willemson, Sharemind: A Framework for Fast Privacy-Preserving Computations, ESORICS, pp.192-206, 2008.
DOI : 10.1007/s001459910003

Y. Zhang, A. Steele, and M. Blanton, PICCO, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.813-826, 2013.
DOI : 10.1145/2508859.2516752