Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a Branch-and-Cut algorithm where the volume algorithm is applied instead of the traditionally used dual simplex algorithm to the linear programming relaxations in the root node of the search tree. This means that  use fast approximate solutions to these linear programs instead of exact but slor solutions.  present computational results with the Steiner tree and Max-Cut problems.  show evidence that one can solve these problems much faster with the volume algorithm based Branch-and-Cut code than with a dual simplex based one.  discuss when the volume based approach might be more efficient than the simplex based approach.
['Francisco Barahona', 'Laszlo Ladanyi']
I am writing a research paper on a idea Branch and cut based on the volume algorithm : Steiner trees in graphs and max-cut
[{"from": "human", "value": "I am writing a research paper on a idea Branch and cut based on the volume algorithm : Steiner trees in graphs and max-cut"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  present a Branch-and-Cut algorithm where the volume algorithm is applied instead of the traditionally used dual simplex algorithm to the linear programming relaxations in the root node of the search tree. This means that  use fast approximate solutions to these linear programs instead of exact but slor solutions.  present computational results with the Steiner tree and Max-Cut problems.  show evidence that one can solve these problems much faster with the volume algorithm based Branch-and-Cut code than with a dual simplex based one.  discuss when the volume based approach might be more efficient than the simplex based approach."}]