SCOPUS 정보 검색 플랫폼

Volumn 8, Issue 1, 1998, Pages 248-264

The sequential knapsack polytope

Author keywords

Integer programming; Knapsack polytope; Knapsack problem; Linear programming formulation; Separation

Indexed keywords

EID: 0032330926 PISSN: 10526234 EISSN: None Source Type: Journal
DOI: 10.1137/S1052623495285217 Document Type: Article

Times cited : (18)

References (12)

1
- 0039331629
- Working paper, Department of Industrial Engineering, SUNY, Buffalo, NY
- D. BOGART, M. SUDIT, AND T. OLMSTEAD, The Sequential Knapsack Problem, Working paper, Department of Industrial Engineering, SUNY, Buffalo, NY, 1991.
- (1991) The Sequential Knapsack Problem
- Bogart, D.¹ Sudit, M.² Olmstead, T.³

2
- 0014593589
- Some polyhedra related to combinatorial problems
- R. E. GOMORY, Some polyhedra related to combinatorial problems, Linear Algebra Appl., 2 (1969), pp. 551-558.
- (1969) Linear Algebra Appl. , vol.2 , pp. 551-558
- Gomory, R.E.¹

3
- 85033893726
- Technical report TR-94/10, Univ. of North Carolina, Chapel Hill, NC
- M. HARTMANN, Cutting Planes and the Sequential Knapsack Problem, Technical report TR-94/10, Univ. of North Carolina, Chapel Hill, NC, 1994.
- (1994) Cutting Planes and the Sequential Knapsack Problem
- Hartmann, M.¹

4
- 38249003185
- Solving sequential knapsack problems
- M. HARTMANN AND T. OLMSTEAD, Solving sequential knapsack problems, Oper. Res. Lett., 13 (1993), pp. 225-232.
- (1993) Oper. Res. Lett. , vol.13 , pp. 225-232
- Hartmann, M.¹ Olmstead, T.²

5
- 0001255645
- Graph theory and integer programming
- L. LOVÁSZ, Graph theory and integer programming, Ann. Discrete Math., 4 (1979), pp. 141-158.
- (1979) Ann. Discrete Math. , vol.4 , pp. 141-158
- Lovász, L.¹

6
- 0022130426
- The cutting stock problem and integer rounding
- O. MARCOTTE, The cutting stock problem and integer rounding, Math. Programming, 33 (1985), pp. 82-92.
- (1985) Math. Programming , vol.33 , pp. 82-92
- Marcotte, O.¹

7
- 0000214393
- A note on 0-1 programming
- M. W. PADBERG, A Note on 0-1 Programming, Oper. Res. 23 (1975), pp. 833-837.
- (1975) Oper. Res. , vol.23 , pp. 833-837
- Padberg, M.W.¹

8
- 0002793189
- (1, k)-configurations and facets for packing problems
- M. W. PADBERG, (1, k)-Configurations and facets for packing problems, Math. Programming, 18 (1980), pp. 94-99.
- (1980) Math. Programming , vol.18 , pp. 94-99
- Padberg, M.W.¹

9
- 0001172699
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation
- Y. POCHET AND L. WOLSEY, Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation, Discrete Appl. Math., 59 (1995), pp. 57-74.
- (1995) Discrete Appl. Math. , vol.59 , pp. 57-74
- Pochet, Y.¹ Wolsey, L.²

10
- 77951506672
- On the 0/1 knapsack polytope
- R. WEISMANTEL, On the 0/1 knapsack polytope, Math. Programming, 77 (1997), pp. 49-68.
- (1997) Math. Programming , vol.77 , pp. 49-68
- Weismantel, R.¹

11
- 0030283020
- Hilbert bases and the facets of special knapsack problems
- R. WEISMANTEL, Hilbert bases and the facets of special knapsack problems, Math. Oper. Res., 21 (1996), pp. 886-904.
- (1996) Math. Oper. Res. , vol.21 , pp. 886-904
- Weismantel, R.¹

12
- 34250395041
- Faces of linear inequalities in 0-1 variables
- L. A. WOLSEY, Faces of linear inequalities in 0-1 variables, Math. Programming, 8 (1975), pp. 165-178.
- (1975) Math. Programming , vol.8 , pp. 165-178
- Wolsey, L.A.¹

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