I am looking for strongly NP-hard problems for a reduction. So far I have found the following problems:
- 3-partition problem
- bin-packing problem
- Numerical 3-dimensional matching
- Any NP-complete problem without numerical data, e.g., SATISFIABILITY, HAMILTONIAN CYCLE, 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.