An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits

出版年份 2007 全文链接

标题

作者

关键词

出版物

Volume 194, Issue 1, Pages 39-50

出版商

Elsevier BV

发表日期

2007-12-28

DOI

10.1016/j.ejor.2007.12.014

Explore over 38,000 international journals covering a vast array of academic fields.

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now