SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Mathematical Programming

Volumn 8, Issue 1, 1975, Pages 232-248

Vertex packings: Structural properties and algorithms

(2) Nemhauser, G L a Trotter Jr , L E b

a Department of Molecular Biology and Genetics (United States)

b YALE UNIVERSITY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34250404286 PISSN: 00255610 EISSN: 14364646 Source Type: Journal
DOI: 10.1007/BF01580444 Document Type: Article

Times cited : (545)

References (18)

1
- 84932228380
- Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, Pa.
- (1973) “Finding a minimum node cover in an arbitrary graph”, Management Sciences Research Rept. No. 325
- Balas, E.¹ Samuelsson, H.²

2
- 0242327581
- On maximum matching, minimum covering and their connections
- H.W., Kuhn, Princeton University Press, Princeton, N.J.
- (1970) Proceedings of the Princeton symposium on mathematical programming , pp. 303-312
- Balinski, M.L.¹

3
- 0003586474
- Methuen, London
- (1962) The theory of graphs and its applications
- Berge, C.¹

4
- 84932259335
- V. Chvátal, “On certain polytopes associated with graphs”, Centre de Recherches Mathématiques-238, Université de Montréal (October 1972).

5
- 0000971541
- Edmonds polytopes and a hierarchy of combinatorial problems
- (1973) Discrete Mathematics , vol.5 , pp. 305-337
- Chvátal, V.¹

6
- 34247163162
- Covers and packings in a family of sets
- (1962) Bulletin of the American Mathematical Society , vol.68 , pp. 494-499
- Edmonds, J.¹

7
- 0000927535
- Paths, trees, and flowers
- (1965) Canadian Journal of Mathematics , vol.17 , pp. 449-467
- Edmonds, J.¹

8
- 84957946170
- Princeton University Press, Princeton, N.J.
- (1962) Flows in networks
- Ford, L.R.¹ Fulkerson, D.R.²

9
- 0005388824
- Anti-blocking polyhedra
- (1972) Journal of Combinatorial Theory , vol.12 , pp. 50-71
- Fulkerson, D.R.¹

10
- 0000340664
- Algorithms for minimum coloring, maximum clique, minimum covering by cliques and maximum independent set of a chordal graph
- (1972) SIAM Journal on Computing , vol.1 , pp. 180-187
- Gavril, F.¹

11
- 0001526391
- An improved implicit enumeration approach for integer programming
- (1969) Operations Research , vol.17 , pp. 437-454
- Geoffrion, A.M.¹

12
- 0003037529
- Reducibility among combinatorial problems
- R.E., Miller, J.W., Thatcher, J.D., Bohlinger, Plenum Press, New York
- (1972) Complexity of computer computations , pp. 85-103
- Karp, R.M.¹

13
- 0015096718
- Set covering by single branch enumeration with linear programming subproblems
- (1971) Operations Research , vol.19 , pp. 998-1022
- Lemke, C.E.¹ Salkin, H.M.² Spielberg, K.³

14
- 0016028005
- Properties of vertex packing and independence system polyhedra
- (1974) Mathematical Programming , vol.6 , pp. 48-61
- Nemhauser, G.L.¹ Trotter, L.E.²

15
- 34250429350
- On the facial structure of set packing polyhedra
- (1973) Mathematical programming , vol.5 , pp. 199-216
- Padberg, M.¹

16
- 85012605191
- Dept. of Computer Science, Cornell University, Ithaca, N.Y.
- (1972) “Finding a maximum clique”, Tech. Rept. 72-123
- Tarjan, R.¹

17
- 0009056725
- Dept. of Operations Research, Cornell University, Ithaca, N.Y.
- (1973) “Solution characteristics and algorithms for the vertex packing problem”, Tech. Rept. No. 168
- Trotter, L.E.¹

18
- 84932238015
- Dept. of Administrative Sciences, Yale University, New Haven, Conn.
- (1974) “A class of facet producing graphs for vertex packing polyhedra”, Research Rept. No. 78
- Trotter, L.E.¹

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