메뉴 건너뛰기
Discrete Applied Mathematics
Volumn 81, Issue 1-3, 1998, Pages 133-139
Sensitivity analysis for knapsack problems: A negative result
Author keywords

[No Author keywords available]
Indexed keywords

EID: 0042123196     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(97)00080-2     Document Type: Article
Times cited : (13)
References (10)
  • 1
    • 0041958891 scopus 로고
    • Aggregation of nonnegative integer-valued equations
    • D.A. Babayev, F. Glover, Aggregation of nonnegative integer-valued equations, Discrete Appl. Math. 8 (1984) 125-130.
    • (1984) Discrete Appl. Math. , vol.8 , pp. 125-130
    • Babayev, D.A.1    Glover, F.2
  • 2
    • 38149146888 scopus 로고
    • Sequential and simultaneous aggregation of diophantine equations
    • D.A. Babayev, S.S. Mardanov, Sequential and simultaneous aggregation of diophantine equations, Discrete Appl. Math. 50 (1994) 209-220.
    • (1994) Discrete Appl. Math. , vol.50 , pp. 209-220
    • Babayev, D.A.1    Mardanov, S.S.2
  • 3
    • 0042459429 scopus 로고    scopus 로고
    • Working Paper 96-131, University of Illinois Bureau of Economics and Business Research, September
    • C. Blair, Sensitivity analysis for knapsack problems: a negative result, Working Paper 96-131, University of Illinois Bureau of Economics and Business Research, September 1996.
    • (1996) Sensitivity Analysis for Knapsack Problems: A Negative Result
    • Blair, C.1
  • 4
    • 0042960517 scopus 로고
    • Transformation of integer programs to knapsack problems
    • G.H. Bradley, Transformation of integer programs to knapsack problems, Discrete Math. 1 (1971) 29-45.
    • (1971) Discrete Math. , vol.1 , pp. 29-45
    • Bradley, G.H.1
  • 5
    • 0022160742 scopus 로고
    • On the reduction method for integer programs
    • A. Elimam, S. Elmaghraby, On the reduction method for integer programs, Discrete Appl. Math. 12 (1985) 241-260.
    • (1985) Discrete Appl. Math. , vol.12 , pp. 241-260
    • Elimam, A.1    Elmaghraby, S.2
  • 7
    • 0016473040 scopus 로고
    • New results on equivalent integer programming formulations
    • F. Glover, New results on equivalent integer programming formulations, Math. Programming 8 (1975) 84-90.
    • (1975) Math. Programming , vol.8 , pp. 84-90
    • Glover, F.1
  • 8
    • 21844499023 scopus 로고
    • New results for aggregating integer-valued equations
    • F. Glover, D.A. Babayev, New results for aggregating integer-valued equations, Ann. Oper. Res. 58 (1995) 227-242.
    • (1995) Ann. Oper. Res. , vol.58 , pp. 227-242
    • Glover, F.1    Babayev, D.A.2
  • 9
    • 38249027248 scopus 로고
    • A new reduction method in integer programming
    • H. Greenberg, A new reduction method in integer programming, Discrete Appl. Math. 21 (1988) 169-172.
    • (1988) Discrete Appl. Math. , vol.21 , pp. 169-172
    • Greenberg, H.1
  • 10
    • 0041958887 scopus 로고
    • Equivalent knapsack-type formulation of bounded integer programs: An alternative approach
    • M.W. Padberg, Equivalent knapsack-type formulation of bounded integer programs: an alternative approach, Naval Res. Logist. Quart. 19 (1972) 699-708.
    • (1972) Naval Res. Logist. Quart. , vol.19 , pp. 699-708
    • Padberg, M.W.1

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