Alexei E. Zverovitch

Learn More
It is shown that the problem of detecting a maximum embedded network in a linear program is related to balancing of subgraphs of signed graphs. This approach leads to a simple e3cient heuristic to extract an embedded network. The proposed heuristic also determines whether a given linear program is a (re4ected) network itself. Some complexity results are(More)
The Resource-Constrained Traveling Salesman Problem (RCTSP) is formulated as follows. A set of n cities is given (denoted by V ); travelling from city i to city j incurs cost cij as well as resource consumption rij . The objective is to find a minimum cost Hamilton cycle (or tour) that consumes not more than Rmax units of the resource, where Rmax is some(More)
  • 1