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

메뉴 건너뛰기

Mathematical Methods of Operations Research

Volumn 47, Issue 2, 1998, Pages 221-241

A Catalog of Minimally Nonideal Matrices

(2) Lütolf, Christine a Margot, François b

a EPFL (Switzerland)

b MICHIGAN TECHNOLOGICAL UNIVERSITY (United States)

Author keywords

Backtracking; Nonideal matrices

Indexed keywords

EID: 0001082812 PISSN: 14322994 EISSN: None Source Type: Journal
DOI: 10.1007/bf01194398 Document Type: Article

Times cited : (23)

References (19)

1
- 0001668515
- Ideal 0, 1 matrices
- Cornuéjols G, Novick B (1994) Ideal 0, 1 matrices. J. Comb. Theory Ser. B 60:145-157
- (1994) J. Comb. Theory Ser. B , vol.60 , pp. 145-157
- Cornuéjols, G.¹ Novick, B.²

2
- 38249002978
- 2 = 2 · τ
- 2 = 2 · τ. Discr. Math. 115:141-152
- (1993) Discr. Math. , vol.115 , pp. 141-152
- Ding, G.¹

3
- 1942466001
- "cdd.c": Available by anonymous ftp from ifor13.ethz.ch, directory pub/fukuda/cdd
- Fukuda K "cdd.c": C code for enumerating vertices and extreme rays. Available by anonymous ftp from ifor13.ethz.ch, directory pub/fukuda/cdd.
- C Code for Enumerating Vertices and Extreme Rays
- Fukuda, K.¹

4
- 1942498417
- Private communication
- Fukuda K (1995) Private communication.
- (1995)
- Fukuda, K.¹

5
- 38149144657
- Finding all the perfect matchings in bipartite graphs
- Fukuda K, Matsui T (1994) Finding all the perfect matchings in bipartite graphs. Appl. Math. Lett. 7:15-18
- (1994) Appl. Math. Lett. , vol.7 , pp. 15-18
- Fukuda, K.¹ Matsui, T.²

6
- 0003603813
- Freeman
- Garey MR. Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman
- (1979) Computers and Intractability, a Guide to the Theory of NP-completeness
- Garey, M.R.¹ Johnson, D.S.²

7
- 0001089678
- The NP-completness column, an ongoing guide
- Johnson DS (1982) The NP-completness column, an ongoing guide. J. Algorithms 3:288-300
- (1982) J. Algorithms , vol.3 , pp. 288-300
- Johnson, D.S.¹

8
- 0001444889
- On the width-length inequality. Mimeographic notes (1965)
- Lehman A (1979) On the width-length inequality. Mimeographic notes (1965), Math. Progr. 17:403-417
- (1979) Math. Progr. , vol.17 , pp. 403-417
- Lehman, A.¹

9
- 0000650704
- On the width-length inequality and degenerate projective planes
- Cook W, Seymour PD (eds.) Amer. Math. Soc.
- Lehman A (1990) On the width-length inequality and degenerate projective planes. In: Cook W, Seymour PD (eds.) Polyhedral Combinatorics. DIMACS series in Discrete Mathematics and Computer Science, vol. 1, Amer. Math. Soc., pp. 101-105
- (1990) Polyhedral Combinatorics. DIMACS Series in Discrete Mathematics and Computer Science , vol.1 , pp. 101-105
- Lehman, A.¹

10
- 84909462609
- Isomorphism of bounded valence can be tested in polynomial time
- Luks EM (1980) Isomorphism of bounded valence can be tested in polynomial time. Proc. FOCS 21:42-49
- (1980) Proc. FOCS , vol.21 , pp. 42-49
- Luks, E.M.¹

11
- 0042523604
- Research report, Australian National University, Canberra
- McKay BD (1996) Isomorphism-free exhaustive generation. Research report, Australian National University, Canberra
- (1996) Isomorphism-free Exhaustive Generation
- McKay, B.D.¹

12
- 85101463362
- Wiley
- Nemhauser G, Wolsey L (1988) Integer and combinatorial optimization. Wiley
- (1988) Integer and Combinatorial Optimization
- Nemhauser, G.¹ Wolsey, L.²

13
- 1942498415
- Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA
- Novick B (1990) Ideal 0,1 matrices. Ph.D. dissertation, Carnegie Mellon University, Pittsburgh, PA
- (1990) Ideal 0,1 Matrices
- Novick, B.¹

14
- 38249004269
- Lehman's forbidden minor characterization of ideal 0-1 matrices
- Padberg MW (1993) Lehman's forbidden minor characterization of ideal 0-1 matrices. Discr. Math. 111:409-420
- (1993) Discr. Math. , vol.111 , pp. 409-420
- Padberg, M.W.¹

15
- 1942466002
- School of Mathematics, University of South Wales
- Qi L (1989) On the set covering polytope and the MFMC-clutter. School of Mathematics, University of South Wales
- (1989) On the Set Covering Polytope and the MFMC-clutter
- Qi, L.¹

16
- 0009073920
- A survey of graph generation techniques
- Combinatorial Mathematics VIII, Springer
- Read RC (1981) A survey of graph generation techniques. In: Combinatorial Mathematics VIII, Lecture Notes in Mathematics 884, Springer, pp. 77-89
- (1981) Lecture Notes in Mathematics , vol.884 , pp. 77-89
- Read, R.C.¹

17
- 0000327178
- The matroids with the max-flow min-cut property
- Seymour PD (1977) The matroids with the max-flow min-cut property. J. Comb. Theory Ser. B 23:189-222
- (1977) J. Comb. Theory Ser. B , vol.23 , pp. 189-222
- Seymour, P.D.¹

18
- 0001341423
- On Lehman's width-length characterization
- Cook W, Seymour PD (eds.) Amer. Math. Soc.
- Seymour PD (1990) On Lehman's width-length characterization. In: Cook W, Seymour PD (eds.) Polyhedral Combinatorics. DIMACS series in Discrete Mathematics and Computer Science, vol. 1, Amer. Math. Soc., pp. 107-117
- (1990) Polyhedral Combinatorics. DIMACS Series in Discrete Mathematics and Computer Science , vol.1 , pp. 107-117
- Seymour, P.D.¹

19
- 0000142982
- The complexity of enumeration and reliability problems
- Valiant LG (1979) The complexity of enumeration and reliability problems. SIAM J. Comput. 8:410-421
- (1979) SIAM J. Comput. , vol.8 , pp. 410-421
- Valiant, L.G.¹

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