ms·1984년 12월 1일
School Timetabling—A Case in Large Binary Integer Linear Programming
Management Science
138
피인용
4.6
FWCI
1
IS/마케팅/OM 탑저널 피인용
33
IS/마케팅/OM 탑저널 참고문헌
- 주제수리최적화 알고리즘 · 생산·최적화
01Abstract
A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented. The solution method also incorporates a branch and bound procedure which takes advantage of special ordered sets of variables. We present computational results for a large timetabling problem involving 900 subjects in a one-year graduate program.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 30(12) · 1473–1489
- 토픽Scheduling and Timetabling Solutions · Management Science and Operations Research
- DOI10.1287/mnsc.30.12.1473
- 저자Arabinda Tripathy