öλÔÓéÀֵǼÈë¿ÚÏÂÔØ

µ¼Ê¦ÐÕÃû£ºÍõÇÚ
ÐÔ±ð£ºÅ®
ÈËÆøÖ¸Êý£º68

ËùÊôԺУ£ºÖйú¼ÆÁ¿´óѧ
ËùÊôԺϵ£º¾­¼ÃÓë¹ÜÀíѧԺ
Ö°³Æ£º½ÌÊÚ
µ¼Ê¦ÀàÐÍ£ºË¶µ¼
ÕÐÉúöλÔÓéÀֵǼÈë¿ÚÏÂÔØ£º¹ÜÀí¿ÆѧÓ빤³Ì
Ñо¿ÁìÓò£º ×éºÏ×îÓÅ»¯£»¼ÆË㸴ÔÓÐÔ£»Í¼ÂÛ
Ñо¿ÁìÓò£º ×éºÏ×îÓÅ»¯£»¼ÆË㸴ÔÓÐÔ£»Í¼ÂÛ [ÊÕÆð]




ͨѶ·½Ê½ :
°ì¹«µç»°£º**
µç×ÓÓʼþ£ºwq@cjlu.edu.cn


¸öÈ˼òÊö :
2000Äê±ÏÒµÓÚÖ£ÖÝ´óѧÊýѧϵ£¬»ñµÃͼÂÛÓë×éºÏ×îÓÅ»¯öλÔÓéÀֵǼÈë¿ÚÏÂÔØ˶ʿѧλ¡£2004Äê±ÏÒµÓÚÏã¸Û³ÇÊдóѧ¿ÆѧÓ빤³ÌѧԺ£¬»ñµÃ×îÓÅ»¯ÀíÂÛöλÔÓéÀֵǼÈë¿ÚÏÂÔز©Ê¿Ñ§Î»¡£2004Äêµ½Öйú¼ÆÁ¿´óѧ¹¤×÷¡£Ö÷³Ö¹ú¼Ò×ÔÈ»¿Æѧ»ù½ðÏîÄ¿2ÏÕã½­Ê¡×ÔÈ»¿Æѧ»ù½ðÏîÄ¿1Ïî¡£ÔÚ¹úÄÚÍâѧÊõÆÚ¿¯ÉÏ·¢±íÂÛÎÄÈýÊ®Óàƪ¡£

¿ÆÑй¤×÷ :
[1]Q.WangL.WuNetwork¡¡design¡¡for¡¡minimum¡¡spanning¡¡trees¡¡under¡¡Hamming¡¡distanceAus.New¡¡Zeal.Ind.Appl.Math.20161-8.(SCI)[2]Q.WangJ.YuanThe¡¡minimum¡¡spanning¡¡subgraph¡¡problem¡¡with¡¡given¡¡cyclomatic¡¡numberPac.J.Optim.**-592.(SCI)[3]J.LuoW.LiQ.WangChecking¡¡strong¡¡optimality¡¡of¡¡interval¡¡linear¡¡programming¡¡with¡¡inequality¡¡constraints¡¡and¡¡nonnegative¡¡constraintsJ.Comput.Appl.Math.**-190.(SCI)[4]Q.WangPartial¡¡inverse¡¡most¡¡unbalanced¡¡spanning¡¡tree¡¡problemPrze.Elektro.**-114.(SCI)[5]L.LiuQ.WangConstrained¡¡inverse¡¡min-max¡¡spanning¡¡tree¡¡problems¡¡under¡¡the¡¡weighted¡¡Hamming¡¡distanceJ.Global¡¡Optim.**-95.(SCI)[6]Q.WangJ.YuanJ.ZhangAn¡¡inverse¡¡model¡¡for¡¡the¡¡most¡¡uniform¡¡problemOper.Res.Lett.**-30.(SCI)[7]Q.WangX.YangJ.ZhangA¡¡class¡¡of¡¡inverse¡¡dominate¡¡problems¡¡under¡¡weighted¡¡l_infinity¡¡norm¡¡and¡¡an¡¡improved¡¡complexity¡¡bound¡¡for¡¡Radzik¡¯s¡¡algorithmJ.Global¡¡Optim.**-567.(SCI)[8]Q.WangJ.Yuan4-regular¡¡claw-free¡¡IM-extendable¡¡graphsDiscrete¡¡Math.**-309.(SCI)¹ú¼Ò×ÔÈ»¿Æѧ»ù½ðÏîÄ¿£ºÍøÂçÓÅ»¯ÄæÎÊÌâ¼°ÍøÂç¸Ä½øÎÊÌâµÄËã·¨Ñо¿£¬18Íò.Õã½­Ê¡×ÔÈ»¿Æѧ»ù½ðÏîÄ¿£ºÍøÂçÓÅ»¯µÄÄæÎÊÌâºÍÓ¦ÓÃÑо¿£¬8Íò.