Using Integer Programming to Search for Counterexamples: A Case Study
- 205 Downloads
It is known that there exist 4-regular, 1-tough graphs which are non-hamiltonian. The smallest such graph known has \(n=18\) nodes and was found by Bauer et al., who conjectured that all 4-regular, 1-tough graphs with \(n\le 17\) are hamiltonian. They in fact proved that this is true for \(n\le 15\), but left open the possibility of non-hamiltonian graphs of 16 or 17 nodes. By using ILP for modeling a counterexample, and then finding out that the model has no solutions, we give an algorithmic proof that their conjecture was indeed correct.
This research has been carried out in the framework of the departmental research project ICON: Innovative Combinatorial Optimization in Networks, Department of Mathematics, Computer Science and Physics (PRID 2017–2018), University of Udine, Italy.
- 8.DeLeon, M.: A study of sufficient conditions for hamiltonian cycles. Rose-Hulman Und. Math. J. 1(1), 1–19 (2000) Google Scholar
- 9.Desrosiers, J., Lübbecke, M.E.: Branch-Price-and-Cut Algorithms, in the Wiley Encyclopedia of Operations Research and Management Science. Wiley, Chichester (2010)Google Scholar
- 10.Gamrath, G., et al.: The SCIP Optimization Suite 3.2.1, ZIB-Report, pp. 15–60 (2016)Google Scholar
- 11.Hilbig, F.: Kantenstrukturen in nichthamiltonschen Graphen. Ph.D. thesis, Technische Universït at Berlin (1986)Google Scholar
- 15.McKay, B.D., Piperno, A.: nauty and Traces User’s Guide (Version 2.6) (2016)Google Scholar
- 16.Mitchell, J.E.: Branch-and-cut algorithms for combinatorial optimization problems. In: Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Applied Optimization, pp. 65–77. Oxford University Press, Oxford (2002)Google Scholar
- 18.Pfetsch, M.E., Rehn, T.: A computational comparison of symmetry handling methods for mixed integer programs (2015). http://www.optimization-online.org