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

标题
Min–max and min–max regret versions of combinatorial optimization problems: A survey
作者
关键词
-
出版物
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 197, Issue 2, Pages 427-438
出版商
Elsevier BV
发表日期
2008-09-22
DOI
10.1016/j.ejor.2008.09.012

向作者/读者发起求助以获取更多资源

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

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started