Title 最大カットのベンチマークを最適化ソルバーで解く (計 算理論とアルゴリズムの新潮流) Author(s) 生田, 拓人; 今井, 浩; 矢野, 洋祐 Citation 数理解析研究所講究録 (2015), 1941: 49-56 Issue Date 2015-04 URL http://hdl.handle.net/2433/223801 Right Type Departmental Bulletin Paper Textversion publisher Kyoto University
9
Embed
Title 最大カットのベンチマークを最適化ソルバーで解く (計 …...最大カットのベンチマークを最適化ソルバーで解く 生田拓人 $*$, 今井浩
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
[1] N. Alon and A. Naor: Approximating the Cut-Norm via Grothendieck’s Inequality. SIAM Jour-nal on Computing, Vol.35, No.4 (2006), pp.787-
803.
[2] K. Aoshima and M. Iri: Comments on F. Had-lock’s Paper: “Finding a Maximum Cut of a Pla-nar Graph in Polynomial Time.” SIAM Journalon Computing, Vol.6, No.1 (1977), pp.86-87.
[3] D Avis, H. Imai and T. Ito: On the Relationship
between Convex Bodies Related to Correlation
Experiments with Dichotomic Observables. Jour-
54
nal of Physics A: Mathematical General, Vol.39No 36 (2006), pp11283-11299.
[4] D. Avis, H. Imai and T. Ito: Generating Facetsfor the Cut Polytope of aGraph by Trian-gular Elimination. Mathematical Programming,Vo1.112, No.2 (2008), pp.303-325.
[5] D. Avis, H. Imai, T. Ito and Y. Sasaki: Two-Party Bell Inequalities Derived from Combina-torics via Triangular Elimination. Journal ofPhysics $A$ : Mathematical and Genera4 Vol.38(2005), pp.10971-10987.
[6] D. Avis and H. R. Tiwari: On the Exten-sion Complexity of Combinatorial Polytopes.ICALP 2013, Lecture Notes in Computer Science,
Vol.7965 (2013), pp.57-68.
[7] F. Barahona: On Cuts and Matchings in Pla-nar Graphs. Mathematical Programming, Vol.60(1993) pp.53-6S.
[8] U. Benlic and J.-K. Hao: Breakout Local Searchfor the Max-Cut Problem. Engineemng Appli-cations of Artificial Intelligence, vol.26 (2013),pp.1162-1173.
[9] C. Bliek, P. Bonami and A. Lodi: Solving Mixed-Integer Quadratic Programming problems with
IBM-CPLEX: AProgress Report. Proceedings
of the Twenty-Sixth RAMP Symposium, 2014,pp.171-180.
[10] S. Boixo, T. F. Rnnow, S. V. Isakov, Z. Wang,D. Wecker, D. A. Lidar, J. M. Martinis and M.Troyer: Evidence for Quantum Annealing withMore Than One Hundred Qubits. Nature Physics,Vol.10 (2014), pp.218-224.
[11] R. Cleve, P. Hoyer, B. Toner and J. Watrous:Consequences and Limits of Nonlocal Strategies.Proceedings of the 19th IEEE Annual Conferenceon Computational Complexity (CCC’04), 2004,pp.236-249.
[12] S. Dash: A Note on QUBO Instances Defined onChimera Graphs. arXiv:1306.1202, 2013.
[13] C. De Simone, M. Diehl, M. J\"unger, P. Mutzel,G. Reinelt and G. Rinaldi: Exact Ground Statesof Ising Spin Glasses: New Experimental Resultswitha Branch-and-Cut Algorithm. Journal of Sta-tistical Physics, vol.80, Nos.1-2 (1995), pp.487-496.
[14] M. M. Deza and M. Laurent: Geometry of Cutsand Metrecs. Algorithms and Combinatorics Series, Vol.15, Springer, 1997.
[15] S. Fiorini, S. Massar, S. Pokutta, H. R. Ti-wary and R. de Wolf: Linear vs. SemidefiniteExtended Formulations: Exponential Separationand Strong Lower Bounds. Proceedings of the 44thAnnual ACM symposium on Theory of computing(STOC ’12), 2012, pp.95-106.
[16] F. V. Fomin and D. Kratsch: Exact EmponentialAlgorzthms. Springer, 2010.
[18] K. Fvkuda: Frequently Asked Questions in Poly-
hedraJ Computation. www.itor.math.ethz. ch/
\sim fukuda/polyfaq/polyfaq.html
[19] H. N. Gabow: A Matroid Approach to Finding
Edge Connectivity and Packing Arborescences.Journal of Computer and System Sciences, Vol.50(1995), pp.259-273.
[20] M. R. Garey and D. S. Johnson: Computers
and Intractability -A Guide to the Theory ofNP-Completeness. W. H. Freeman and Company,New York, 1979.
[21] M. X. Goemans and D. P. Williamson: Im-proved Approximation Algorithms for MaximumCut and Satisfiability Problems Using Semidefi-nite Programming. Journal of the ACM, Vo1.42,No.6 (1995), pp.1115-1145.
[22] L. Grippo, L. Palagi, M. Piacentini, V. Pic-cialli and G. Rinaldi: SpeeDP: An Algorithm
to Compute SDP Bounds for Very Large Max-Cut Instances. Mathematical Programming, Ser.B, Vo1.136 (2012), pp.353-373/
[23] G-set, web stanford edu$/^{-}$yyye/yyye/Gset/
[24] F. Hadlock: Finding a Maximum Cut of aPla-nar Graph in Polynomial Time. SIAM Journalon Computing, Vol.4, No.3 (1975), pp.221-225.
[25] P. Hammer: Some Network Flow ProblemsSolved with Pseudo-Boolean Programming. Op-erations Research, Vo.13 (1965), pp.388-399.
[26] J. Hastad: Some Optimal Inapproximability Re-sults. Journal of the ACM, Vo1.48, No.4 (2001),pp.798-859.
[27] H. Imai, M. Hachimori, M. Hamada, H.Kobayashi and K. Matsumoto: optimization inQuantum Computation and Information. Pro-ceedings of the 2nd Japanese-Hungarian Sympo-
sium on Duscrete Mathematics and Its Applica-
tions, Budapest, 2001, pp.60-69.
[28] T. Ito, H. Imai and D. Avis: Bell inequalities
stronger than the Clauser-Horne-Shimony-HoltInequality for Three-Level Isotropic States. Phys-ical Review A, Vo1.73, 042109 (2006), 9pp.
[29] D. R. Karger: Minimum Cuts in Near-LinearTime. Joumal of the ACM, Vo1.47, No.1 (2000),pp.46-76.
[30] S. Khot: On the Power of Unique 2-Prover 1-Round Games. Proceedings of the 34th AnnualACM Symposium on Theory of computing (STOC’02), 2002, pp.767-775.
[31] G. A. Kochenberger, J.-K. Hao, Z. L\"u, H. Wang
and G. Glover: Solving Large Scale Max CutProblems via Tabu Search. Joumal of Heunstics,
Vol.19 (2013), pp.565-571.
[32] F. Le Gall: Powers of Tensors and Fast Ma-trix Multiplication. Proceedings of the 39th Inter-
55
national Symposium on Symbolic and AlgebraicComputation (ISSAC 2014), 2014, pp.29&303.
[33] A. Marandi, Z. Wang, K. Takata, R. L. Byer andY. Yamamoto: Network of TimeMultiplexed Op-
tical Parametric Oscillators as a Coherent Ising
Machine. Nature Photonics, Vol.8 (2014), pp.937-
942.
[34] 宮代隆平: 整数計画法メモ.ww.tuat.ac.jp/$\sim$
niya/
ipmemo.htnl
[35] H. Nagamochi and T. Ibaraki: Computing EdgeConnectivity in Multigraphs and Capacitated
Graphs. SIAM Journal on Discrete Mathematics,Vol.5, No.1 (1992), pp.54-66.
[36] G. I. Orlova and Ya. G. Dorfnan: Finding theMaximum Cut in a Graph (English Thanslation).Engineering Cybernetics, Vol.10 (1972), pp.502-
506.
[37] G. Rinaldi: Rudy. vvv-user.tu-chemnitz. de/$\sim$
helnberg/rudy.tar.gz, 1998.
[38] T. Takahashi, H. Imai, S. Moriyama and D.Avis: Quantum Correlation and Semidefinite Re-laxation through -Prover 1-Round InteractiveProof. Proceedings of the Annual Doctoral Work-shop on Mathematical and Engineering Meth-ods in Computer Science (MEMICS 2007), 2007,pp.217-224.
[39] L. Tbevisan, G. B. Sorkin, M. Sudan and D. P.Williamson: Gadgets, Appr-ation, and Lin-ear Programming. SIAM Journal on Computing,Vol.29 No.6 (2000), pp.2074-2097.
[40] Y. Wang, Z. L\"u, F. Glover and J.-K. Hao: Proba-bilisitic GRASP-Tabu Search Algorithms for theUBQP Problem Computers and Operations Re-
search Vo1.40 (2013), pp.3100-3107.
[41] M. Yannakakis: Expressing Combinatorial Opti-
mization Problems by Linear Programs. Joumal
of Computer and System Sciences, Vol.43 (1991),pp.441-466.
[42] H. P. Yuen, R. S. Kennedy and M. Lax: Optimum
Testing of Multiple Hypotheses in Quantum De-tection Theory. IEEE Transactions on Informa-tion Theory, Vol.21, No.2 (1975), pp.125-134.
[43] G.M. Ziegler: Lectures on Polytopes. GraduateTexts in Mathematics 152, Springer-Verlag, 1995.