Analyzing Infeasible Mixed-Integer and Integer Linear Programs

References

• Breu R., Burdet C. A. Branch and bound experiments in zero-one programming. Mathematical Programming Study (1974) 2:1–50Crossref, Google Scholar
• Chinneck J. W. MINOS(IIS): Infeasibility analysis using MINOS. Computional Operations Research (1994) 21:1–9Crossref, Google Scholar
• Chinneck J. W. Analyzing infeasible nonlinear programs. Computional Optimization Applications (1995) 4:167–179Crossref, Google Scholar
• Chinneck J. W. Computer codes for the analysis of infeasible linear programs. Journal of Operational Research Society (1996) 47:61–72Crossref, Google Scholar
• Chinneck J. W., Gal T., Greenberg H. J. Feasibility and viability. Advances in Sensitivity Analysis and Parametric Programming (1997) 6(Kluwer Academic Publishers, Boston) 14-1–14-41International Series in Operations Research and Management ScienceCrossref, Google Scholar
• Chinneck J. W. Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS Journal on Computing (1997) 9:164–174Link, Google Scholar
• Chinneck J. W., Dravnieks E. W. Locating minimal infeasible constraint sets in linear programs. ORSA Journal on Computing (1991) 3:157–168Link, Google Scholar
• CPLEX Optimization IncUsing the CPLEX Callable Library (1994) Google Scholar
• Gomory R. E. An algorithm for integer solutions to linear programs. Recent Advances in Mathematical Programming (1963) (McGraw-Hill Book Company, New York) Google Scholar
• Greenberg H. J.A Computer-Assisted Analysis System for Mathematical Programming Models and Solutions: A User's Guide for ANALYZE (1993) (Kluwer Academic Publishers, Boston) Crossref, Google Scholar
• Guieu O.Analyzing Infeasible Mixed-Integer and Integer Linear Programs (1995) (Systems and Computer Engineering Carleton University, Ottawa, Canada) . M.Sc. thesisCrossref, Google Scholar
• Hoffman A. J., Padberg M. LP-based combinatorial problem solving. Annals of Operations Research (1985) 4:145–194Crossref, Google Scholar
• Lawler E. L., Lenstra J. K., Rinooy Kan A. H. G., Shmoys D. B.The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization (1985) (John Wiley and Sons, New York) Google Scholar
• Murty K. G.Linear Programming (1983) (John Wiley & Sons, New York) Google Scholar
• Nemhauser G. L., Savelsbergh M. W. P., Sigismondi G. C. MINTO: A mixed INTeger optimizer. Operations Research Letters (1994) 15:47–58Crossref, Google Scholar
• Parker R. G., Rardin R. L. Heuristic aspects of branch and bound. Discrete Optimization (1988) (Academic Press, Boston) Google Scholar
• Savelsbergh M. W. P. Preprocessing and probing techniques for mixed integer programming problems. ORSA Journal on Computing (1994) 6:445–454Link, Google Scholar
• Schrage L.LINDO: An Optimization and Modeling System (1991) 4th ed.(The Scientific Press, San Francisco) Google Scholar
• Tamiz M., Mardle S. J., Jones D. F. Detecting IIS in infeasible linear programmes using techniques from goal programming. Computers Operations Research (1996) 23:113–119Crossref, Google Scholar
• Tamiz M., Mardle S. J., Jones D. F. Resolving inconsistency in infeasible linear programmes. (1995) . Technical report, School of Mathematical Studies, University of Portsmouth, UKGoogle Scholar
• Winston W. L.Introduction to Mathematical Programming: Applications and Algorithms (1995) (Duxbury Press, Belmont, CA) Google Scholar
• Wolsey L. A. Strong formulations for mixed integer programming: A survey. Mathematical Programming (1989) 45:173–191Crossref, Google Scholar