咨询与建议

限定检索结果

文献类型

  • 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 订阅
排序:
A SIMPLIFIED MOLP ALGORITHM - THE MOLP-S PROCEDURE
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1991年 第8期18卷 709-716页
作者: STRIJBOSCH, LWG VANDOORNE, AGM SELEN, WJ BOSTON UNIV BRUSSELS MANAGEMENT SCIB-1090 BRUSSELSBELGIUM
A number of MOLP-algorithms have been developed to establish the set of non-dominated solutions, using a number of different approaches and theorems that may be non-trivial to the non-expert user. This article present... 详细信息
来源: 评论
FINDING EQUIVALENT TRANSPORTATION FORMULATIONS FOR CONSTRAINED TRANSPORTATION PROBLEMS
收藏 引用
NAVAL RESEARCH LOGISTICS 1974年 第2期21卷 247-254页
作者: GLOVER, F KLINGMAN, D ROSS, GT UNIV COLORADO BOULDERCO UNIV TEXAS AUSTINTX
AbstractThis paper describes a procedure for determining if constrained transportation problems (i.e., transportation problems with additional linear constraints) can be transformed into equivalent pure transportation... 详细信息
来源: 评论
TAKING ACCOUNT OF HEIGHT CONSTRAINTS IN PROBLEMS OF OPTIMIZING THE SPATIAL ENERGY-DISTRIBUTION
收藏 引用
SOVIET ATOMIC ENERGY 1985年 第1期59卷 546-553页
作者: KUZNETSOV, NA POTAPENKO, PT SHELEPIN, GN BOZHENKOV, OL MALTSEV, VV
Recently, mathematical methods of the theory of linear programming have come to be widely used to solve problems of optimal control of the spatial energy distribution in nuclear reactors. In this work, as the first st... 详细信息
来源: 评论
ON THE COMPLEXITY OF A PIVOT STEP OF THE REVISED SIMPLEX ALGORITHM
收藏 引用
COMPUTERS & MATHEMATICS WITH APPLICATIONS 1985年 第11期11卷 1127-1140页
作者: PAN, V SUNY ALBANY DEPT COMP SCIALBANYNY 12222 USA
A modification of the revised simplex algorithm is considered where every step involves O ( m 2 ) arithmetical operations. The error analysis and the bit-complexity estimates presented show very strong stability of th... 详细信息
来源: 评论
RESTRICTED VERTEX GENERATION APPLIED AS A CRASHING PROCEDURE FOR linear-programming
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1984年 第4期11卷 401-407页
作者: WILLIAMS, HP Department of Business Studies University of Edinburgh William Roberston Building 50 George Square Edinburgh EH8 9JY Scotland
CRASH is the name given to procedures appearing in the majority of commercial mathematical programming packages. Their purpose is to create quickly a good starting basis for the revised simplex algorithm. The method... 详细信息
来源: 评论
EXPLICIT GENERAL SOLUTION IN linear FRACTIONAL programming
收藏 引用
NAVAL RESEARCH LOGISTICS 1973年 第3期20卷 449-467页
作者: CHARNES, A COOPER, WW UNIV TEXAS CTR CYBERNETIC STUDIESAUSTINTX CARNEGIE MELLON UNIV SCH URBAN & PUBL AFFAIRSPITTSBURGHPA
A complete analysis and explicit solution is presented for the problem of linear fractional programming with interval programming constraints whose matrix is of full row rank. The analysis proceeds by simple transform... 详细信息
来源: 评论
MONGE SEQUENCES AND A SIMPLE ASSIGNMENT ALGORITHM
收藏 引用
DISCRETE APPLIED MATHEMATICS 1986年 第2-3期15卷 241-248页
作者: DERIGS, U GOECKE, O SCHRADER, R Institut für Ökonometrie und Operations Research Abteilung Operations Research Rheinische Friedrich-Wilhelms-Universität Bonn Nassestraße 2 D-5300 Bonn 1 West Germany
In 1781 the French mathematician G. Monge gave an optimality criterion and a greedy-like procedure for solving specially structured transportation problems. Here we present a ‘new’ approach for solving assignment pr... 详细信息
来源: 评论
STOCHASTIC linear-PROGRAMS WITH SIMPLE RECOURSE - THE EQUIVALENT DETERMINISTIC CONVEX PROGRAM FOR THE NORMAL, EXPONENTIAL, AND ERLANG CASES
收藏 引用
NAVAL RESEARCH LOGISTICS 1980年 第2期27卷 257-272页
作者: HANSOTIA, BJ BRADLEY UNIV PEORIAIL 61625
We consider here stochastic linear programs with simple recourse when all the elements of the technology matrix and the resource vector have certain specific distributions. The distributions considered are the Normal,... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
A ZERO-ONE GOAL programming APPROACH FOR THE JOURNAL SELECTION AND CANCELLATION PROBLEM
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1989年 第6期16卷 557-565页
作者: SCHNIEDERJANS, MJ SANTHANAM, R Univ. of Nebraska Lincoln NE
The decision by university libraries to order new journals or cancel existing subscriptions depends on multiple conflicting factors. The faculty's need for a journal, the adjudged rating of the journal, the availa... 详细信息
来源: 评论