In this work, we are interested in nonlinear symmetric cone problems (NSCPs), which contain as special cases nonlinear semidefinite programming, nonlinear secondorder cone programming, and the ...
We transform a multiple traveling salesman problem with fixed charges for the assignment of salesmen and with a symmetric cost matrix to a standard symmetric traveling salesman problem.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback