Exact and heuristic algorithms for the interval min-max regret generalized assignment problem

Published 2018 View Full Article

  1. Home
  2. Publications
  3. Publication Search
  4. Publication Details
Title
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem
Authors
Keywords
-
Journal
COMPUTERS & INDUSTRIAL ENGINEERING
Volume 125, Issue -, Pages 98-110
Publisher
Elsevier BV
Online
2018-08-14
DOI
10.1016/j.cie.2018.08.007

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started
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.