Min–max and min–max regret versions of combinatorial optimization problems: A survey

Published 2008 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Min–max and min–max regret versions of combinatorial optimization problems: A survey
Authors
Keywords
-
Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 197, Issue 2, Pages 427-438
Publisher
Elsevier BV
Online
2008-09-22
DOI
10.1016/j.ejor.2008.09.012

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

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More
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.