List of strongly NP-hard problems with numerical data 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
TSP
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.
Here is a strongly $NP$-complete problem (with numerical data as you requested):

Schur Triples problem:

Input: list of 3N distinct positive integers

Question: Is there a partition of the list into N triples $(a_i, b_i, c_i)$ such that $a_i + b_i= c_i$ for each triple $i$?

The condition that all numbers must be distinct makes the problem very interesting and McDiarmid calls it a surprisingly troublesome .