Skip to main content
Share Your Experience: Take the 2024 Developer Survey

New answers tagged

-1 votes

Global optimization of state assignments in a directed graph with a tree-based distance cost

You should look into some quantum optimization methods that can be derived through matrice representation.
John Armstrong's user avatar
1 vote

Global optimization of state assignments in a directed graph with a tree-based distance cost

One approach is to use the big guns, i.e., a SAT solver or ILP (integer linear programming) solver. You could implement both and see if either is satisfactory for problems of the size you are dealing ...
D.W.'s user avatar
  • 161k
0 votes

Minimize cost for list of words given a list of letters

I don't know whether there is any efficient algorithm. One approach is to formulate this as an instance of integer linear programming and use an off-the-shelf ILP solver. Introduce zero-or-one ...
D.W.'s user avatar
  • 161k
4 votes
Accepted

How to find a binary vector with minimized distance with a vector set?

I think it strongly depends on the used distance. If the distance is decomposable, i.e. the contribution of each vector component to the distance can be isolated (for instance, Squared Euclidean ...
SilvioM's user avatar
  • 898

Top 50 recent answers are included