Evolving test instances of the Hamiltonian completion problem

DOI10.1016/j.cor.2022.106019OpenAlexW3097237292WikidataQ114193023 ScholiaQ114193023MaRDI QIDQ2108108

Jorik Jooken, Thibault Lechien, Patrick de Causmaecker

Publication date: 19 December 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

evolving instancesinstance spaceHamiltonian completion problem

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• SNAP
• LKH
• Concorde

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards objective measures of algorithm performance across instance space
• Generating new test instances by evolving in instance space
• Discovering the suitability of optimisation algorithms by learning from evolved instances
• The energy of a graph
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• Instance spaces for machine learning classification
• Measuring instance difficulty for combinatorial optimization problems
• Where are the hard knapsack problems?
• Testing heuristics: We have it all wrong
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis
• A new class of hard problem instances for the 0-1 knapsack problem
• Local search algorithms for finding the Hamiltonian completion number of line graphs
• Statistical mechanics of complex networks
• Optimal Hamiltonian completions and path covers for trees, and a reduction to maximum flow
• Evolving diverse TSP instances by means of novel and creative mutation operators

This page was built for publication: Evolving test instances of the Hamiltonian completion problem