DIR Return Create A Forum - Home
       ---------------------------------------------------------
       knight tours
  HTML https://knighttours.createaforum.com
       ---------------------------------------------------------
       *****************************************************
   DIR Return to: general Hamiltonian cycles problem
       *****************************************************
       #Post#: 22--------------------------------------------------
       Longest Path Dynamic Programming (LPDP)
       By: gsgs Date: August 9, 2023, 9:50 pm
       ---------------------------------------------------------
       software available here :
  HTML http://algo2.iti.kit.edu/kalp/
       but it's complicated, I couldn't yet install iy
       ---------------------------------------
       Parallel Optimal Longest Path Search
       2018  Master Thesis of  Kai Fieger
       ... 6.9 Hamiltonian Cycle
       ... for the 1001 FHCP-graphs LPDP used 64 threads and had
       a time limit of 5 minutes per instance.
       This resulted in 403 of 1001 instances being solved.
       ..All solved instances were solved within a few seconds.
       358 of the instances were solved in under one second.
       max. was 2.032, 2.079, 3.001 and 6.700 seconds.
       ---------------
       Concorde with 5 min time limit per graph
       solved 56 problems , 30 of them were not solved by LPDP
       *****************************************************