Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case

标题
Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case
作者
关键词
-
出版物
COMPUTERS & OPERATIONS RESEARCH
Volume 40, Issue 1, Pages 498-509
出版商
Elsevier BV
发表日期
2012-08-11
DOI
10.1016/j.cor.2012.08.003

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

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

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