Sorry, we do not have enough data to show an influence graph for this author.
In this short note, the dual problem for the traveling salesman problem is constructed through the classic Lagrangian. The existence of opti-mality conditions is expressed as a corresponding inverse problem. A general 4-cities instance is given, and the numerical experiment shows that the classic Lagrangian may not be applicable to the traveling salesman… (More)
For boolean quadratic programming (BQP), we will show that there is no duality gap between the primal and dual problems under some conditions by using the classical Lagrangian duality. A benchmark generator is given to create random BQP problems which can be solved in polynomial time. Several numerical examples are generated to demonstrate the effectiveness… (More)