咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是21-30 订阅
排序:
ENTROPY IN linear-programS
收藏 引用
MATHEMATICAL programMING 1981年 第2期21卷 137-151页
作者: ERLANDER, S Department of Mathematics Linköping Institute of Technology S-581 83 Linköping Sweden
This paper treats entropy constrained linear programs from modelling as well as computational aspects. The optimal solutions to linear programs with one additional entropy constraint are expressed in terms of Lagrange... 详细信息
来源: 评论
POLYNOMIAL-TIME ALGORITHMS FOR linear-programMING BASED ONLY ON PRIMAL SCALING AND PROJECTED GRADIENTS OF A POTENTIAL FUNCTION
收藏 引用
MATHEMATICAL programMING 1991年 第2期51卷 203-222页
作者: FREUND, RM 1. Sloan School of Management Massachusetts Institute of Technology 02139 Cambridge MA USA
This paper presents extensions and further analytical properties of algorithms for linear programming based only on primal scaling and projected gradients of a potential function. The paper contains extensions and ana... 详细信息
来源: 评论
Combining interior-point and pivoting algorithms for linear programming
收藏 引用
MANAGEMENT SCIENCE 1996年 第12期42卷 1719-1731页
作者: Andersen, ED Ye, YY UNIV IOWA DEPT MANAGEMENT SCIIOWA CITYIA 52242
We propose a new approach to combine linear programming (LP) interior-point and simplex pivoting algorithms. In any iteration of an interior-point algorithm we construct a related LP problem, which approximates the or... 详细信息
来源: 评论
Probabilistically constrained linear programs and risk-adjusted controller design
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2005年 第3期15卷 938-951页
作者: Lagoa, CM Li, X Sznaier, M Penn State Univ Dept Elect Engn University Pk PA 16802 USA
The focal point of this paper is the probabilistically constrained linear program ( PCLP) and how it can be applied to control system design under risk constraints. The PCLP is the counterpart of the classical linear ... 详细信息
来源: 评论
An inference-proof approach to privacy-preserving horizontally partitioned linear programs
收藏 引用
OPTIMIZATION LETTERS 2014年 第1期8卷 267-277页
作者: Hong, Yuan Vaidya, Jaideep Rutgers State Univ Management Sci & Informat Syst Dept Newark NJ 07102 USA Rutgers State Univ CIMIC Newark NJ 07102 USA
Mangasarian (Optim. Lett., 6(3), 431-436, 2012) proposed a constraints transformation based approach to securely solving the horizontally partitioned linear programs among multiple entities-every entity holds its own ... 详细信息
来源: 评论
Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2006年 第1期177卷 330-345页
作者: Huang, Zheng-Hai Wang, Hui Tianjin Univ Sch Sci Dept Math Tianjin 300072 Peoples R China
We present a smoothing-type algorithm for solving the linear program (LP) by making use of an augmented system of its optimality conditions. The algorithm is shown to be globally convergent without requiring any assum... 详细信息
来源: 评论
Convergence of a class of inexact interior-point algorithms for linear programs
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 1999年 第1期24卷 50-71页
作者: Freund, RW Jarre, F Mizuno, S Lucent Technol Bell Labs Murray Hill NJ 07974 USA Univ Wurzburg Inst Angew Math & Stat D-97074 Wurzburg Germany Univ Tokyo Inst Stat Math Dept Predict & Control Minato Ku Tokyo 106 Japan
We present a convergence analysis for a class of inexact infeasible-interior-point methods for solving linear programs. The main feature of inexact methods is that the linear systems defining the search direction at e... 详细信息
来源: 评论
A parallel algorithm for linear programs with an additional reverse convex constraint
收藏 引用
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1997年 第2期45卷 91-103页
作者: Liu, SM Papavassilopoulos, GP Ind Technol Res Inst Optoelect & Syst Labs Chutung 310 Taiwan Univ So Calif Dept Elect Engn Los Angeles CA 90089 USA
A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (less than... 详细信息
来源: 评论
BELIEF PROPAGATION FOR WEIGHTED b-MATCHINGS ON ARBITRARY GRAPHS AND ITS RELATION TO linear programS WITH INTEGER SOLUTIONS
收藏 引用
SIAM JOURNAL ON DISCRETE MATHEMATICS 2011年 第2期25卷 989-1011页
作者: Bayati, Mohsen Borgs, Christian Chayes, Jennifer Zecchina, Riccardo Stanford Univ Stanford CA 94305 USA Microsoft Res Cambridge MA 02142 USA Politecn Torino I-01029 Turin Italy
We consider the general problem of finding the minimum weight b-matching on arbitrary graphs. We prove that, whenever the linear programming (LP) relaxation of the problem has no fractional solutions, then the belief ... 详细信息
来源: 评论
Solving linear programs in the Current Matrix Multiplication Time
收藏 引用
JOURNAL OF THE ACM 2021年 第1期68卷 1–39页
作者: Cohen, Michael B. Lee, Yin Tat Song, Zhao MIT 77 Massachusetts Ave Cambridge MA 02139 USA MSR Redmond Redmond WA USA Univ Washington Paul G Allen Sch Comp Sci & Engn 3800 E Stevens Way NE Seattle WA 98195 USA Univ Texas Austin 23 Pine St Princeton NJ 08542 USA
This article shows how to solve linear programs of the form min(Ax=b,x) (>= 0) c(inverted perpendicular)x with n variables in time O*((n(omega) + n(2.5-alpha/2) + n(2+1/6)) log(n/delta)), where omega is the exponen... 详细信息
来源: 评论