메뉴 건너뛰기




Volumn 1084, Issue , 1996, Pages 430-444

Transitive packing

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION;

EID: 84947920583     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61310-2_32     Document Type: Conference Paper
Times cited : (10)

References (39)
  • 3
    • 0024302011 scopus 로고
    • On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}
    • [BN89a]
    • [BN89a] E. Balas and S. M. Ng. On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}. Mathematical Programming, 43:57-69, 1989.
    • (1989) Mathematical Programming , vol.43 , pp. 57-69
    • Balas, E.1    Ng, S.M.2
  • 4
    • 0024718441 scopus 로고
    • On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}
    • [BN89b]
    • [BN89b] E. Balas and S. M. Ng. On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}. Mathematical Programming, 45:1-20, 1989.
    • (1989) Mathematical Programming , vol.45 , pp. 1-20
    • Balas, E.1    Ng, S.M.2
  • 5
    • 0000076482 scopus 로고
    • Set partitioning: A survey
    • [BP76]
    • [BP76] E. Balas and M. W. Padberg. Set partitioning: A survey. SIAM Review, 18:710-760, 1976.
    • (1976) SIAM Review , vol.18 , pp. 710-760
    • Balas, E.1    Padberg, M.W.2
  • 7
    • 0007679136 scopus 로고
    • On cutting-plane proofs in combinatorial optimization
    • [CCH89]
    • [CCH89] V. Chvátal, W. Cook, and M. Hartmann. On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications, 114/115:455-499, 1989.
    • (1989) Linear Algebra and its Applications , vol.114-115 , pp. 455-499
    • Chvátal, V.1    Cook, W.2    Hartmann, M.3
  • 8
    • 84947930968 scopus 로고
    • Technical Report, DEIS, University of Bologna, Bologna, Italy, 1993, revised. [CF95]
    • [CF95] A. Capraxa and M. Fischetti. Chvátal-Gomory cuts. Technical Report, DEIS, University of Bologna, Bologna, Italy, 1993, revised 1995.
    • (1995) Chvátal-Gomory cuts
    • Capraxa, A.1    Fischetti, M.2
  • 9
    • 0000971541 scopus 로고
    • Edmonds polytopes and a hierarchy of combinatorial problems
    • [Chv73]
    • [Chv73] V. Chvátal. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Mathematics, 4:305-337, 1973.
    • (1973) Discrete Mathematics , vol.4 , pp. 305-337
    • Chvátal, V.1
  • 11
    • 0024304271 scopus 로고
    • On the 0, 1 facets of the set covering polytope
    • [CS89]
    • [CS89] G. Cornuéjols and A. Sassano. On the 0, 1 facets of the set covering polytope. Mathematical Programming, 43:45-55, 1989.
    • (1989) Mathematical Programming , vol.43 , pp. 45-55
    • Cornuéjols, G.1    Sassano, A.2
  • 13
    • 0011419473 scopus 로고
    • Generalizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra
    • [EJR87]
    • [EJR87] R. Euler, M. Jünger, and G. Reinelt. Generalizations of cliques, odd cycles and anticycles and their relation to independence system polyhedra. Mathematics of Operations Research, 12:451-462, 1987.
    • (1987) Mathematics of Operations Research , vol.12 , pp. 451-462
    • Euler, R.1    Jünger, M.2    Reinelt, G.3
  • 14
    • 0038664638 scopus 로고
    • Acyclic subdigraphs and linear orderings: Polytopes, facets, and cutting plane algorithms
    • In I. Rival, editor, D. Reidel Publishing Company, Dordrecht, [GJR85a]
    • [GJR85a] M. Grötschel, M. Jünger, and G. Reinelt. Acyclic subdigraphs and linear orderings: Polytopes, facets, and cutting plane algorithms. In I. Rival, editor, Graphs and Order, pages 217-266. D. Reidel Publishing Company, Dordrecht, 1985.
    • (1985) Graphs and Order , pp. 217-266
    • Grötschel, M.1    Jünger, M.2    Reinelt, G.3
  • 16
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • (Corrigendum: 4 (1984), 291-295). [GLS81]
    • [GLS81] M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169-197, 1981. (Corrigendum: 4 (1984), 291-295).
    • (1981) Combinatorica , vol.1 , pp. 169-197
    • Grötschel, M.1    Lovász, L.2    Schrijver, A.3
  • 18
    • 0024717601 scopus 로고
    • A cutting plane algorithm for a clustering problem
    • [GW89]
    • [GW89] M. Grötschel and Y. Wakabayashi. A cutting plane algorithm for a clustering problem. Mathematical Progamming, 45:59-96, 1989.
    • (1989) Mathematical Progamming , vol.45 , pp. 59-96
    • Grötschel, M.1    Wakabayashi, Y.2
  • 19
    • 34249961456 scopus 로고
    • Facets of the clique partitioning polytope
    • [GW90]
    • [GW90] M. Grötschel and Y. Wakabayashi. Facets of the clique partitioning polytope. Mathematical Programming, 47:367-388, 1990.
    • (1990) Mathematical Programming , vol.47 , pp. 367-388
    • Grötschel, M.1    Wakabayashi, Y.2
  • 20
    • 0010651208 scopus 로고
    • Solving the maximum weight planar subgraph
    • In G. Rinaldi and L. A. Wolsey, editors, Proceedings of the 3rd International IPCO Conference. [JM93]
    • [JM93] M. Jünger and P. Mutzel. Solving the maximum weight planar subgraph. In G. Rinaldi and L. A. Wolsey, editors, Integer Programming and Combinatorial Optimization, pages 479-492, 1993. Proceedings of the 3rd International IPCO Conference.
    • (1993) Integer Programming and Combinatorial Optimization , pp. 479-492
    • Jünger, M.1    Mutzel, P.2
  • 22
    • 84989057011 scopus 로고
    • Polyhedral results for antimatroids
    • In G. S. Bloom, R. L. Graham, and J. Malkevitch, editors, Academy of Sciences, New York. Proceedings of the Third International Conference. [KL89]
    • [KL89] B. Korte and L. Lovász. Polyhedral results for antimatroids. In G. S. Bloom, R. L. Graham, and J. Malkevitch, editors, Combinatorial Mathematics, pages 283-295. Academy of Sciences, New York, 1989. Proceedings of the Third International Conference.
    • (1989) Combinatorial Mathematics , pp. 283-295
    • Korte, B.1    Lovász, L.2
  • 23
    • 0024717902 scopus 로고
    • A generalization of antiwebs to independence systems and their canonical facets
    • [Lau89]
    • [Lau89] M. Laurent. A generalization of antiwebs to independence systems and their canonical facets. Mathematical Programming, 45:97-108, 1989.
    • (1989) Mathematical Programming , vol.45 , pp. 97-108
    • Laurent, M.1
  • 24
    • 84921351801 scopus 로고
    • The interval order polytope of a digraph
    • In E. Balas and J. Clausen, editors, Springer, Berlin, Proceedings of the 4th International IPCO Conference. [MS95]
    • [MS95] R. Müller and A. S. Schulz. The interval order polytope of a digraph. In E. Balas and J. Clausen, editors, Integer Programming and Combinatorial Optimization, number 920 in Lecture Notes in Computer Science, pages 50-64. Springer, Berlin, 1995. Proceedings of the 4th International IPCO Conference.
    • (1995) Integer Programming and Combinatorial Optimization, number 920 in Lecture Notes in Computer Science , pp. 50-64
    • Müller, R.1    Schulz, A.S.2
  • 26
    • 4244147500 scopus 로고
    • On the transitive acyclic subdigraph polytope
    • In G. Rinaldi and L. A. Wolsey, editors, Proceedings of the 3rd International IPCO Conference. [MÜ193]
    • [MÜ193] R. Müller. On the transitive acyclic subdigraph polytope. In G. Rinaldi and L. A. Wolsey, editors, Integer Programming and Combinatorial Optimization, pages 463-477, 1993. Proceedings of the 3rd International IPCO Conference.
    • (1993) Integer Programming and Combinatorial Optimization , pp. 463-477
    • Müller, R.1
  • 27
    • 0024719469 scopus 로고
    • Facets and lifting procedures for the set covering polytope
    • [NS89]
    • [NS89] P. Nobili and A. Sassano. Facets and lifting procedures for the set covering polytope. Mathematical Programming, 45:111-137, 1989.
    • (1989) Mathematical Programming , vol.45 , pp. 111-137
    • Nobili, P.1    Sassano, A.2
  • 28
    • 84948983287 scopus 로고
    • (0, ±1) ideal matrices
    • In E. Balas and J. Clausen, editors, number 920 in Lecture Notes in Computer Science, Springer, Berlin. Proceedings of the 4th International IPCO Conference. [NS95]
    • [NS95] P. Nobili and A. Sassano. (0, ±1) ideal matrices. In E. Balas and J. Clausen, editors, Integer Programming and Combinatorial Optimization, number 920 in Lecture Notes in Computer Science, pages 344-359. Springer, Berlin, 1995. Proceedings of the 4th International IPCO Conference.
    • (1995) Integer Programming and Combinatorial Optimization , pp. 344-359
    • Nobili, P.1    Sassano, A.2
  • 29
    • 0016028005 scopus 로고
    • Properties of vertex packing and independence system polyhedra
    • [NT74]
    • [NT74] G. L. Nemhauser and L. E. Tvotter Jr. Properties of vertex packing and independence system polyhedra. Mathematical Programming, 6:48-61, 1974.
    • (1974) Mathematical Programming , vol.6 , pp. 48-61
    • Nemhauser, G.L.1    Tvotter, L.E.2
  • 32
    • 34250429350 scopus 로고
    • On the facial structure of set packing polyhedra
    • [Pad73]
    • [Pad73] M. W. Padberg. On the facial structure of set packing polyhedra. Mathematical Programming, 5:199-215, 1973.
    • (1973) Mathematical Programming , vol.5 , pp. 199-215
    • Padberg, M.W.1
  • 33
    • 0002696335 scopus 로고
    • Covering, packing and knapsack problems
    • [Pad79]
    • [Pad79] M. W. Padberg. Covering, packing and knapsack problems. Annals of Discrete Mathematics, 4:265-287, 1979.
    • (1979) Annals of Discrete Mathematics , vol.4 , pp. 265-287
    • Padberg, M.W.1
  • 34
    • 0024681830 scopus 로고
    • On the facial structure of the set covering polytope
    • [Sas89]
    • [Sas89] A. Sassano. On the facial structure of the set covering polytope. Mathematical Programming, 44:181-202, 1989.
    • (1989) Mathematical Programming , vol.44 , pp. 181-202
    • Sassano, A.1
  • 38
    • 0004321534 scopus 로고
    • PhD thesis, Technical University of Berlin, Berlin, Germany, [Sch95]
    • [Sch95] A. S. Schulz. Polytopes and Scheduling. PhD thesis, Technical University of Berlin, Berlin, Germany, 1995.
    • (1995) Polytopes and Scheduling
    • Schulz, A.S.1
  • 39
    • 0000662646 scopus 로고
    • A class of facet producing graphs for vertex packing polyhedra
    • [Tro75]
    • [Tro75] L. E. Trotter Jr. A class of facet producing graphs for vertex packing polyhedra. Discrete Mathematics, 12:373-388, 1975.
    • (1975) Discrete Mathematics , vol.12 , pp. 373-388
    • Trotter, L.E.1


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