Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png European Journal of Operational Research Unpaywall

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

European Journal of Operational ResearchSep 1, 2009
Loading next page...
 
/lp/unpaywall/min-max-and-min-max-regret-versions-of-combinatorial-optimization-phQdBEVcos

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Unpaywall
ISSN
0377-2217
DOI
10.1016/j.ejor.2008.09.012
Publisher site
See Article on Publisher Site

Abstract

Journal

European Journal of Operational ResearchUnpaywall

Published: Sep 1, 2009

There are no references for this article.