I am looking for strongly NP-hard problems for a reduction.So far I have found the following problems:3-partition problembin-packing problemNumerical 3-dimensional matchingTSPAny NP-complete problem without numerical data, e.g., SATISFIABILITY, HAMILTONIANCYCLE, 3-COLOURABILITY.Does anyone know of a list of strongly NP-hard problems?If not, let's build one here.Do you know of other problems with numerical data that are strongly NP-hard?I'm particularly interested in strongly NP-hard problems on weighted graphs.
List of strongly NP-hard problems with numerical data
np hardness;big list;hamiltonian paths