SCOPUS 정보 검색 플랫폼

Volumn 74, Issue 1, 1997, Pages 57-68

The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications

Author keywords

Complexity analysis; Dynamic programming; Hypergraph optimization; Polynomial algorithms

Indexed keywords

EID: 0041762627 PISSN: 0166218X EISSN: None Source Type: Journal
DOI: 10.1016/S0166-218X(96)00015-7 Document Type: Article

Times cited : (5)

References (11)

1
- 38249007372
- Polyhedral results for the precedence-constrained knapsack problem
- E.A. Boyd, Polyhedral results for the precedence-constrained knapsack problem, Discrete Appl. Math. 41 (1993) 185-201.
- (1993) Discrete Appl. Math. , vol.41 , pp. 185-201
- Boyd, E.A.¹

2
- 0041612057
- Exact algorithms for the setup knapsack problem
- E.D. Cackles and M. Guignard, Exact algorithms for the setup knapsack problem, INFOR 32 (1994) 124-142.
- (1994) INFOR , vol.32 , pp. 124-142
- Cackles, E.D.¹ Guignard, M.²

3
- 0028460941
- Computational complexity of some maximum average weight problems with precedence constraints
- U. Faigle, and W. Kern, Computational complexity of some maximum average weight problems with precedence constraints, Oper. Res. 42(4) (1994) 1268-1272.
- (1994) Oper. Res. , vol.42 , Issue.4 , pp. 1268-1272
- Faigle, U.¹ Kern, W.²

4
- 84989754354
- On the set union knapsack problem
- O. Goldschmidt, D. Nehme, and G. Yu, On the set union knapsack problem, Naval Res. Logist. 41(6) (1994) 833-842.
- (1994) Naval Res. Logist. , vol.41 , Issue.6 , pp. 833-842
- Goldschmidt, O.¹ Nehme, D.² Yu, G.³

5
- 0000879649
- Optimal tool module design problem for NC machine tools
- R. Hirabayashi, H. Suzuki and N. Tsuchiya, Optimal tool module design problem for NC machine tools, J. Oper. Res. Soc. Japan 27(3) (1984) 205-228.
- (1984) J. Oper. Res. Soc. Japan , vol.27 , Issue.3 , pp. 205-228
- Hirabayashi, R.¹ Suzuki, H.² Tsuchiya, N.³

6
- 0020706194
- On knapsacks, partitions, and a new dynamic programming technique for trees
- D.S. Johnson and K.A. Niemi, On knapsacks, partitions, and a new dynamic programming technique for trees, Math. Oper. Res. 8(1) (1983) 1-14.
- (1983) Math. Oper. Res. , vol.8 , Issue.1 , pp. 1-14
- Johnson, D.S.¹ Niemi, K.A.²

7
- 0004229857
- Wiley, New York
- S. Martello, and P. Toth, Knapsack Problems: Algorithms and Computer Implementations (Wiley, New York, 1990).
- (1990) Knapsack Problems: Algorithms and Computer Implementations
- Martello, S.¹ Toth, P.²

8
- 0021625744
- Vertical partitioning algorithms for database design
- S. Navathe, S. Ceri, G. Wiederhold and J. Dou, Vertical partitioning algorithms for database design, ACM Trans. Database Systems 9(4) (1984) 680-710.
- (1984) ACM Trans. Database Systems , vol.9 , Issue.4 , pp. 680-710
- Navathe, S.¹ Ceri, S.² Wiederhold, G.³ Dou, J.⁴

9
- 0014869124
- A selection problem of shared fixed costs and network flows
- J.M.W. Rhys, A selection problem of shared fixed costs and network flows, Management Sci. 17(3) (1970) 200-207.
- (1970) Management Sci. , vol.17 , Issue.3 , pp. 200-207
- Rhys, J.M.W.¹

10
- 0024071392
- Models arising from a flexible manufacturing machine, part II: Minimizing the number of switching instants
- C.S. Tang and E.V. Denardo, Models arising from a flexible manufacturing machine, part II: minimizing the number of switching instants, Oper. Res. 36(5) (1988) 778-784.
- (1988) Oper. Res. , vol.36 , Issue.5 , pp. 778-784
- Tang, C.S.¹ Denardo, E.V.²

11
- 51249170715
- A strongly polynomial minimum cost circulation algorithm
- E. Tardos, A strongly polynomial minimum cost circulation algorithm, Combinatorica 5 (1985) 247-256.
- (1985) Combinatorica , vol.5 , pp. 247-256
- Tardos, E.¹

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