HaoYang Che

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The black and white traveling salesman problem (BWTSP) is a new class of NP-hard problem arising from work on airline scheduling and telecommunication fiber networks. The existing Ghiani LP for the undirected BWTSP contains an exponential number of constraints. For a special case of the directed BWTSP whose L = +∞ , the LP with polynomial number of(More)
  • 1