Postoptimality analysis in integer programming by implicit enumeration: The mixed integer case
- 1 December 1974
- journal article
- research article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 21 (4) , 595-607
- https://doi.org/10.1002/nav.3800210404
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Postoptimality analysis in zero‐one programming by implicit enumerationNaval Research Logistics Quarterly, 1972
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- A Branch-and-Bound Algorithm for Zero-One Mixed Integer Programming ProblemsOperations Research, 1971
- Integer Programming by Implicit Enumeration and Balas’ MethodSIAM Review, 1967
- An Algorithm for the Solution of Mixed Integer Programming ProblemsManagement Science, 1966
- An Additive Algorithm for Solving Linear Programs with Zero-One VariablesOperations Research, 1965
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965
- An Algorithm for the Traveling Salesman ProblemOperations Research, 1963
- Integer Programming and PricingEconometrica, 1960
- An Automatic Method of Solving Discrete Programming ProblemsEconometrica, 1960