咨询与建议

限定检索结果

文献类型

  • 233 篇 期刊文献
  • 76 篇 会议
  • 11 篇 学位论文
  • 2 册 图书

馆藏范围

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

日期分布

学科分类号

  • 208 篇 工学
    • 102 篇 计算机科学与技术...
    • 75 篇 电气工程
    • 39 篇 信息与通信工程
    • 30 篇 软件工程
    • 19 篇 控制科学与工程
    • 14 篇 石油与天然气工程
    • 10 篇 电子科学与技术(可...
    • 6 篇 材料科学与工程(可...
    • 6 篇 化学工程与技术
    • 5 篇 机械工程
    • 5 篇 动力工程及工程热...
    • 4 篇 力学(可授工学、理...
    • 4 篇 仪器科学与技术
    • 4 篇 交通运输工程
    • 3 篇 土木工程
    • 3 篇 水利工程
    • 3 篇 环境科学与工程(可...
  • 146 篇 理学
    • 129 篇 数学
    • 15 篇 统计学(可授理学、...
    • 8 篇 物理学
    • 8 篇 生物学
    • 3 篇 化学
  • 86 篇 管理学
    • 82 篇 管理科学与工程(可...
    • 6 篇 工商管理
    • 3 篇 公共管理
  • 15 篇 经济学
    • 9 篇 应用经济学
    • 6 篇 理论经济学
  • 11 篇 医学
    • 8 篇 临床医学
    • 5 篇 特种医学
  • 5 篇 农学
    • 4 篇 畜牧学
  • 2 篇 军事学
  • 1 篇 法学
  • 1 篇 教育学

主题

  • 322 篇 linear program
  • 25 篇 optimization
  • 15 篇 linear programmi...
  • 12 篇 integer program
  • 10 篇 wireless sensor ...
  • 7 篇 approximation al...
  • 6 篇 interior point m...
  • 6 篇 convex optimizat...
  • 6 篇 interior-point a...
  • 6 篇 scheduling
  • 5 篇 clustering
  • 5 篇 relaxation
  • 4 篇 polytope
  • 4 篇 interior point a...
  • 4 篇 electricity mark...
  • 4 篇 throughput
  • 4 篇 convergence
  • 4 篇 markov decision ...
  • 4 篇 duality
  • 4 篇 optimisation

机构

  • 5 篇 naval postgradua...
  • 4 篇 zhongyuan univ t...
  • 4 篇 system operation...
  • 4 篇 univ washington ...
  • 3 篇 univ illinois de...
  • 3 篇 stanford univ st...
  • 3 篇 inst stat math
  • 2 篇 as cr inst math ...
  • 2 篇 univ michigan an...
  • 2 篇 tel aviv univ sc...
  • 2 篇 univ washington ...
  • 2 篇 univ wollongong ...
  • 2 篇 charles univ pra...
  • 2 篇 univ sousse natl...
  • 2 篇 princeton univ p...
  • 2 篇 univ alberta dep...
  • 2 篇 univ s carolina ...
  • 2 篇 research reactor...
  • 2 篇 1. sloan school ...
  • 2 篇 utah state univ ...

作者

  • 9 篇 freund rm
  • 6 篇 kojima m
  • 5 篇 tseng p
  • 5 篇 guo xianping
  • 5 篇 lee yin tat
  • 4 篇 yang changlin
  • 4 篇 huang yonghui
  • 4 篇 souissi manel
  • 4 篇 chin kwan-wu
  • 4 篇 chakrabarti bhuj...
  • 4 篇 song zhao
  • 4 篇 meddeb aref
  • 4 篇 mizuno s
  • 3 篇 he xm
  • 3 篇 sidford aaron
  • 3 篇 xu dazhuan
  • 3 篇 ng p
  • 2 篇 chan tsung-han
  • 2 篇 sivarajan kn
  • 2 篇 schwender joerg

语言

  • 300 篇 英文
  • 17 篇 其他
  • 3 篇 中文
  • 2 篇 日文
检索条件"主题词=Linear Program"
322 条 记 录,以下是51-60 订阅
排序:
An infeasible-interior-point predictor corrector algorithm for linear programming
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 1996年 第1期6卷 19-32页
作者: Potra, FA UNIV KARLSRUHE W-7500 KARLSRUHEGERMANY
A predictor-corrector method is proposed for solving standard form linear programming problems starting from initial points that strictly satisfy the positivity constraints, but do not necessarily satisfy the equality... 详细信息
来源: 评论
A SIMPLE COMPLEXITY PROOF FOR A POLYNOMIAL-TIME linear-programMING ALGORITHM
收藏 引用
OPERATIONS RESEARCH LETTERS 1989年 第3期8卷 155-159页
作者: TSENG, P Center for Intelligent Control Systems Room 35-205 Massachusetts Institute of Technology Cambridge MA 02139 USA
In this article we propose a polynomial-time algorithm for linear programming. This algorithm augments the objective by a logarithmic penalty function and then solves a sequence of quadratic approximations of this pro... 详细信息
来源: 评论
MLPR: Efficient influence maximization in linear threshold propagation model using linear programming
收藏 引用
SOCIAL NETWORK ANALYSIS AND MINING 2021年 第1期11卷 3页
作者: Ghayour-Baghbani, Farzaneh Asadpour, Masoud Faili, Heshaam Univ Tehran Dept Elect & Comp Engn Tehran Iran
Influence maximization is an important research topic in social networks that has different applications such as analyzing spread of rumors, interest, adoption of innovations, and feed ranking. The goal is to select a... 详细信息
来源: 评论
A New Procedure for Solving Integer linear programming Problems
收藏 引用
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING 2014年 第6期39卷 5265-5269页
作者: Tantawy, S. F. Helwan Univ Dept Math Fac Sci Cairo 11795 Egypt
This paper presents a new procedure for solving the integer linear programming problem when the objective function is a linear function and the set of constraints is in the form of linear inequality constraints. The p... 详细信息
来源: 评论
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
收藏 引用
ANNALS OF OPERATIONS RESEARCH 1996年 第1期62卷 1-28页
作者: Kojima, M TOKYO INST TECHNOL DEPT MATH & COMP SCIMEGURO KUTOKYO 152JAPAN
The primal-dual infeasible-interior-point algorithm is known as one of the most efficient computational methods for linear programs. Recently, a polynomial-time computational complexity bound was established for speci... 详细信息
来源: 评论
A PRIMAL DUAL INFEASIBLE-INTERIOR-POINT ALGORITHM FOR linear-programMING
收藏 引用
MATHEMATICAL programMING 1993年 第3期61卷 263-280页
作者: KOJIMA, M MEGIDDO, N MIZUNO, S IBM CORP ALMADEN RES CTRSAN JOSECA 95114 TEL AVIV UNIV SCH MATH SCIIL-69978 TEL AVIVISRAEL INST STAT MATH TOKYOJAPAN
As in many primal-dual interior-point algorithms, a primal-dual infeasible-interior-point algorithm chooses a new point along the Newton direction towards a point on the central trajectory, but it does not confine the... 详细信息
来源: 评论
RELAXATION METHOD FOR LARGE-SCALE linear-programMING USING DECOMPOSITION
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 1991年 第4期16卷 859-880页
作者: TSENG, P Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge Massachusetts 02139
We propose a new decomposition method for large-scale linear programming. This method dualizes an (arbitrary) subset of the constraints and then maximizes the resulting dual functional by dual ascent. The ascent direc... 详细信息
来源: 评论
Solving Tall Dense linear programs in Nearly linear Time  2020
Solving Tall Dense Linear Programs in Nearly Linear Time
收藏 引用
52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC)
作者: van den Brand, Jan Lee, Yin Tat Sidford, Aaron Song, Zhao KTH Royal Inst Technol Stockholm Sweden Univ Washington Seattle WA 98195 USA MSR Redmond Redmond WA USA Stanford Univ Stanford CA 94305 USA Princeton Univ Princeton NJ 08544 USA Inst Adv Study Olden Lane Princeton NJ 08540 USA
In this paper we provide an (O) over tilde (nd + d(3)) time randomized algorithm for solving linear programs with d variables and n constraints with high probability. To obtain this result we provide a robust, primald... 详细信息
来源: 评论
A linear programming model for allocating HIV prevention funds with state agencies: A pilot study
收藏 引用
Health Care Management Science 2007年 第3期10卷 239-252页
作者: Earnshaw, Stephanie R. Hicks, Katherine Richter, Anke Honeycutt, Amanda RTI Health Solutions RTI International Research Triangle Park NC 27709 3040 Cornwallis Road United States Naval Post Graduate School Monterey CA United States
Given the initiatives to improve resource allocation decisions for HIV prevention activities, a linear programming model was designed specifically for use by state and local decision-makers. A pilot study using inform... 详细信息
来源: 评论
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
收藏 引用
ANNALS OF OPERATIONS RESEARCH 1996年 第1期62卷 29-57页
作者: Freund, RM MIT ALFRED P SLOAN SCH MANAGEMENTCAMBRIDGEMA 02142
This paper presents an algorithm for solving a linear program LP (to a given tolerance) from a given prespecified starting point. As such, the algorithm does not depend on any ''big M'' initialization ... 详细信息
来源: 评论