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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

705 篇 会议
21 篇 期刊文献
17 册 图书

馆藏范围

741 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

539 篇 工学
- 460 篇 计算机科学与技术...
- 123 篇 软件工程
- 84 篇 电气工程
- 44 篇 信息与通信工程
- 39 篇 控制科学与工程
- 13 篇 机械工程
- 9 篇 生物工程
- 8 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 交通运输工程
- 6 篇 环境科学与工程（可...
- 5 篇 仪器科学与技术
- 5 篇 冶金工程
- 5 篇 安全科学与工程
- 4 篇 光学工程
- 4 篇 动力工程及工程热...
- 4 篇 水利工程
- 4 篇 石油与天然气工程
341 篇 理学
- 322 篇 数学
- 43 篇 系统科学
- 14 篇 生物学
- 12 篇 物理学
- 11 篇 统计学（可授理学、...
- 4 篇 化学
165 篇 管理学
- 158 篇 管理科学与工程(可...
- 44 篇 工商管理
18 篇 经济学
- 16 篇 应用经济学
6 篇 医学
- 4 篇 基础医学(可授医学...
- 4 篇 临床医学
4 篇 法学
- 4 篇 社会学
2 篇 教育学
2 篇 文学
2 篇 农学

主题

195 篇 integer programm...
88 篇 combinatorial op...
61 篇 optimization
59 篇 linear programmi...
23 篇 integer linear p...
16 篇 mixed integer pr...
14 篇 approximation al...
14 篇 dynamic programm...
13 篇 mixed-integer pr...
13 篇 combinatorial ma...
12 篇 mixed integer li...
12 篇 scheduling
11 篇 computational mo...
11 篇 constraint progr...
10 篇 mixed-integer li...
10 篇 mathematical pro...
10 篇 mathematical mod...
10 篇 algorithm analys...
9 篇 discrete mathema...
9 篇 artificial intel...

机构

8 篇 carnegie mellon ...
6 篇 georgia inst tec...
5 篇 department of co...
4 篇 univ bologna dei...
4 篇 ibm tj watson re...
4 篇 max planck inst ...
4 篇 mit cambridge ma...
4 篇 carnegie mellon ...
4 篇 department of co...
3 篇 mit alfred p slo...
3 篇 univ florida ind...
3 篇 zuse inst berlin...
3 篇 school of indust...
3 篇 univ wisconsin d...
3 篇 univ padua dipar...
3 篇 brown univ dept ...
3 篇 school of indust...
3 篇 univ pittsburgh ...
3 篇 georgia inst tec...
3 篇 mit 77 massachus...

作者

8 篇 nemhauser george...
7 篇 lodi andrea
7 篇 conforti michele
6 篇 weismantel rober...
6 篇 basu amitabh
5 篇 rousseau louis-m...
5 篇 woeginger gerhar...
5 篇 dilkina bistra
5 篇 van hoeve willem...
5 篇 linderoth jeff
5 篇 vielma juan pabl...
5 篇 balas egon
5 篇 dey santanu s.
5 篇 fischetti matteo
4 篇 munoz gonzalo
4 篇 bienstock daniel
4 篇 cornuéjols gérar...
4 篇 fukasawa ricardo
4 篇 raidl guenther r...
4 篇 dash sanjeeb

语言

734 篇 英文
5 篇 其他
4 篇 中文

检索条件"任意字段=13th International Conference on Integer Programming and Combinatorial Optimization"

共 743 条记录，以下是351-360 订阅

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

详细简洁

排序：

ReNoVatE: Recovery from node failure in virtual network embedding

ReNoVatE: Recovery from node failure in virtual network embe...

引用

international conference on Network and Service Management

作者： Nashid Shahriar Reaz Ahmed Aimal Khan Shihabur Rahman Chowdhury Raouf Boutaba Jeebak Mitra David R. Cheriton School of Computer Science University of Waterloo Huawei Technologies Canada

ISBN: (纸本)9781509032365

Network visualization (NV) has evolved as a key enabling technology for offering the next generation network services. Recently, it is being rolled out in data center networks as a means to provide bandwidth guarantees to cloud applications. With increasing deployments of virtual networks (VNs) in commercial-grade networks with commodity hardware, VNs need to tackle failures in the underlying substrate network. In this paper, we study the problem of recovering a batch of VNs affected by a substrate node failure. the combinatorial possibilities of alternate embeddings of the failed virtual nodes and links of the VNs makes the task of finding the most efficient recovery both non-trivial and intractable. Furthermore, any recovery approach ideally should not cause any service disruption for the unaffected parts of the VNs. We take into account these issues to design a recovery approach for maximizing recovery and minimizing the cost of recovery and network disruption. We provide an integer Linear programming (ILP) formulation of our recovery scheme. We also propose a fast and scalable heuristic algorithm to tackle the computational complexity of the ILP solution. Evaluation results demonstrate that our heuristic performs close to the optimal solution and outperforms the state-of-the-art algorithm.

关键词： Substrates Bandwidth Heuristic algorithms Reliability Quality of service optimization Virtualization

来源：评论

学校读者我要写书评

暂无评论

On one Problem of Financial Management optimization of Enterprise when Performing State Defense Order

On one Problem of Financial Management Optimization of Enter...

引用

international Scientific-Technical conference on Actual Problems of Electronics Instrument Engineering

作者： Yuriy A. Mezentsev Igor V. Estraykh Novosibirsk State Technical University Novosibirsk Russia

ISBN: (纸本)9781509040704

the original formal problem definition of financial management optimization of an enterprise at this conjuncture of financing the state defense order is suggested. the problem is shown to belong to the class of NP-hard problems of the mixed programming. the existing methods for solving this problem are considered and the properties of the program tools developed by the authors for searching for the best solutions are discussed.

关键词： Mixed integer programming financial management discrete profitability functions

来源：评论

学校读者我要写书评

暂无评论

Model-Based Development of Systems-of-Systems with Reliability Requirements 13

Model-Based Development of Systems-of-Systems with Reliabili...

引用

13th IEEE international conference on Industrial Informatics (INDIN)

作者： Sanduka, Imad Obermaisser, Roman Airbus Grp Innovat D-81663 Munich Germany Univ Siegen D-57068 Siegen Germany

ISBN: (纸本)9781479966493

the development of Systems-of-Systems (SoS) architectures is challenged by the inherent characteristics of SoS such as operational independence, heterogeneity of constituent systems, emergent behavior and large-scale distribution. At present, the resulting complexity restricts the design space exploration of SoS architectures to be focused on cost and functionality. In this paper we extend our previous work on timing analysis and optimization in early SoS design phases by supporting reliability requirements in the generated SoS architecture. Our approach defines a SoS architecture development methodology that applies an architecture optimization method based on concise modeling with architecture patterns, timing and reliability requirements, and extensions to the Unified Profile for DoDAF and MODAF (UPDM). optimization using Mixed integer Linear programming (MILP) is used to satisfy the real-time and reliability requirements and optimization results are back annotated to UPDM models.

关键词： architecture optimization architecture patterns system reliability reliability engineering constituent systems system of systems UPDM model

来源：评论

学校读者我要写书评

暂无评论

A Benders Approach to the Minimum Chordal Completion Problem 1

引用

12th international conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint programming (CPAIOR)

作者： Bergman, David Raghunathan, Arvind U. Univ Connecticut Stamford CT 06901 USA Mitsubishi Elect Res Labs Cambridge MA USA

ISBN: (数字)9783319180083

ISBN: (纸本)9783319180083;9783319180076

this paper introduces an integer programming approach to the minimum chordal completion problem. this combinatorial optimization problem, although simple to pose, presents considerable computational difficulties and has been tackled mostly by heuristics. In this paper, an integer programming approach based on Benders decomposition is presented. Computational results show that the improvement in solution times over a simple branch-and-bound algorithm is substantial. the results also indicate that the value of the solutions obtained by a state-of-the-art heuristic can be in some cases significantly far away from the previously unknown optimal solutions obtained via the Benders approach.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Decomposition based hybrid metaheuristics

Decomposition based hybrid metaheuristics

引用

26th EURO-INFORMS Joint international conference

作者： Raidl, Guenther R. Vienna Univ Technol Inst Comp Graph & Algorithms A-1040 Vienna Austria

Difficult combinatorial optimization problems coming from practice are nowadays often approached by hybrid metaheuristics that combine principles of classical metaheuristic techniques with advanced methods from fields like mathematical programming, dynamic programming, and constraint programming. If designed appropriately, such hybrids frequently outperform simpler "pure" approaches as they are able to exploit the underlying methods' individual advantages and benefit from synergy. this article starts with a general review of design patterns for hybrid approaches that have been successful on many occasions. More complex practical problems frequently have some special structure that might be exploited. In the field of mixed integer linear programming, three decomposition techniques are particularly well known for taking advantage of special structures: Lagrangian decomposition, Dantzig-Wolfe decomposition (column generation), and Benders' decomposition. It has been recognized that these concepts may also provide a very fruitful basis for effective hybrid metaheuristics. We review the basic principles of these decomposition techniques and discuss for each promising possibilities for combinations with metaheuristics. the approaches are illustrated with successful examples from literature. (C) 2014 Elsevier B.V. All rights reserved.

关键词： combinatorial optimization Metaheuristics Mixed integer programming Hybrid optimization approaches Decomposition techniques

来源：评论

学校读者我要写书评

暂无评论

Observing the State of a Smart Grid Using Bilevel programming 9th

Observing the State of a Smart Grid Using Bilevel Programmin...

引用

9th Annual international conference on combinatorial optimization and Applications (COCOA)

作者： Toubaline, Sonia Poirion, Pierre-Louis D'Ambrosio, Claudia Liberti, Leo Ecole Polytech CNRS LIX F-91128 Palaiseau France

ISBN: (纸本)9783319266268;9783319266251

Monitoring an electrical network is an important and challenging task. Phasor measurement units are measurement devices that can be used for a state estimation of this network. In this paper we consider a PMU placement problem without conventional measurements and with zero injection nodes for a full observability of the network. We propose two new approaches to model this problem, which take into account a propagation rule based on Ohm's and Kirchoff's law. the natural binary linear programming description models an iterative observability process. We remove the iteration by reformulating its fixed point conditions to a bilevel program, which we then further reformulate to a single-level mixed-integer linear program. We also present a bilevel algorithm to solve directly the proposed bilevel model. We implemented and tested our models and algorithm: the results show that the bilevel algorithm is better in terms of running time and size of instances which can be solved.

关键词： Bilevel program Mixed integer linear program Monitoring electrical network PMU placement problem

来源：评论

学校读者我要写书评

暂无评论

Multi-period LTE RAN and services planning for operator profit maximization 13

Multi-period LTE RAN and services planning for operator prof...

引用

13th international conference: the Experience of Designing and Application of CAD Systems in Microelectronics, CADSM 2015

作者： Dmytro, Ageyev Ali, Al-Anssari Nameer, Qasim TCS Department Kharkiv National University of Radioelectronics Lenina ave. 14 Kharkiv Ukraine TCS Department Odessa National Academy of Telecommunications Kovalska str. I Odessa Ukraine

ISBN: (纸本)9786176077169

this article proposes an optimization model for the LTE RAN network planning that aimed to accounting of services multi-period planning. the analysis of experiments results showed that formulation of the problem, which is shown in paper and presented as a problem of MILP, allows to obtain the correct solutions from the practical point of view. Comparison of the result showed that usage of multi-period network and services planning increase the profit margin to 10% more than the proposed by us previously method. © 2015 Lviv Polytechnic National University.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Advanced Energy Storage Management in Distribution Network

Advanced Energy Storage Management in Distribution Network

引用

Hawaii international conference on System Sciences

作者： Guodong Liu Oguzhan Ceylan Bailu Xiao Michael Starke Ben Ollis Daniel King Philip Irminger Kevin Tomsovic Power & Energy Syst. Group Oak Ridge Nat. Lab. Oak Ridge TN USA

ISBN: (纸本)9781509019816

With increasing penetration of distributed generation (DG) in the distribution networks (DN), the secure and optimal operation of DN has become an important concern. In this paper, an iterative mixed integer quadratic constrained quadratic programming model to optimize the operation of a three phase unbalanced distribution system with high penetration of Photovoltaic (PV) panels, DG and energy storage (ES) is developed. the proposed model minimizes not only the operating cost, including fuel cost and purchasing cost, but also voltage deviations and power loss. the optimization model is based on the linearized sensitivity coefficients between state variables (e.g., node voltages) and control variables (e.g., real and reactive power injections of DG and ES). To avoid slow convergence when close to the optimum, a golden search method is introduced to control the step size and accelerate the convergence. the proposed algorithm is demonstrated on modified IEEE 13 nodes test feeders with multiple PV panels, DG and ES. Numerical simulation results validate the proposed algorithm. Various scenarios of system configuration are studied and some critical findings are concluded.

关键词： Voltage regulation distributed generation (DG) linearization multiobjective optimization sensitivity coefficients unbalanced distribution network

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for the Approximation of Multiplierless Constant Matrix Vector Multiplication 13

A Novel Method for the Approximation of Multiplierless Const...

引用

13th international conference on Embedded and Ubiquitous Computing (EUC 2015)

作者： Aksoy, Levent Flores, Paulo Monteiro, Jose Dialog Semicond Istanbul Turkey Univ Lisbon Inst Super Tecn INESC ID Lisbon Portugal

ISBN: (纸本)9781467382991

Since human beings have limited perceptual abilities, in many digital signal processing (DSP) applications, e.g., image and video processing, the outputs do not need to be computed accurately. Instead, they can be approximated so that the area, delay, and/or power dissipation of the design can be reduced. this paper presents an approximation algorithm, called AURA, for the multiplierless design of the constant matrix vector multiplication (CMVM) which is a ubiquitous operation in DSP systems. AURA aims to tune the constants such that the resulting matrix leads to a CMVM design which requires the fewest adders/subtractors, satisfying the given error constraints. this paper also introduces its modified version, called AURA-DC, which can reduce the delay of the CMVM operation with a small increase in the number of adders/subtractors. Experimental results show that the proposed algorithms yield significant reductions in the number of adders/subtractors with respect to the original realizations without violating the error constraints, and consequently, lead to CMVM designs with less area, delay, and power dissipation. Moreover, they can generate alternative CMVM designs under different error constraints, enabling a designer to choose the one that fits best in an application.

关键词： Approximate computing constant matrix vector multiplication multiplierless design 0-1 integer linear programming area and delay optimization discrete cosine transform

来源：评论

学校读者我要写书评

暂无评论

Improved Algorithms for the Evacuation Route Planning Problem 9th

Improved Algorithms for the Evacuation Route Planning Proble...

引用

9th Annual international conference on combinatorial optimization and Applications (COCOA)

作者： Mishra, Gopinath Mazumdar, Subhra Pal, Arindam Indian Stat Inst Adv Comp & Microelect Unit Kolkata India Tata Consultancy Serv TCS Res Innovat Labs Kolkata India

ISBN: (纸本)9783319266268;9783319266251

Emergency evacuation is the process of movement of people away from the threat or actual occurrence of hazards such as natural disasters, terrorist attacks, fires and bombs. In this paper, we focus on evacuation from a building, but the ideas can be applied to city and region evacuation. We define the problem and show how it can be modeled using graphs. the resulting optimization problem can be formulated as an integer linear program. though this can be solved exactly, this approach does not scale well for graphs with thousands of nodes and several hundred thousands of edges. this is impractical for large graphs. We study a special case of this problem, where there is only a single source and a single sink. For this case, we give an improved algorithm Single Source Single Sink Evacuation Route Planner (SSEP), whose evacuation time is always at most that of a famous algorithm Capacity Constrained Route Planner (CCRP), and whose running time is strictly less than that of CCRP. We prove this mathematically and give supporting results by extensive experiments. We also study randomized behavior model of people and give some interesting results.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 32 33 34 35 36 37 38 39 40 41 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：