Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem

DOI10.1007/s10589-021-00326-yzbMath1484.90087arXiv1503.01815OpenAlexW3212515187WikidataQ114227022 ScholiaQ114227022MaRDI QIDQ2070343

Michael Haythorpe, Walter Murray

Publication date: 24 January 2022

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.01815

zbMATH Keywords

global optimizationHamiltonian cyclesnegative curvaturediscrete optimizationbarrier functionsbinary variables

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Uses Software

• LKH
• Bonmin

Cites Work

• A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
• An algorithm for nonlinear optimization problems with binary variables
• Deterministic ``snakes and ladders heuristic for the Hamiltonian cycle problem
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• On the determinant and its derivatives of the rank-one corrected generator of a Markov chain on a graph
• Determinants and Longest Cycles of Graphs
• Newton-type methods for unconstrained and linearly constrained optimization
• Reducibility among Combinatorial Problems
• Newton Methods for Large-Scale Linear Equality-Constrained Minimization
• Algorithms and Data Structures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem