Search Results - person:"Mao-Cheng, Cai"

Cai, Mao-cheng; Fang, Qizhi - In: Internet and network economics : 4th international …, (pp. 454-464). 2008

Persistent link: https://www.econbiz.de/10003792823

The partial inverse minimum spanning tree problem when weight increase is forbidden

Cai, Mao-Cheng; Duin, C.W.; Yang, Xiaoguang; Zhang, … - In: European Journal of Operational Research 188 (2008) 2, pp. 348-353

Persistent link: https://www.econbiz.de/10005277359

The partial inverse minimum spanning tree problem when weight increase is forbidden

Cai, Mao-Cheng; Duin, C.W.; Yang, Xiaoguang; Zhang, … - In: European journal of operational research : EJOR 188 (2008) 2, pp. 348-353

Persistent link: https://www.econbiz.de/10007900007

A Min-Max Theorem on Feedback Vertex Sets

Cai, Mao-Cheng; Deng, Xiaotie; Zang, Wenan - In: Mathematics of operations research 27 (2002) 2, pp. 361-371

Persistent link: https://www.econbiz.de/10006418497

Inverse Matroid Intersection Problem

Mao-Cheng, Cai; Li, Yanjun - In: Mathematical Methods of Operations Research 45 (1997) 2, pp. 235-243

LetM <Subscript>1</Subscript> andM <Subscript>2</Subscript> be matroids onS,B be theirk-element common independent set, andw a weight function onS. Given two functionsb ≥ 0 andc ≥ 0 onS, the Inverse Matroid Intersection Problem (IMIP) is to determine a modified weight functionw′ such that (a)B becomes a maximum weight common...</subscript></subscript>

Persistent link: https://www.econbiz.de/10010999857

Inverse Matroid Intersection Problem

Mao-Cheng, Cai; Li, Yanjun - In: Computational Statistics 45 (1997) 2, pp. 235-243

LetM 1 andM 2 be matroids onS,B be theirk-element common independent set, andw a weight function onS. Given two functionsb ≥ 0 andc ≥ 0 onS, the Inverse Matroid Intersection Problem (IMIP) is to determine a modified weight functionw′ such that (a)B becomes a maximum weight common...

Persistent link: https://www.econbiz.de/10010759448