MENU
Guest wrote:Minor Update for Previous Post:
"We apply that higher average voltage to our circuit and gradually increase or decrease the voltage until all appropriate light bulbs of the circuit are turned on. Next, we measure the voltages of all appropriate branches of the circuit, and we compute any difference between assigned values and the measured values..."
Important Remark: We must sum all branch values (weights/voltages) after each applied voltage increase or decrease, generally, relative to the higher average voltage until the minimum (optimal) sum of all branch values (voltages) is achieved. Thus, we have confirmed that the optimal solution of TSP is achievable in polynomial time or less.
Moreover, minimize S (sum of all branch values (weights or voltages) for the undirected weighted graph or electrical circuit) subject to an increase or decrease or no change relative (generally) to the higher average value (voltage), [tex]H_{avg }[/tex], or more simply:
Minimize S relative to or at [tex]H_{avg }[/tex] where [tex]H_{avg }[/tex] is the average of all branch values... of our graph/circuit greater than the overall average branch value..., [tex]B_{avg }[/tex], where [tex]B_{avg }[/tex] = total sum of all branch values/weights/voltages of graph/circuit divided by the total number of branch values/weights/voltages for our graph/circuit.
Remark: Minimize S relative to or at [tex]H_{avg }[/tex]...
Thus, we have tentatively/briefly constructed a polynomial-time algorithm that solves TSP, optimally.
Math works! Thank Lord GOD! Amen! Go Blue!
P.S. We apologize for any flawed reasoning, poor grammar, or any other mistakes in this post or previous posts Thank you!
