SCOPUS 정보 검색 플랫폼

Volumn 5, Issue 1, 2008, Pages 53-65

Nonlinear bipartite matching

a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY (Israel)

Author keywords

Assignment problem; Bipartite graph; Birkhoff polytope; Combinatorial optimization; Exact matching; Integer programming; Matching; Permutation; Permutation matrix; Stochastic matrix

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; MATRIX ALGEBRA; NONLINEAR PROGRAMMING; RANDOM PROCESSES;

ASSIGNMENT PROBLEMS; BIPARTITE GRAPH; BIRKHOFF POLYTOPE; EXACT MATCHING; PERMUTATION; PERMUTATION MATRIX; STOCHASTIC MATRIX;

GRAPH THEORY;

EID: 38749083028 PISSN: 15725286 EISSN: None Source Type: Journal
DOI: 10.1016/j.disopt.2007.11.002 Document Type: Article

Times cited : (21)

References (12)

1
- 0020155051
- Some NP-complete problems in linear programming
- Chandrasekaran R., Kabadi S.N., and Murty K.G. Some NP-complete problems in linear programming. Oper. Res. Lett. 1 (1982) 101-104
- (1982) Oper. Res. Lett. , vol.1 , pp. 101-104
- Chandrasekaran, R.¹ Kabadi, S.N.² Murty, K.G.³

2
- 4544288856
- The complexity of three-way statistical tables
- De Loera J., and Onn S. The complexity of three-way statistical tables. SIAM J. Comput. 33 (2004) 819-836
- (2004) SIAM J. Comput. , vol.33 , pp. 819-836
- De Loera, J.¹ Onn, S.²

3
- 0033271978
- A polynomial time algorithm for shaped partition problems
- Hwang F.K., Onn S., and Rothblum U.G. A polynomial time algorithm for shaped partition problems. SIAM J. Optim. 10 (1999) 70-81
- (1999) SIAM J. Optim. , vol.10 , pp. 70-81
- Hwang, F.K.¹ Onn, S.² Rothblum, U.G.³

4
- 0041881259
- On the maximal matchings of a given weight in complete and complete bipartite graphs
- Karzanov A.V. On the maximal matchings of a given weight in complete and complete bipartite graphs. Kibernetika 1 (1987) 7-11
- (1987) Kibernetika , vol.1 , pp. 7-11
- Karzanov, A.V.¹

5
- 51249174825
- Matching is as easy as matrix inversion
- Mulmuley K., Vazirani U.V., and Vazirani V.V. Matching is as easy as matrix inversion. Combinatorica 7 (1987) 105-113
- (1987) Combinatorica , vol.7 , pp. 105-113
- Mulmuley, K.¹ Vazirani, U.V.² Vazirani, V.V.³

6
- 2542470893
- Convex matroid optimization
- Onn S. Convex matroid optimization. SIAM J. Discrete Math. 17 (2003) 249-253
- (2003) SIAM J. Discrete Math. , vol.17 , pp. 249-253
- Onn, S.¹

7
- 12144261959
- Convex combinatorial optimization
- Onn S., and Rothblum U.G. Convex combinatorial optimization. Discrete Comput. Geom. 32 (2004) 549-566
- (2004) Discrete Comput. Geom. , vol.32 , pp. 549-566
- Onn, S.¹ Rothblum, U.G.²

8
- 0035435181
- The vector partition problem for convex objective functions
- Onn S., and Schulman L.J. The vector partition problem for convex objective functions. Math. Oper. Res. 26 (2001) 583-590
- (2001) Math. Oper. Res. , vol.26 , pp. 583-590
- Onn, S.¹ Schulman, L.J.²

9
- 0042382420
- Polytopes and complexity
- Pulleyblank W.R. (Ed), Academic Press
- Papadimitriou C.H. Polytopes and complexity. In: Pulleyblank W.R. (Ed). Progress in Combinatorial Optimization (1984), Academic Press 295-305
- (1984) Progress in Combinatorial Optimization , pp. 295-305
- Papadimitriou, C.H.¹

10
- 84976651565
- The complexity of restricted spanning tree problems
- Papadimitriou C.H., and Yanakakis M. The complexity of restricted spanning tree problems. J. ACM 29 (1982) 285-309
- (1982) J. ACM , vol.29 , pp. 285-309
- Papadimitriou, C.H.¹ Yanakakis, M.²

11
- 84976779342
- Fast probabilistic algorithms for verification of polynomial identities
- Schwartz J.T. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27 (1980) 701-717
- (1980) J. ACM , vol.27 , pp. 701-717
- Schwartz, J.T.¹

12
- 84867952874
- Matchings in colored bipartite networks
- Yi T., Murty K.G., and Spera C. Matchings in colored bipartite networks. Discrete Appl. Math. 121 (2002) 261-277
- (2002) Discrete Appl. Math. , vol.121 , pp. 261-277
- Yi, T.¹ Murty, K.G.² Spera, C.³

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