咨询与建议

限定检索结果

文献类型

  • 21,394 篇 会议
  • 13,555 篇 期刊文献
  • 148 册 图书
  • 138 篇 学位论文
  • 5 篇 资讯

馆藏范围

  • 35,224 篇 电子文献
  • 19 种 纸本馆藏

日期分布

学科分类号

  • 18,033 篇 工学
    • 7,902 篇 计算机科学与技术...
    • 7,296 篇 电气工程
    • 3,218 篇 控制科学与工程
    • 2,564 篇 软件工程
    • 2,416 篇 信息与通信工程
    • 1,197 篇 机械工程
    • 780 篇 电子科学与技术(可...
    • 774 篇 航空宇航科学与技...
    • 694 篇 石油与天然气工程
    • 690 篇 仪器科学与技术
    • 595 篇 动力工程及工程热...
    • 428 篇 交通运输工程
    • 425 篇 土木工程
    • 403 篇 环境科学与工程(可...
    • 273 篇 水利工程
    • 273 篇 化学工程与技术
    • 247 篇 建筑学
    • 214 篇 材料科学与工程(可...
    • 208 篇 测绘科学与技术
  • 7,992 篇 理学
    • 5,921 篇 数学
    • 990 篇 系统科学
    • 786 篇 统计学(可授理学、...
    • 660 篇 物理学
    • 402 篇 生物学
    • 266 篇 地球物理学
  • 4,838 篇 管理学
    • 4,416 篇 管理科学与工程(可...
    • 995 篇 工商管理
  • 979 篇 经济学
    • 800 篇 应用经济学
    • 253 篇 理论经济学
  • 574 篇 医学
    • 377 篇 临床医学
  • 471 篇 农学
  • 187 篇 法学
  • 117 篇 文学
  • 105 篇 教育学
  • 33 篇 艺术学
  • 30 篇 军事学
  • 7 篇 哲学
  • 2 篇 历史学

主题

  • 35,240 篇 linear programmi...
  • 6,500 篇 optimization
  • 1,744 篇 mathematical mod...
  • 1,639 篇 resource managem...
  • 1,420 篇 approximation al...
  • 1,198 篇 convergence
  • 1,172 篇 programming
  • 1,112 篇 costs
  • 1,090 篇 algorithm design...
  • 1,070 篇 computational mo...
  • 993 篇 vectors
  • 973 篇 heuristic algori...
  • 958 篇 genetic algorith...
  • 924 篇 transportation
  • 787 篇 uncertainty
  • 756 篇 training
  • 736 篇 sociology
  • 717 篇 clustering algor...
  • 655 篇 integer programm...
  • 644 篇 robustness

机构

  • 31 篇 univ wisconsin d...
  • 27 篇 univ chinese aca...
  • 25 篇 hangzhou dianzi ...
  • 23 篇 tsinghua univers...
  • 23 篇 northeastern uni...
  • 19 篇 national mobile ...
  • 19 篇 china electric p...
  • 19 篇 nanjing univ sci...
  • 19 篇 natl univ singap...
  • 18 篇 ibm thomas j. wa...
  • 18 篇 cent south univ ...
  • 18 篇 department of el...
  • 17 篇 department of el...
  • 17 篇 department of el...
  • 17 篇 johns hopkins un...
  • 17 篇 northwestern pol...
  • 16 篇 polish acad sci ...
  • 16 篇 princeton univ d...
  • 16 篇 shanghai jiao to...
  • 16 篇 purple mt labs p...

作者

  • 29 篇 nie feiping
  • 28 篇 todd mj
  • 24 篇 ye yy
  • 20 篇 cui guolong
  • 18 篇 li li
  • 17 篇 liu yang
  • 16 篇 sriparna saha
  • 16 篇 zhang lei
  • 15 篇 li yang
  • 15 篇 jun wang
  • 15 篇 mangasarian ol
  • 14 篇 jun zhang
  • 14 篇 wei li
  • 14 篇 parra j.
  • 13 篇 li qiang
  • 13 篇 pedrycz witold
  • 12 篇 monteiro rdc
  • 12 篇 fahmida umi
  • 12 篇 liu jinjin
  • 12 篇 liu jun

语言

  • 33,556 篇 英文
  • 1,382 篇 其他
  • 171 篇 中文
  • 24 篇 俄文
  • 20 篇 日文
  • 8 篇 西班牙文
  • 8 篇 朝鲜文
  • 7 篇 法文
  • 7 篇 土耳其文
  • 5 篇 德文
  • 2 篇 荷兰文
  • 2 篇 葡萄牙文
  • 1 篇 乌克兰文
检索条件"主题词=Linear Programming"
35240 条 记 录,以下是1211-1220 订阅
排序:
Distribution network restoration using mixed integer linear programming approach based on node state variable
Distribution network restoration using mixed integer linear ...
收藏 引用
IEEE Conference on Energy Internet and Energy System Integration (EI2)
作者: Jiawei Wang Jinxi Dong Xiusheng Ren Zheng Wang Jing Guo Yahui Xu Wenxia Liu State Grid Shanxi Economic Research Institute Taiyuan China North China Electric Power University Beijing China
This paper proposes a method of mixed integer linear programming (MILP) based on node state variable optimization, aiming at achieving the optimal restoration strategy for distribution system reasonably and quickly. F... 详细信息
来源: 评论
Randomized linear programming solves the discounted Markov decision problem in nearly-linear (sometimes sublinear) run time
arXiv
收藏 引用
arXiv 2017年
作者: Wang, Mengdi Department of Operations Research and Financial Engineering Princeton University PrincetonNJ United States
We propose a novel randomized linear programming algorithm for approximating the optimal policy of the discounted Markov decision problem. By leveraging the value-policy duality and binary-tree data structures, the al... 详细信息
来源: 评论
Ellipsoid Method for linear programming made simple
arXiv
收藏 引用
arXiv 2017年
作者: Saxena, Sanjeev Dept. of Computer Science and Engineering Indian Institute of Technology Kanpur208 016 India
In this paper, ellipsoid method for linear programming is derived using only minimal knowledge of algebra and matrices. Unfortunately, most authors first describe the algorithm, then later prove its correctness, which... 详细信息
来源: 评论
Load Disaggregation Based on Aided linear Integer programming
收藏 引用
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2017年 第7期64卷 792-796页
作者: Bhotto, Md. Zulfiquar Ali Makonin, Stephen Bajic, Ivan V. Simon Fraser Univ Sch Engn Sci Burnaby BC V5A 1S6 Canada
Load disaggregation based on aided linear integer programming (ALIP) is proposed. We start with a conventional linear integer programming (IP)-based disaggregation and enhance it in several ways. The enhancements incl... 详细信息
来源: 评论
On infinite linear programming and the moment approach to deterministic infinite horizon discounted optimal control problems
arXiv
收藏 引用
arXiv 2017年
作者: Kamoutsi, Angeliki Sutter, Tobias Esfahani, Peyman Mohajerin Lygeros, John Automatic Control Laboratory ETH Zurich Switzerland Delft Center for Systems and Control TU Delft Netherlands
We revisit the linear programming approach to deterministic, continuous time, infinite horizon discounted optimal control problems. In the first part, we relax the original problem to an infinite-dimensional linear pr... 详细信息
来源: 评论
Random projections for linear programming
arXiv
收藏 引用
arXiv 2017年
作者: Ky, Vu Khac Poirion, Pierre-Louis Liberti, Leo LIX École Polytechnique PalaiseauF-91128 France
Random projections are random linear maps, sampled from appropriate distributions, that approximately preserve certain geometrical invariants so that the approximation improves as the dimension of the space grows. The... 详细信息
来源: 评论
Using incomplete indefinite LDLT preconditioning for inexact interior point methods for linear programming
arXiv
收藏 引用
arXiv 2017年
作者: Luce, Robert Technische Universität Berlin Institut für Mathematik MA3-3 Straße des 17. Juni 136 Germany Berlin 10623 Germany
Most linear algebra kernels in interior point methods for linear programming require the solution of linear systems of equation with the matrix N = AT D−1A (or AD−1AT ), where A denotes the constraint matrix of the li... 详细信息
来源: 评论
The Beurling-Selberg Box Minorant Problem via linear programming Bounds
arXiv
收藏 引用
arXiv 2017年
作者: Carruth, Jacob Elkies, Noam Gonçalves, Felipe Kelly, Michael Univ. of Texas 1 University Sta. AustinTX78712 United States Harvard University CambridgeMA02138 United States Hausdorff Center for Mathematics Universität Bonn Endenicher Allee 60 Bonn53115 Germany Center for Communications Research 805 Bunn Dr. PrincetonNJ08540 United States
In this paper we investigate a high dimensional version of Selberg’s minorant problem for the indicator function of an interval. In particular, we study the corresponding problem of minorizing the indicator function ... 详细信息
来源: 评论
Submodular maximization through the lens of linear programming
arXiv
收藏 引用
arXiv 2017年
作者: Bruggmann, Simon Zenklusen, Rico Department of Mathematics ETH Zurich Switzerland
The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a similar result carries over to submodular m... 详细信息
来源: 评论
A simple introduction to Karmarkar’s Algorithm for linear programming
arXiv
收藏 引用
arXiv 2017年
作者: Saxena, Sanjeev Dept. of Computer Science and Engineering Indian Institute of Technology Kanpur208 016 India
An extremely simple, description of Karmarkar’s algorithm with very few technical terms is given. Copyright © 2017, The Authors. All rights reserved.
来源: 评论