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

Published 2007 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits
Authors
Keywords
-
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 194, Issue 1, Pages 39-50
Publisher
Elsevier BV
Online
2007-12-28
DOI
10.1016/j.ejor.2007.12.014

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Add your recorded webinar

Do you already have a recorded webinar? Grow your audience and get more views by easily listing your recording on Peeref.

Upload Now
Webinars Posters Questions Hubs Funding Journals Articles Connect Collections Reviewers About Us FAQs Mobile App Privacy Policy Terms of Use
© Peeref 2019-2024. All rights reserved.