afffundno abstract
An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits2007· article· en· European Journal of Operational Research· Computer Science
363
citations