检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

1,941 篇 期刊文献
1,314 篇 会议
33 篇 学位论文

馆藏范围

3,288 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,282 篇 工学
- 732 篇 计算机科学与技术...
- 706 篇 电气工程
- 431 篇 石油与天然气工程
- 270 篇 动力工程及工程热...
- 221 篇 机械工程
- 210 篇 控制科学与工程
- 191 篇 化学工程与技术
- 178 篇 信息与通信工程
- 126 篇 交通运输工程
- 115 篇 航空宇航科学与技...
- 85 篇 土木工程
- 76 篇 环境科学与工程（可...
- 74 篇 软件工程
- 63 篇 仪器科学与技术
- 44 篇 力学（可授工学、理...
- 33 篇 电子科学与技术（可...
- 28 篇 建筑学
- 19 篇 生物工程
- 17 篇 材料科学与工程（可...
- 16 篇 水利工程
779 篇 管理学
- 764 篇 管理科学与工程(可...
- 125 篇 工商管理
467 篇 理学
- 340 篇 数学
- 36 篇 物理学
- 34 篇 系统科学
- 28 篇 生物学
- 23 篇 化学
- 12 篇 统计学（可授理学、...
180 篇 经济学
- 128 篇 应用经济学
- 48 篇 理论经济学
24 篇 农学
19 篇 医学
9 篇 法学
5 篇 教育学
4 篇 军事学
3 篇 文学
2 篇 艺术学
1 篇 哲学

主题

3,288 篇 mixed integer li...
336 篇 optimization
162 篇 costs
142 篇 linear programmi...
125 篇 scheduling
90 篇 uncertainty
87 篇 computational mo...
84 篇 planning
81 篇 routing
62 篇 unit commitment
62 篇 genetic algorith...
61 篇 renewable energy...
59 篇 integer programm...
53 篇 resource managem...
53 篇 energy consumpti...
53 篇 production
53 篇 transportation
52 篇 mathematical mod...
52 篇 heuristic algori...
51 篇 demand response

机构

12 篇 carnegie mellon ...
10 篇 huazhong univ sc...
8 篇 dalian univ tech...
8 篇 nanyang technol ...
8 篇 beijing jiaotong...
7 篇 aristotle univ t...
7 篇 liaocheng univ s...
6 篇 univ lisbon inst...
6 篇 department of el...
6 篇 shiraz univ tech...
6 篇 georgia inst tec...
6 篇 universidade est...
5 篇 univ liege dept ...
5 篇 tongji univ sch ...
5 篇 korea adv inst s...
5 篇 northwestern pol...
5 篇 tsinghua univ de...
5 篇 shanghai univ sc...
5 篇 jet propulsion l...
5 篇 univ hong kong d...

作者

17 篇 papageorgiou laz...
11 篇 biskas pandelis ...
11 篇 montemanni rober...
11 篇 rider marcos j.
10 篇 ho koki
9 篇 d'amore federico
9 篇 bezzo fabrizio
9 篇 artigues christi...
8 篇 meng leilei
8 篇 koltsaklis nikol...
8 篇 magatao leandro
8 篇 marechal francoi...
8 篇 zhang chaoyong
8 篇 tuncer t. engin
8 篇 bakirtzis anasta...
8 篇 barbosa-povoa an...
7 篇 tan raymond r.
7 篇 cheng chuntian
7 篇 grossmann ignaci...
7 篇 choi han-lim

语言

2,984 篇 英文
268 篇 其他
29 篇 中文
6 篇 德文
6 篇 法文
5 篇 土耳其文
2 篇 葡萄牙文

检索条件"主题词=mixed integer linear programming"

共 3288 条记录，以下是3221-3230 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Tight and compact MIP formulation of configuration-based combined-cycle units

Tight and compact MIP formulation of configuration-based com...

引用

IEEE General Meeting Power& Energy Society

作者： German Morales-España Carlos M. Correa-Posada Andres Ramos Technische Universiteit Delft Delft Zuid-Holland NL Operational planning XM USA Universidad Pontificia Comillas Madrid Madrid ES

Summary form only given: Private investors, flexibility, efficiency and environmental requirements from deregulated markets have led the existence and building of a significant number of combined-cycle gas turbines (CCGTs) in many power systems. These plants represent a complex optimization problem for the short-term planning unit commitment (UC) carried out by independent system operators due to their multiple operating configurations. Accordingly, this paper proposes a mixed-integer linear programming (MIP) formulation of the configuration-based model of CCGTs, which is commonly utilized for bid/offering market processes. This formulation is simultaneously tighter and more compact than analogous MIP-based models; hence, it presents a lower computational burden. The computational efficiency of the proposed formulation is demonstrated by solving network-constrained UC case studies, of different size and complexity, using three of the leading commercial MIP solvers: CPLEX, GUROBI, and XPRESS.

关键词： Planning Computational modeling Buildings Turbines Power systems Optimization mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Guaranteed Outlier Removal with mixed integer linear Programs

Guaranteed Outlier Removal with Mixed Integer Linear Program...

引用

IEEE Conference on Computer Vision and Pattern Recognition

作者： Tat-Jun Chin Yang Heng Kee Anders Eriksson Frank Neumann School of Computer Science The University of Adelaide School of Electrical Engineering and Computer Science Queensland University of Technology

ISBN: (纸本)9781467388528

The maximum consensus problem is fundamentally important to robust geometric fitting in computer vision. Solving the problem exactly is computationally demanding, and the effort required increases rapidly with the problem size. Although randomized algorithms are much more efficient, the optimality of the solution is not guaranteed. Towards the goal of solving maximum consensus exactly, we present guaranteed outlier removal as a technique to reduce the runtime of exact algorithms. Specifically, before conducting global optimization, we attempt to remove data that are provably true outliers, i.e., those that do not exist in the maximum consensus set. We propose an algorithm based on mixed integer linear programming to perform the removal. The result of our algorithm is a smaller data instance that admits a much faster solution by subsequent exact algorithms, while yielding the same globally optimal result as the original problem. We demonstrate that overall speedups of up to 80% can be achieved on common vision problems.

关键词： mixed integer linear programming outliers linear programming randomized algorithms original problem mixed integer images computer vision algorithms Runtime Global optimization

来源：评论

学校读者我要写书评

暂无评论

Strengthening Urban Power Grids: A Resilient Planning Approach to Improve Critical Load Survival in Extreme Events

Strengthening Urban Power Grids: A Resilient Planning Approa...

引用

IEEE International Conference on Energy Internet (ICEI)

作者： Guanxun Diao Jinping Liu Jiayu Liu Ying Wang Yin Xu Shanghai Municipal Electric Power Company State Grid China School of Electrical Engineering Beijing Jiaotong University Beijing China Shanghai Electric Power Research Institute State Grid Shanghai Municipal Electric Power Company China

ISBN: (数字)9798331523558

ISBN: (纸本)9798331523565

Extreme disasters can damage power infrastructure of urban power grids and lead to significant outages. Strengthening urban power grids by updating and building new lines, stations, and sources in planning stage can enhance the power grid resilience, thus improve critical load survival in extreme events. This paper proposes a planning approach to strength the urban power grid and improve resilience. First, the planning principles on the power supply to critical loads are proposed to ensure power service based on differentiated critical degree of loads. Second, the planning problem is formulated as a mixed integer linear program (MILP), maximizing the weighted number of critical loads with guaranteed power supply considering the length of power supply paths and minimizing planning budgets. The associated constraints on planning principles and budget limit are considered. Finally, the proposed method is validated on a practical multi-voltage level grid case. Simulation results indicate that the proposed method enables each critical load to receive multiple power supplies based on its importance which can help survive in extreme events.

关键词： Power supplies Disasters Simulation Power system dynamics Voltage Power grids Planning mixed integer linear programming Resilience Meteorology

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation for Maximizing Weighted Sum Min-Rate in Downlink Cellular OFDMA Systems

Resource Allocation for Maximizing Weighted Sum Min-Rate in ...

引用

IEEE International Conference on Communications (ICC)

作者： T. Wang L. Vandendorpe Communications and Remote Sensing Laboratory Université Catholique de Louvain Louvain-la-Neuve Belgium

This paper considers the downlink of a cellular orthogonal frequency division multi-access (OFDMA) system, in which multiple base stations (BS) are coordinated by a centralized resource allocation algorithm. We address the problem of maximizing the weighted sum min-rate (WSMR) subject to a total power constraint at each BS, in terms of jointly optimizing coordinated BSs' subcarrier and power allocation. In particular, this problem leads to a resource allocation that guarantees similar rates to users in each cell. An iterative algorithm is proposed to optimize subcarrier and power allocation alternatively, so that the WSMR keeps increasing until convergence. In each iteration, the subcarrier allocation is updated by solving a mixed integer linear programming problem for each cell, while the power allocation is updated by solving a successive set of convex optimization problems with an algorithm based on Karush-KuhnTucker conditions. The effectiveness of the algorithm is illustrated by numerical experiments.

关键词： Resource management Downlink Iterative algorithms Convergence Frequency conversion Base stations Constraint optimization mixed integer linear programming Interchannel interference Radiofrequency interference

来源：评论

学校读者我要写书评

暂无评论

Automatic datapath tile placement and routing

Automatic datapath tile placement and routing

引用

Design, Automation and Test in Europe Conference and Exhibition

作者： T. Serdar C. Sechen University of Washington Seattle WA USA

ISBN: (纸本)0769509932

We report the very first fully automatic datapath tile layout flow. We subdivided the placement process into two steps: a global placement step using simulated annealing, and a new detailed placement step based on extensive modifications we made to the O-tree algorithm. The modifications have enabled the extended O-tree algorithm to handle the rectilinearly shaped transistor chains and gates common in datapath tile layout. We show that datapath tiles can be placed and routed automatically at the transistor level or at the mixed transistor/gate level, achieving results for the very first time that are competitive to those obtained manually by a skilled designer.

关键词： Tiles Routing Reflection Logic circuits Manuals Rails Geometry Fingers Libraries mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A linear reformulation of Boolean optimization problems and structure identification of gene regulation networks

A linear reformulation of Boolean optimization problems and ...

引用

IEEE Annual Conference on Decision and Control

作者： Christian Breindl Madalena Chaves Frank Allgower Institute for Systems Theory and Automatic Control University of Stuttgart Pfaffenwaldring 9 70550 Stuttgart Germany BIOCORE INRIA 2004 Route des Lucioles BP 93 06902 Sophia Antipolis France

ISBN: (纸本)9781467357159

We consider the problem of estimating Boolean models of gene regulation networks from few and noisy measurements. To this end, we use a representation of Boolean functions as multi-affine polynomials, leading to a reformulation of the estimation problem as mixed integer linear program. We then show that the integer constraints can be omitted which improves existing results and reduces the required computing time drastically. Also certain properties of Boolean functions such as unateness or the canalizing property can be included in the linear formulation. The benefits of this reformulation are demonstrated with the help of a large Boolean model of the network of the segment polarity genes in Drosophila melanogaster.

关键词： Boolean functions Gene regulation mixed integer linear programming Drosophila melanogaster Network

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Pyramidal Relaxation Method of AC OPF

A Dynamic Pyramidal Relaxation Method of AC OPF

引用

Power and Electrical Engineering (ACPEE), 5th Asia Conference on

作者： Yu-Yang Tang Liang Chen Hongbo Du Sheng-Jie Chen Caixia Kou Xiaomeng Ai Bo Zhou Academy of Mathematics and Systems Science Chinese Academy of Sciences Institute of Computational Mathematics and Scientific/Engineering Computing Beijing China College of Sciences Beijing University of Posts and Telecommunications Beijing China Academy of Mathematics and Systems Science Chinese Academy of Sciences Institute of Applied Mathematics Beijing China School of Electrical and Electronic Engineering Huazhong University of Science and Technology Wuhan China Department of Industrial and Operations Engineering University of Michigan Ann Arbor United States

ISBN: (数字)9798350309638

ISBN: (纸本)9798350309645

The Alternating Current Optimal Power Flow (AC OPF) is crucial for power system analysis, yet existing algorithms face challenges in meeting the diverse requirements of practical applications. This paper presents a Pyramidal Relaxation (PR) formulation of the Branch Flow Model (BFM) for AC OPF, where surface conical constraints are approximated through a union of tetrahedrons in a mixed integer linear programming (MILP) relaxation. To reduce problem size and to enhance computational efficiency, we proposed a Dynamic Pyramidal Relaxation (DPR) method, where the cuts (inner approximation and outer approximation) are adaptively added. In practice, the DPR method is embedded into a MILP commercial solver based on the branch-and-cut framework. Case studies in different test systems validate the effectiveness in terms of feasibility, accuracy, and efficiency of our proposed method.

关键词： Electrical engineering Computational modeling Power system dynamics Asia linear approximation Relaxation methods mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Operational Behavior of Standalone Grid-Scale Battery Energy Storage System (BESS): A Chhattisgarh State Case Study

Analyzing the Operational Behavior of Standalone Grid-Scale ...

引用

National Power Systems Conference (NPSC)

作者： Arvind Marandi Anoop Singh Sustainable Energy Engineering Department Indian Institute of Technology Kanpur India Department of Management Sciences Indian Institute of Technology Kanpur India

ISBN: (数字)9798331519568

ISBN: (纸本)9798331519575

The effective integration of renewable energy sources (RES) into the power grid is crucial for India's sustainable energy future. This paper presents a mixed-integer linear programming (MILP) model to optimize the unit commitment (UC) and economic dispatch (ED) of Chhattisgarh's power system, considering the projected demand for FY-26, upcoming generation capacity additions, and the assumed inclusion of two 200 MW/800 MWh BESS plants. The study analyzes the operational behavior of BESS under various scenarios, including high demand and high RE generation weeks. The results highlight the importance of BESS in peak shaving, load leveling, and managing the variability of RES, while also revealing limitations in addressing prolonged energy deficits. The findings contribute valuable insights for policymakers and stakeholders in the Indian power sector, emphasizing the need for strategic BESS integration to ensure grid stability and cost-effectiveness as RES penetration increases.

关键词： Analytical models Costs Power system stability Thermal force mixed integer linear programming Thermal analysis State of charge Optimization Thermal stability Load modeling

来源：评论

学校读者我要写书评

暂无评论

Minimizing total tardiness on a single machine with sequence-dependent setup times

Minimizing total tardiness on a single machine with sequence...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： A. Souissi I. Kacem C. Chu ISTIT-OSI Université de Technologie de Troyes France

In this paper, we study the single machine scheduling problem with setup times for minimizing total tardiness. Such a problem is NP-hard and presents many difficulties to be solved. To reduce these difficulties, we propose a branch and bound algorithm. Our method is based on a new lower bound and is compared with Ragatz lower bound. New dominance rule and original exploration strategy are also proposed. Preliminary numerical simulations are encouraging and promising.

关键词： Single machine scheduling Job shop scheduling Simulated annealing Equations integer linear programming Numerical simulation Genetic algorithms mixed integer linear programming Scheduling algorithm Upper bound

来源：评论

学校读者我要写书评

暂无评论

Open Pit Mine Production Scheduling using New Global Constraint

Open Pit Mine Production Scheduling using New Global Constra...

引用

IEEE Region 8 International Conference on Computational Technologies in Electrical and Electronics Engineering, SIBIRCON

作者： Yurii A. Oleynik Alexander A. Zuenko Institute for Informatics and Mathematical Modelling Kola Science Centre of the Russian Academy of Sciences Apatity Russia

ISBN: (纸本)9781665464819

The work deals with solving one of the important problems of Scheduling Theory – the Open Pit Mine Production Scheduling Problem. To solve this problem, methods of mixed integer linear programming are widely used, the fundamental disadvantage of which is that they impose increased requirements on the amount of RAM required to store the model and implement calculations. This article presents the results that develop previous studies of the authors, in which it was proposed to solve the Open Pit Mine Production Scheduling Problem as a Constraint Satisfaction Problem, and also described the main types of global constraints for modeling the conditions of the problem under consideration. Particularly, it was proposed to represent and process the conditions for the extraction sequence of blocks using a set of global constraints max for each block separately. The study presents the Global Block Sequencing Constraint developed by the authors, which propagator (handler) analyzes the conditions for the block extraction sequence, as well as some additional requirements in one launch for all blocks in the queue of propagator, which can significantly increase the efficiency of calculations. In comparison with the methods of integer linear programming, the use of the Constraint programming Paradigm allow you to significantly decrease RAM consumption due implicit representation of constraints, which leads to the ability to solve problems with the required level of discretization of pit model.

关键词： Constraint handling Sequential analysis Computational modeling Random access memory Production Search problems mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共329页 << < 319 320 321 322 323 324 325 326 327 328 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：