ms·2003년 9월 1일
A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti
Management Science
203
피인용
4.4
FWCI
2
IS/마케팅/OM 탑저널 피인용
20
IS/마케팅/OM 탑저널 참고문헌
- 주제수리최적화 · 생산·최적화
01Abstract
We study a generic minimization problem with separable nonconvex piecewise linear costs, showing that the linear programming (LP) relaxation of three textbook mixed-integer programming formulations each approximates the cost function by its lower convex envelope. We also show a relationship between this result and classical Lagrangian duality theory.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 49(9) · 1268–1273
- 토픽Complexity and Algorithms in Graphs · Computational Theory and Mathematics
- DOI10.1287/mnsc.49.9.1268.16570
- 저자Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti