Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

标题
Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
作者
关键词
Combinatorial optimization, Multiple objective programming, Bi-dimensional binary knapsack problem, Surrogate relaxation, Bound sets
出版物
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 244, Issue 2, Pages 417-433
出版商
Elsevier BV
发表日期
2015-01-28
DOI
10.1016/j.ejor.2015.01.035

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

Reprint

联系作者

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

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