.png){kind=icon}
返回
An Algorithm for Multiobjective Zero-One Linear Programming
.png){kind=icon}
PRE
AI
DOI：10.1287/mnsc.29.12.1444.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A branch and bound algorithm is presented which is based on the extension of implicit enumeration techniques to multiobjective zero-one linear programming and which appears to be computationally quite efficient. Domination tests, aiming at identifying paths of the enumeration tree that lead to dominated solutions as high up the tree as possible, are developed. Some computational results are also given.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
暂无期刊信息
机构
暂无机构信息
引用论文
暂无论文信息