1 research outputs found
using gavish-grave lp to formulate the directed black and white traveling salesman problem
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 const