ms·1972년 1월 1일
Relaxation Methods for Pure and Mixed Integer Programming Problems
G. Anthony Gorry, Jeremy F. Shapiro, Laurence A. Wolsey
Management Science
37
피인용
5.3
FWCI
1
IS/마케팅/OM 탑저널 피인용
8
IS/마케팅/OM 탑저널 참고문헌
- 주제수리최적화 알고리즘 · 생산·최적화
01Abstract
The usefulness of group theoretic methods in solving integer programming (IP) problems is extended by procedures for controlling the size of the groups. The main procedure given shows how an optimal linear programming basis can be altered to reduce the magnitude of its determinant thereby reducing the size of the group induced by the basis. An adaption of Benders' mixed IP algorithm is given which uses these methods. Some limited computational experience is given.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 18(5-part-1) · 229–239
- 토픽Advanced Optimization Algorithms Research · Numerical Analysis
- DOI10.1287/mnsc.18.5.229
- 저자G. Anthony Gorry, Jeremy F. Shapiro, Laurence A. Wolsey