咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
Interior point potential reduction algorithm for the linear complementarity problem
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第3期54卷 267-279页
作者: Kojima, Masakazu Megiddo, Nimrod Ye, Yinyu Tokyo Inst of Technology Tokyo Japan
The linear complementarity problem (LCP) can be viewed as the problem of minimizing xTy subject to y = Mx + q and x,y ≥ 0. We are interested in finding a point with xTy 0. The algorithm proceeds by iteratively reduci... 详细信息
来源: 评论
Long steps in an O(n3L) algorithm for linear programming
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第3期54卷 251-265页
作者: Anstreicher, Kurt M. Bosch, Robert A. Yale Univ New Haven United States
We consider partial updating in Ye's affine potential reduction algorithm for linear programming. We show that using a Goldstein-Armijo rule to safeguard a linesearch of the potential function during primal steps ... 详细信息
来源: 评论
Duality in infinite dimensional linear programming
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第1-6期53卷 79-97页
作者: Romeijn, H.Edwin Smith, Robert L. Bean, James C. Erasmus Univ Rotterdam Rotterdam Netherlands
We consider the class of linear programs with infinitely many variables and constraints having the property that every constraint contains at most finitely many variables while every variable appears in at most finite... 详细信息
来源: 评论
Simplex algorithm for piecewise-linear programming III. Computational analysis and applications
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第2期53卷 213-235页
作者: Fourer, Robert Northwestern Univ Evanston United States
The first two parts of this paper have developed a simplex algorithm for minimizing convex separable piecewise-linear functions subject to linear constraints. This concluding part argues that a direct piecewise-linear... 详细信息
来源: 评论
Additive bounding procedure for the asymmetric travelling salesman problem
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第2期53卷 173-197页
作者: Fischetti, Matteo Toth, Paolo Univ of Bologna Bologna Italy
In this paper, new lower bounds for the asymmetric travelling salesman problem are presented, based on spanning arborescences. The new bounds are combined in an additive procedure whose theoretical performance is comp... 详细信息
来源: 评论
Upper bound on the expectation of simplicial functions of multivariate random variables
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第1期55卷 69-80页
作者: Dula, Jose H. Southern Methodist Univ Dallas United States
We introduce an upper bound on the expectation of a special class of sublinear functions of multivariate random variables defined over the entire Euclidean space without an independence assumption. The bound can be ev... 详细信息
来源: 评论
linear programming approach to solving bilinear programmes
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第1期56卷 45-50页
作者: White, Douglas Univ of Manchester Manchester United Kingdom
This paper discusses the maximization of a bilinear function over two independent polytopes. The maximization problem is converted into a max-min problem, using duality. This problem is then solved via a sequence of d... 详细信息
来源: 评论
On Anstreicher's combined phase I-phase II projective algorithm for linear programming
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第1期55卷 1-15页
作者: Todd, Michael J. Cornell Univ Ithaca United States
Anstreicher has proposed a variant of Karmarkar's projective algorithm that handles standard-form linear programming problems nicely. We suggest modifications to his method that we suspect will lead to better sear... 详细信息
来源: 评论
Traveling salesman problem in graphs with some excluded minors
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第2期53卷 147-172页
作者: Fonlupt, Jean Naddef, Denis Univ J. Fourier Grenoble France
Given a graph and a length function defined on its edge-set, the Traveling Salesman Problem can be described as the problem of finding a family of edges (an edge may be chosen several times) which forms a spanning Eul... 详细信息
来源: 评论
Traveling salesman games
Mathematical Programming, Series A
收藏 引用
mathematical programming, Series A 1992年 第2期53卷 199-211页
作者: Potters, Jos A.M. Curiel, Imma J. Tijs, Stef H. Univ of Nijmegen Nijmegen Netherlands
In this paper we discuss the problem of how to divide the total cost of a round trip along several institutes among the institutes visited. We introduce two types of cooperative games - fixed-route traveling salesman ... 详细信息
来源: 评论