咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是131-140 订阅
排序:
IMPLEMENTATION OF SUCCESSIVE linear-programming ALGORITHMS FOR NON-CONVEX GOAL programming
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1988年 第1期15卷 37-49页
作者: ARMSTRONG, R CHARNES, A HAKSEVER, C BOSTON COLL SCH MANAGEMENTCHESTNUT HILLMA 02167 UNIV TEXAS CTR CYBERNET STUDIESAUSTINTX 78712
Presentation is made of a computer implementation of an effective approach for the solution of nonlinear, nonconvex ratio goals problems. The approach employs Charnes and Cooper's (1977) linearization method of s... 详细信息
来源: 评论
A SOLUTION PROCEDURE FOR GENERAL KNAPSACK-PROBLEMS WITH A FEW CONSTRAINTS
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1988年 第2期15卷 145-155页
作者: OZDEN, M Department of Systems Analysis Miami University Oxford OH 45056 U.S.A.
Test computations using a proposed procedure for solving general multidimensional knapsack problems with a few contraints have positive results. The solution procedure assumes that the problem has a few resource cons... 详细信息
来源: 评论
SOLVING THE SHORTEST ROUTE PROBLEM
收藏 引用
IIE TRANSACTIONS 1988年 第2期20卷 210-212页
作者: KLEIN, M TIBREWALA, R CONTEL INFORMAT SYST GREAT NECKNY
This note presents a simple and intuitive graphical method for finding the shortest route between two specified nodes in a network. The approach is similar to the Hungarian Method for solving assignment problems.E. A.... 详细信息
来源: 评论
A linear BILEVEL programming ALGORITHM - A COMMENT
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1988年 第3期15卷 297-298页
作者: CANDLER, W World Bank Washington DC 20433 1818 H Street N.W United States
It is claimed that a theorem, due to J. F. Bard, used in G. Unlus' paper (1987), seems to be in error. A counter example is provided.
来源: 评论
A UNIFIED APPROACH FOR PRICE DIRECTIVE DECOMPOSITION PROCEDURES IN INTEGER programming
收藏 引用
DISCRETE APPLIED MATHEMATICS 1988年 第3期20卷 205-219页
作者: HOLM, S TIND, J AARHUS UNIV DEPT OPERAT RESDK-8000 AARHUS CDENMARK CARNEGIE MELLON UNIV GRAD SCH IND ADMPITTSBURGHPA 15213
This paper shows how to generalize the Dantzig-Wolfe decomposition principle to integer programming. It does this in a unified way, regardless of the choice between the two main solution methods: ‘Branch and bound’ ... 详细信息
来源: 评论
A COMPARISON OF A CONSTRAINT AGGREGATION AND PARTITIONING ZERO-ONE GOAL programming ALGORITHM WITH THE LEE AND MORRIS ALGORITHM
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 1988年 第2期15卷 97-102页
作者: LEE, SM LUEBBE, RL MIAMI UNIV DEPT MANAGEMENTOXFORDOH 45056
The computational results of a new zero-one goal programming algorithm are compared with those obtained using the algorithm developed by Lee and Morris (1977). The proposed constraint aggregation and partitioning alg... 详细信息
来源: 评论
PARAMETERIZATION OF SINGLE-STEP PROBLEMS IN linear STOCHASTIC-programming
收藏 引用
CYBERNETICS 1988年 第1期24卷 88-94页
作者: GAMZE, MS
A constructive parameterization procedure for a class of operational stochastic linear programming problems is proposed which is based on predicting the base set of LLP solutions. The problem of predicting the composi... 详细信息
来源: 评论
A TWO-DIMENSIONAL PALLETIZING PROCEDURE FOR WAREHOUSE LOADING OPERATIONS
收藏 引用
IIE TRANSACTIONS 1988年 第4期20卷 418-425页
作者: TSAI, RD MALSTROM, EM MEEKS, HD UNIV ARKANSAS DEPT IND ENGNFAYETTEVILLEAR 72701
A common warehouse/distribution problem is the unitization of pallet loads. A linear programming model has been developed to determine optimal stacking patterns on the basis of the dimensions of the boxes that constit... 详细信息
来源: 评论
A STEEPEST EDGE ACTIVE SET ALGORITHM FOR SOLVING SPARSE linear-programming PROBLEMS
收藏 引用
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING 1988年 第12期26卷 2671-2685页
作者: SLOAN, SW Department of Civil Engineering and Surveying The University of Newcastle N.S.W. 2308 Australia
A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge crit... 详细信息
来源: 评论
AN IMPROVED TRANSFORMATION OF THE SYMMETRIC MULTIPLE TRAVELING SALESMAN PROBLEM
收藏 引用
OPERATIONS RESEARCH 1988年 第1期36卷 163-167页
作者: JONKER, R VOLGENANT, T UNIV AMSTERDAM OPERAT RESAMSTERDAMNETHERLANDS
We improve the standard transformation of the symmetric, single-depot, multiple traveling salesman problem (MTSP) to one on a sparser edge configuration. The improvement tends to suppress, to a large extent, the degen... 详细信息
来源: 评论