Evolving test instances of the Hamiltonian completion problem

DOI10.1016/J.COR.2022.106019MaRDI QIDQ2108108zbMATH OpenOpenAlexWikidataFDO

Authors Thibault Lechien, Jorik Jooken, 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 instancesHamiltonian completion probleminstance space

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Generating new test instances by evolving in instance space
• Evolutionary operators for the Hamiltonian completion problem
• Generating hard and diverse test sets for NP-hard graph problems
• Evolutionary Computation in Combinatorial Optimization
• Towards objective measures of algorithm performance across instance space

Cites work

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

Cited in

(5)

• Generating hard and diverse test sets for NP-hard graph problems
• Evolutionary operators for the Hamiltonian completion problem
• Generating new test instances by evolving in instance space
• Evolving diverse TSP instances by means of novel and creative mutation operators
• Machine scheduling instance generation by reverse engineering from instance space analysis

Describes a project that uses

Uses Software

• SNAP
• LKH
• Concorde

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108108)