ms·1983년 12월 1일
An Algorithm for Multiobjective Zero-One Linear Programming
Gülseren Kiziltan, Erkut Yucaoǧlu
Management Science
80
피인용
3.1
FWCI
3
IS/마케팅/OM 탑저널 피인용
9
IS/마케팅/OM 탑저널 참고문헌
- 주제수리최적화 알고리즘 · 생산·최적화
01Abstract
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.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 29(12) · 1444–1453
- 토픽Vehicle Routing Optimization Methods · Industrial and Manufacturing Engineering
- DOI10.1287/mnsc.29.12.1444
- 저자Gülseren Kiziltan, Erkut Yucaoǧlu