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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,948 篇 期刊文献
1,325 篇 会议
33 篇 学位论文

馆藏范围

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

日期分布

学科分类号

2,290 篇 工学
- 736 篇 计算机科学与技术...
- 707 篇 电气工程
- 434 篇 石油与天然气工程
- 270 篇 动力工程及工程热...
- 221 篇 机械工程
- 212 篇 控制科学与工程
- 189 篇 化学工程与技术
- 178 篇 信息与通信工程
- 127 篇 交通运输工程
- 118 篇 航空宇航科学与技...
- 85 篇 土木工程
- 76 篇 环境科学与工程（可...
- 74 篇 软件工程
- 63 篇 仪器科学与技术
- 43 篇 力学（可授工学、理...
- 34 篇 电子科学与技术（可...
- 28 篇 建筑学
- 21 篇 生物工程
- 17 篇 材料科学与工程（可...
- 16 篇 水利工程
784 篇 管理学
- 767 篇 管理科学与工程(可...
- 128 篇 工商管理
470 篇 理学
- 341 篇 数学
- 36 篇 物理学
- 34 篇 系统科学
- 30 篇 生物学
- 23 篇 化学
- 13 篇 统计学（可授理学、...
183 篇 经济学
- 131 篇 应用经济学
- 50 篇 理论经济学
25 篇 农学
19 篇 医学
9 篇 法学
5 篇 教育学
4 篇 军事学
3 篇 文学
2 篇 艺术学
1 篇 哲学

主题

3,306 篇 mixed integer li...
340 篇 optimization
167 篇 costs
143 篇 linear programmi...
125 篇 scheduling
90 篇 uncertainty
87 篇 planning
87 篇 computational mo...
81 篇 routing
63 篇 genetic algorith...
62 篇 unit commitment
61 篇 renewable energy...
59 篇 integer programm...
56 篇 transportation
55 篇 resource managem...
54 篇 energy consumpti...
54 篇 production
53 篇 mathematical mod...
51 篇 demand response
50 篇 heuristic algori...

机构

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 篇 northwestern pol...
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 篇 shanghai univ sc...
5 篇 jet propulsion l...
5 篇 univ hong kong d...
5 篇 huazhong univ sc...

作者

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 篇 ahn jaemyung
8 篇 zhang chaoyong
8 篇 tuncer t. engin
8 篇 bakirtzis anasta...
8 篇 barbosa-povoa an...
7 篇 tan raymond r.
7 篇 cheng chuntian
7 篇 grossmann ignaci...

语言

3,000 篇 英文
263 篇 其他
29 篇 中文
5 篇 德文
5 篇 法文
5 篇 土耳其文
2 篇 葡萄牙文

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

共 3306 条记录，以下是3021-3030 订阅

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

详细简洁

排序：

Combined Simulated Annealing Algorithm for Logistics Network Design Problem

Combined Simulated Annealing Algorithm for Logistics Network...

引用

International Workshop on Intelligent Systems and Applications, ISA

作者： Jin Qin Li-xin Miao Res. Center for Logistics Tsinghua Univ. Shenzhen

The essence of the logistics network design problems is to determine the location of the facility and the allocation of the demands of customers, which under the condition of the minimum of the cost. Based on the standard simulated annealing algorithm, an all-purpose combined simulated annealing algorithm(CSA) is presented for the logistics network design problem. The CSA is divided into two layers as inner layer and outer layer to solve the problem. The outer algorithm is optimization for the decision of the facility location, and the inner algorithm is optimization for the allocation of customer's demand under the given decision of the outer algorithm. Applications of numerical examples with different scale denoted the algorithm is more effective than standard simulated annealing and other algorithms proposed to solve logistics network design problem.

关键词： Simulated annealing Logistics Algorithm design and analysis Costs Transportation Telecommunication traffic Traffic control Design engineering Gravity mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Routing and scheduling in wireless ad hoc networks

Routing and scheduling in wireless ad hoc networks

引用

IEEE International Workshop on Intelligent Data Acquisition and Advanced Computing Systems: Technology and Applications

作者： Antonio Capone Elisa Castorini Paolo Nobili Chefi Triki Politecnico di Milano Milan Italy ENEA C.R Rome Italy Università del Salento Lecce Italy

Computing capacity bounds of ad hoc networks, as well as optimizing radio resource allocation in order to approach those bounds is a hard task that have recently attracted the interest of the research community. In this paper we address the problem of jointly optimizing the routing of flows, the transmission scheduling over wireless links along the path, and the emitted power for bandwidth guaranteed traffic demands. We propose a mixed integer linear programming model which considers the signal to interference and noise ratio at receiver and accounts for the effect of adaptive transmission rate through a set of discrete link capacity and power values. To find the optimal solution of the proposed problem we provide an algorithm based on column generation. Reported numerical results on networks with up to 50 nodes and 170 links show the effectiveness of the proposed approach even with quite bit problem instances.

关键词： Routing Mobile ad hoc networks Processor scheduling Computer networks Ad hoc networks Resource management Bandwidth Traffic control mixed integer linear programming Interference

来源：评论

学校读者我要写书评

暂无评论

Decomposition for Low-Complexity Near-Optimal Routing in Multi-Hop Wireless Networks

Decomposition for Low-Complexity Near-Optimal Routing in Mul...

引用

IEEE International Conference on Communications (ICC)

作者： V. Kolar N. B. Abu-Ghazaleh P. Mahonen Department of Wireless Networks RWTH Aachen University Germany Department of Computer Science State University of New York Binghamton USA

Network flow models serve as a popular mathematical framework for the analysis and optimization of multi-hop wireless networks. They also serve to provide the understanding necessary to derive effective distributed protocols. However, the high computational complexity of realistic models restrict the translation of theoretical insights into distributed protocols. In this paper, we consider an NP-hard, mixed integer linear programming based routing model that computes single-path routes in a wireless network. We propose an efficient, polynomial time algorithm that applies domain specific heuristics to reduce the complexity. We employ a decomposition based approach to break the monolithic problem into several sub-problems that cooperate to find near-optimal routes. The sub-problem structure is chosen such that it captures the optimal route discovery process between a source and destination; this is a design principle that can be directly used in distributed routing protocols. We show that the resulting formulation achieves orders of magnitude improvement in the run-time. Simulation results show that the routes derived from the model are effective even in practical wireless networks with commonly used protocol stack.

关键词： Spread spectrum communication Wireless networks Mathematical model Computational complexity mixed integer linear programming Computer networks Polynomials Routing protocols Runtime Wireless application protocol

来源：评论

学校读者我要写书评

暂无评论

Assignment of Roles and Channels for a Multichannel MAC in Wireless Mesh Networks

Assignment of Roles and Channels for a Multichannel MAC in W...

引用

International Conference on Computer Communications and Networks (ICCCN)

作者： Fabrice Theoleyre Benoit Darties Andrzej Duda Grenoble Informatics Laboratory Grenoble France

A multichannel MAC improves throughput in wireless mesh networks by multiplexing transmissions over orthogonal channels. In this paper, we propose an efficient way for constructing the wireless mesh structure associated with Molecular MAC, a multichannel MAC layer designed for efficient packet forwarding. Molecular MAC outperforms other classical approaches, but requires a specific structure for efficient operation. First, we propose a centralized protocol that provides an upper bound for constructing such a molecular structure through a MILP (mixed integer linear programming) formulation that maximizes network capacity. Then, we present two distributed self-stabilizing heuristic protocols derived from the protocols for constructing respectively a Maximum Independent Set and a Spanning Tree. We compare the performance of the proposed protocols in terms of network capacity and route length.

关键词： Wireless mesh networks Mesh networks Switches mixed integer linear programming Electrons Media Access Protocol Spread spectrum communication Informatics Laboratories Throughput

来源：评论

学校读者我要写书评

暂无评论

Energy efficiency and CAPEX minimization for backbone network planning: Is there a tradeoff?

Energy efficiency and CAPEX minimization for backbone networ...

引用

International Symposium on Advanced Networks and Telecommunication Systems (ANTS)

作者： Eleni Palkopoulou Dominic A. Schupke Thomas Bauschert Chemnitz University of Technology Chemnitz Germany Nokia Siemens Networks Munich Germany

ISBN: (纸本)9781424459896

Energy efficiency and the minimization of capital expenditures (CAPEX) for network equipment are studied for two network architectures: IP over WDM and IP over OTN over WDM. Case study results from mixed integer linear programming (MILP) formulations indicate that a CAPEX optimized network yields solutions having minimum energy consumption for both architectures. However, it is shown that the most cost efficient architecture is not always the least energy consuming. We quantify the occurring tradeoff and observe that network equipment CAPEX are dominating in terms of cost. Additionally, it is observed that the relative power contribution of different network layers is independent of the average inter-node traffic demand for both studied architectures.

关键词： Energy efficiency Spine Costs Energy consumption Wavelength division multiplexing Telecommunication traffic WDM networks Chemical technology mixed integer linear programming Optical fiber networks

来源：评论

学校读者我要写书评

暂无评论

Fuzzy milp unit commitment incorporating wind generators

Fuzzy milp unit commitment incorporating wind generators

引用

IEEE General Meeting Power& Energy Society

作者： Bala Venkatesh Peng Yu Dechen Choling H. B. Gooi Ryerson University Canada Nanyang Technological University Singapore

Summary form only given. Day-ahead unit commitment (UC) solution methods seek to determine the status and output of all available generators. In a world with an increasing integration of renewable energy sources such as wind electric generators (WEG), the UC solution process must model and include WEGs too in the decision making process. Power output of WEGs in a day-ahead decision making process are usually modeled using a short term probabilistic forecast. Inclusion of WEGs introduces uncertainty in the solution that may be quantified through an imbalance risk function. Thus a UC solution method should seek a solution to minimize cost and risk in schedule. Two strategies are proposed in this paper to minimize costs and handle risks introduced due to WEGs. These formulations are posed as fuzzy optimization models and are solved using the MILP (mixed integer linear programming) technique. The proposed strategies are tested on a 26 and a 100-generator systems with associated transmission networks that have 3 and 6 wind generators each. The results with two strategies of handling WEGs are discussed.

关键词： Wind energy generation Decision making Costs Renewable energy resources Generators Predictive models Wind forecasting Uncertainty mixed integer linear programming System testing

来源：评论

学校读者我要写书评

暂无评论

A geometric approach to register transfer level satisfiability

A geometric approach to register transfer level satisfiabili...

引用

IEEE International Symposium on Quality Electronic Design

作者： Hector Navarro Saeid Nooshabadi Juan A. Montiel-Nelson V. Navarro J. Sosa Jose C. Garcia Institute of Applied Microelectronics Department of Electronic Engineering and Automation ULPGC Spain Department of Information and Communications Gwangju Institute of Science and Technology South Korea

In this paper, inequalities of integer hull polyhedrons are used in mixed integer linear programming (MILP) to model the behavior of combinational subsystems, introducing a new solution for the satisfiability (SAT) problem at register transfer level (RTL). Since in these models the vertexes are located at integer positions, they can be used with linear programming (LP) to solve SAT problems. Unfortunately, when combining together several models to make up a compound RTL description, internal vertexes may appear forcing to declare one or more variables as integer. However, the use of these models inside an RTL SAT problem reduces the number of branches needed to solve the whole integer problem. Results show a CPU solution time reduction greater than one order of magnitude, growing with the size of the problem.

关键词： Boolean functions Arithmetic linear programming Formal verification Computer aided manufacturing Computer networks Surface-mount technology mixed integer linear programming Logic programming Application software

来源：评论

学校读者我要写书评

暂无评论

ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Sensor Networks

ST-MAC: Spatial-Temporal MAC Scheduling for Underwater Senso...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： C.-C. Hsu K.-F. Lai C.-F. Chou K. C.-J. Lin Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan

ISBN: (纸本)9781424435128

Underwater sensor networks (UWSNs) have attracted a lot of attention recently. Since data in UWSNs are transmitted by acoustic signals, the characteristics of a UWSN are different from those of a terrestrial sensor network. In other words, the high propagation delay of acoustic signals in UWSNs causes spatial-temporal uncertainty, and makes transmission scheduling in UWSNs a challenging problem. Hence, in this paper, we propose a spatial-temporal MAC scheduling protocol, called ST-MAC, which is designed to overcome spatial-temporal uncertainty based on TDMA-based MAC scheduling for energy saving and throughput improvement. We construct the spatial-temporal conflict graph (ST-CG) to describe the conflict delays among transmission links explicitly, and model ST-MAC as a new vertex coloring problem of ST-CG. We then propose a novel heuristic, called the traffic-based one-step trial approach (TOTA), to solve the coloring problem. In order to obtain the optimal solution of the scheduling problem, we also derive a mixed integer linear programming (MILP) model. Finally, we present a comprehensive performance study via simulations. The results show that ST-MAC can perform better than existing MAC schemes (such as S-MAC, ECDiG, and T-Lohi) in terms of the network throughput and energy cost.

关键词： Sensor phenomena and characterization Acoustic sensors Underwater acoustics Uncertainty Media Access Protocol Throughput Propagation delay Traffic control mixed integer linear programming Costs

来源：评论

学校读者我要写书评

暂无评论

Job batching and scheduling for parallel non-identical machines via MILP and Petri nets

Job batching and scheduling for parallel non-identical machi...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Ralf Fröhlich Matthias Hüsig Institute of Automation Hamburg University of Technology Hamburg Germany

This paper presents two modeling approaches for batching and scheduling jobs on parallel non-identical machines. For scheduling of jobs the due dates as a hard restriction and machine dependent processing times are considered. Between each of the jobs a setup may be necessary or not, depending on the predecessor. The setup of the machines is done by a single worker who needs to be scheduled as well, since only he can serve one machine at a time. The objective is to maximize the overall workload of the machines meeting the constraint of the due dates. While the first approach uses mixed integer linear programming to calculate an optimal schedule, the second one uses a simulation, based on colored Petri nets. Both methods are tested and evaluated using illustrative simulation examples.

关键词： Petri nets Optimal scheduling Automation mixed integer linear programming Parallel machines Cybernetics USA Councils Testing Job production systems linear programming

来源：评论

学校读者我要写书评

暂无评论

A MILP approach to the short term hydrothermal self-scheduling problem

A MILP approach to the short term hydrothermal self-scheduli...

引用

Power Tech Conference

作者： C. K. Simoglou P. N. Biskas A. G. Bakirtzis Department of Electrical & Computer Engineering Aristotle University of Thessaloniki Thessaloniki Greece Hellenic TSO Greece

This paper addresses the hydrothermal electricity producer self-scheduling problem in day-ahead energy and reserves markets. A 0/1 mixed integer linear formulation of the producer self-scheduling problem is presented, which allows a realistic modeling of the unit's operating phases (synchronization, soak, dispatchable, desynchronization). Prohibited operating zones and daily hydro energy production constraints are also modeled. Test results address the effect of the energy and reserves market clearing prices on the producer units' day-ahead commitment status and profits.

关键词： Cost function Production planning Power generation Load forecasting Upper bound Testing mixed integer linear programming Thermal engineering Thermal loading Spinning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共331页 << < 299 300 301 302 303 304 305 306 307 308 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：