메뉴 건너뛰기




Volumn 11, Issue 1, 1999, Pages 63-77

Analyzing infeasible mixed-integer and integer linear programs

Author keywords

Infeasibility; Mixed integer and integer linear programming

Indexed keywords


EID: 0007993386     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.11.1.63     Document Type: Article
Times cited : (42)

References (10)
  • 1
    • 0013534269 scopus 로고
    • Branch and bound experiments in zero-one programming
    • R. BREU and C.A. BURDET, 1974. Branch and Bound Experiments in Zero-One Programming, Mathematical Programming Study 2, 1-50.
    • (1974) Mathematical Programming Study , vol.2 , pp. 1-50
    • Breu, R.1    Burdet, C.A.2
  • 2
    • 0028271282 scopus 로고
    • MINOS(IIS): Infeasibility analysis using MINOS
    • J.W. CHINNECK, 1994. MINOS(IIS): Infeasibility Analysis Using MINOS, Computers and Operations Research 21, 1-9.
    • (1994) Computers and Operations Research , vol.21 , pp. 1-9
    • Chinneck, J.W.1
  • 4
    • 0029775543 scopus 로고    scopus 로고
    • Computer codes for the analysis of infeasible linear programs
    • J.W. CHINNECK, 1996. Computer Codes for the Analysis of Infeasible Linear Programs, Journal of the Operational Research Society 47, 61-72.
    • (1996) Journal of the Operational Research Society , vol.47 , pp. 61-72
    • Chinneck, J.W.1
  • 5
    • 0001844257 scopus 로고    scopus 로고
    • Feasibility and viability
    • T. Gal and H.J. Greenberg (eds.), International Series in Operations Research and Management Science 6, Kluwer Academic Publishers, Boston
    • J.W. CHINNECK, 1997. Feasibility and Viability, in Advances in Sensitivity Analysis and Parametric Programming, T. Gal and H.J. Greenberg (eds.), International Series in Operations Research and Management Science 6, 14-1 to 14-41, Kluwer Academic Publishers, Boston.
    • (1997) Advances in Sensitivity Analysis and Parametric Programming , pp. 141-1441
    • Chinneck, J.W.1
  • 6
    • 0040579961 scopus 로고    scopus 로고
    • Finding a useful subset of constraints for analysis in an infeasible linear program
    • J.W. CHINNECK, 1997. Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program, INFORMS Journal on Computing 9, 164-174.
    • (1997) INFORMS Journal on Computing , vol.9 , pp. 164-174
    • Chinneck, J.W.1
  • 7
    • 0026126376 scopus 로고
    • Locating minimal infeasible constraint sets in linear programs
    • J.W. CHINNECK and E.W. DRAVNIEKS, 1991. Locating Minimal Infeasible Constraint Sets in Linear Programs, ORSA Journal on Computing 3, 157-168.
    • (1991) ORSA Journal on Computing , vol.3 , pp. 157-168
    • Chinneck, J.W.1    Dravnieks, E.W.2
  • 9
    • 0002707458 scopus 로고
    • An algorithm for integer solutions to linear programs
    • McGraw-Hill Book Company, New York
    • R.E. GOMORY, 1963. An Algorithm for Integer Solutions to Linear Programs, in Recent Advances in Mathematical Programming, McGraw-Hill Book Company, New York.
    • (1963) Recent Advances in Mathematical Programming
    • Gomory, R.E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.