Sensitivity Analysis in Integer Programming-Reference-Cited by-同舟云学术

Sensitivity Analysis in Integer Programming

Published:1977 Issue: Volume: Page:467-477
ISSN:0167-5060
Container-title:Studies in Integer Programming
language:
Short-container-title:

Author:

Shapiro Jeremy F.

Publisher

Elsevier

Reference21 articles.

1. D.E. Bell, Improved bounds for integer programs: A supergroup approach, IIASA RM-73–5, International Institute for Applied Systems Analysis, Laxenburg, Austria, 1973, to appear in SIAM J. Appl. Math.

2. Improved integer programming bounds using intersections of corner polyhedra;Bell;Math. Programming,1975

3. D.E. Bell J.F. Shapiro, A convergent duality theory for integer programming, RM 75–33, International Institute for Applied Systems Analysis, Schloss Laxenburg, Austria, 1975, to appear in Operations Research, 1977

4. A subadditive approach to the group problem of integer programming;Burdet;Math. Programming Study,1974

5. C.A. Burdet E.L. Johnson, A subadditive approach to solve linear integer programs, 1975

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiple cost coefficients sensitivity theorems of integer linear optimization;Optimization;2021-03-07

2. References;Integer and Combinatorial Optimization;2014-08-22

3. An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization;Operations Research/Computer Science Interfaces Series;1998

4. References;Discrete Optimization;1988

5. Parameterisation algorithms for the integer linear programs in binary variables;European Journal of Operational Research;1984-07