维普中文期刊产品整合服务
19篇 您的检索式:作者名="MONMA C"
    题名 作者 年代 出处 被引量
1On the complexity of scheduling with batch setup times显示文摘Monma C L Potts C N 1989Operations Research1989,37,5:1
2Convex resource allocation problems on directed acyclic graphs显示文摘Monma C L Schrijver A Todd M J 1990Duali- ty Complexity Special Cases and Extensions Mathemat- ics of Operations Research1990,15,4:1
3An implementation of a primal-dual interior point method for linear programming显示文摘McSHANE K A MONMA C L SHANNO D F 1989ORSA Journal on Computing1989,,1:1
4Transitions in geometric minimum spanning tree 显示文摘Monma C Suri S 1992Discrete and Computational Geometry1992,8,1:1
5Rapid growth of an ovarian clear cell carcinoma expressing LH/HCG receptor arising from endometriosis during early oregnancy 显示文摘Kobayashi F Monma C Nanbu K 1996Gynecol Oncol1996,62,4:1
6Methods for designing communication networks with certintwo-connected survivabilityconstraints显示文摘 Shallcross D F 1989Operations Research1989,37,:1
7Rapid Growth of an Ovarian Clear Cell Carcinoma Expressing LH/HCG Receptor Arising from En-dometriosis During Early Pregnancy显示文摘KOBAYASHI F MONMA C NANBU K 1996Gynecol Oncol1996,62,:1
8Minimumweight two-connected spanning networks显示文摘 Munson B S Pulleyblank W R 1990Mathematical Programming1990,46,:1
9Rapid growth of an ovarian clear cell carcinoma expressing LH/HCG receptor arising from endometriosis during early oregnancy显示文摘Kobayashi F Monma C Nanbu K 1996Gynecol Oncol1996,62,:1
10Convex resource allocation problems on directed acyclic graphs Duality, complexity, special cases, and extensions显示文摘Monma C L Schrijver A Todd M J 1990Mathematics of Operations Research1990,15,4:1
11On the complexity of scheduling with batch setup times显示文摘Monma C L Pottd C N 1989Opns Res1989,37,5:1
12On the Complexity of Scheduling with Batch Setup Times显示文摘C L Monma C N Potts 198937(5):798-8041989,37,5:1
13Computing euclidean maximum spanning trees 显示文摘MONMA C L PATERSON M SURI S 1990Algorilhmica1990,5,3:1
14Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times显示文摘C L Monma C N Potts 1993Oper Res1993,41,5:1
15Methods for designing communication networks connected survivability constraints显示文摘Monma C L Shallcorss D 1989Operations Research1989,37,:1
16On the complexity of schoduling with batch setup times 显示文摘C L Monma and C N Potts 1989Operations Research1989,37,5:1
17On the complexity of scheduling with batch setup times 显示文摘Monma C L Potts C N 1989Opns Res1989,37,:1
18Methods of designing communication networks with certain two-connected survivability constraints显示文摘Monma C L Shallcross D F 1989Oper Res1989,37,:1
19Minimum-weight two-connected spanning networks显示文摘Monma C L Munson B S Pulleyblank W R 1990Math Prog1990,46,:1
返回顶部 每页显示:
共1页 首页 上一页 第1页 下一页 末页 /1 跳转

网站首页 | 关于我们 | 联系我们 | 产品服务 | 客服中心 | 广告服务 | 版权声明 | 网站联盟 | 友情链接 | 售卡网点

版权所有© 渝B2-20050021-1 渝公网安备 50019002500403号 违法和不良信息举报中心

互联网出版许可证 新出网证(渝)字10号 全国400电话 - 免长途话费