咨询与建议

限定检索结果

文献类型

  • 449 篇 期刊文献
  • 100 篇 会议

馆藏范围

  • 549 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 374 篇 理学
    • 373 篇 数学
    • 69 篇 统计学(可授理学、...
    • 6 篇 物理学
    • 4 篇 生物学
    • 2 篇 地球物理学
  • 328 篇 工学
    • 277 篇 计算机科学与技术...
    • 165 篇 软件工程
    • 35 篇 控制科学与工程
    • 14 篇 电气工程
    • 12 篇 机械工程
    • 11 篇 材料科学与工程(可...
    • 11 篇 信息与通信工程
    • 7 篇 电子科学与技术(可...
    • 7 篇 化学工程与技术
    • 6 篇 农业工程
    • 5 篇 土木工程
    • 5 篇 交通运输工程
    • 4 篇 石油与天然气工程
    • 4 篇 生物医学工程(可授...
    • 4 篇 生物工程
    • 3 篇 动力工程及工程热...
    • 3 篇 建筑学
    • 2 篇 仪器科学与技术
    • 2 篇 核科学与技术
    • 2 篇 环境科学与工程(可...
  • 181 篇 管理学
    • 181 篇 管理科学与工程(可...
    • 52 篇 工商管理
  • 29 篇 经济学
    • 27 篇 应用经济学
  • 20 篇 军事学
  • 6 篇 农学
    • 6 篇 作物学

主题

  • 549 篇 mathematical pro...
  • 1 篇 computer simulat...
  • 1 篇 electric network...
  • 1 篇 optimization
  • 1 篇 electric power s...
  • 1 篇 management scien...

机构

  • 3 篇 univ wisconsin d...
  • 3 篇 at&t bell lab ho...
  • 3 篇 st. mary's univ ...
  • 3 篇 glushkov inst of...
  • 2 篇 univ of californ...
  • 2 篇 graduate school ...
  • 2 篇 rutgers univ uni...
  • 2 篇 yale sch of orga...
  • 2 篇 southern methodi...
  • 2 篇 chr. michelsen i...
  • 2 篇 purdue univ west...
  • 2 篇 univ british col...
  • 2 篇 at&t bell lab mu...
  • 2 篇 at&t bell lab un...
  • 2 篇 univ texas dept ...
  • 2 篇 univ of florida ...
  • 2 篇 college of busin...
  • 2 篇 tokyo inst of te...
  • 2 篇 univ texas austi...
  • 2 篇 univ of texas at...

作者

  • 5 篇 charnes a
  • 5 篇 sherali hd
  • 5 篇 anstreicher kurt...
  • 4 篇 sowell r.s.
  • 4 篇 kabe d.g.
  • 4 篇 chen l.h.
  • 4 篇 vaidya pravin m.
  • 4 篇 ward robert c.
  • 3 篇 kudin v.i.
  • 3 篇 koehler gary j.
  • 3 篇 gass si
  • 3 篇 mangasarian ol
  • 3 篇 sannomiya nobuo
  • 3 篇 volkovich v.l.
  • 3 篇 austin lm
  • 3 篇 pilkey w.d.
  • 3 篇 todd michael j.
  • 3 篇 sen rabindranath
  • 3 篇 chatterjee shyam...
  • 3 篇 shao sp

语言

  • 361 篇 英文
  • 170 篇 其他
  • 6 篇 德文
  • 3 篇 波兰文
  • 2 篇 西班牙文
  • 2 篇 俄文
  • 2 篇 中文
  • 1 篇 法文
  • 1 篇 意大利文
  • 1 篇 日文
检索条件"主题词=Mathematical Programming, Linear"
549 条 记 录,以下是91-100 订阅
排序:
'Build-down' scheme for linear programming
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1990年 第1期46卷 61-72页
作者: Ye, Yinyu Univ of Iowa United States
We propose a 'build-down' scheme for Karmarkar's algorithm and the simplex method for linear programming. The scheme starts with an optimal basis 'candidate' set E including all columns of the cons... 详细信息
来源: 评论
Efficient algorithm for the linear assignment problem
收藏 引用
Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi) 1990年 第12期73卷 28-36页
作者: Yamada, Shoichiro Kasai, Tamotsu Univ of Osaka Prefecture Sakai Japan
Although numerous exact algorithms have been proposed so far for the linear assignment problem, they are not necessarily satisfactory from the viewpoint of computation time when considered for application to practical... 详细信息
来源: 评论
Short proof of finiteness of Murty's principal pivoting algorithm
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1990年 第2期46卷 255-256页
作者: Rohn, Jiri Charles Univ Czech Republic
We give a short proof of the finiteness of Murty's principal pivoting algorithm for solving the linear complementarity problem y = Mz + q, yT z = 0, y ≥ 0, z ≥ 0 with P-matrix M.
来源: 评论
ON THE CONVERGENCE OF ONE-DIMENSIONAL SIMPLEX SEARCH
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1989年 第2期16卷 113-116页
作者: XUE, GL QUFU NORMAL UNIV INST OPERAT RESQUFUPEOPLES R CHINA
In this paper, we first give a counterexample showing the falsehood of the convergence theorem of Choo and Kim. We then prove a convergence theorem for their algorithm.
来源: 评论
A PRIMAL DUAL CONJUGATE SUBGRADIENT ALGORITHM FOR SPECIALLY STRUCTURED linear AND CONVEX-programming PROBLEMS
收藏 引用
APPLIED MATHEMATICS AND OPTIMIZATION 1989年 第2期20卷 193-221页
作者: SHERALI, HD ULULAR, O AT&T BELL LABS WHIPPANYNJ 07981
This paper presents a primal-dual conjugate subgradient algorithm for solving convex programming problems. The motivation, however, is to employ it for solving specially structured or decomposable linear programming p... 详细信息
来源: 评论
AN ANALYSIS OF AN AVAILABLE SET OF linear-programming TEST PROBLEMS
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1989年 第2期16卷 173-184页
作者: LUSTIG, IJ Program in Statistics and Operations Research Department of Civil Engineering and Operations Research School of Engineering and Applied Science Princeton University Princeton NJ 08544 U.S.A.
Version 5.1 of MINOS was used to analyze a set of linear programming test problems, which were run with different sets of options for scaling and partial pricing to illustrate the effects of these options on the perfo... 详细信息
来源: 评论
A TABULAR SIMPLEX-TYPE ALGORITHM AS A TEACHING AID FOR GENERAL LP MODELS
收藏 引用
mathematical AND COMPUTER MODELLING 1989年 第8期12卷 1051-1056页
作者: ARSHAM, H Department of Information and Quantitative Sciences University of Baltimore Baltimore MD 21201 U.S.A.
A new algorithm is presented which efficiently incorporates the regular and dual simplex algorithms. The strategy adapted for the new algorithm is summarized by the following two phases: Phase I. Push toward a neighbo... 详细信息
来源: 评论
EFFICIENT SOLUTIONS TO A linear-programming MODEL FOR PRODUCTION SCHEDULING WITH CAPACITY CONSTRAINTS AND NO INITIAL STOCK
收藏 引用
IIE TRANSACTIONS 1989年 第2期21卷 144-152页
作者: MCCLAIN, JO THOMAS, LJ WEISS, EN UNIV VIRGINIA DARDEN SCHCHARLOTTESVILLEVA 22903
In this paper we present a decomposition approach to solve large scale linear programming models for production scheduling when there are multiple capacity-constrained facilities. The formulation assumes that there ar... 详细信息
来源: 评论
A PRIMARY SECONDARY MEMORY IMPLEMENTATION OF A FORWARD NETWORK SIMPLEX ALGORITHM FOR MULTIPERIOD NETWORK FLOW PROBLEMS
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1989年 第4期16卷 379-391页
作者: ARONSON, JE CHEN, BD PARTNERS NATL HLTH PLANS IRVINGTX 75016
The minimum cost, multiperiod network flow problem is an optimization model that often is used to help decision makers in resource planning, scheduling, and distribution. The forward network simplex algorithm, which ... 详细信息
来源: 评论
AN IMPROVED DIRECT DESCENT ALGORITHM FOR BINARY KNAPSACK-PROBLEMS
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1989年 第4期16卷 305-313页
作者: MURPHY, RA Schneider National Inc. P.O. Box 2545 Green Bay WI 54306 U.S.A.
Integer programming is widely applicable to problems in industry and business. A special type of integer program, the binary knapsack problem, is examined. The binary knapsack problem is of major importance because ... 详细信息
来源: 评论