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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是201-210 订阅

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

详细简洁

排序：

ABC optimization aided Joint User and throughput Maximization in underlay D2D communication 13

ABC optimization aided Joint User and Throughput Maximizatio...

引用

13th IEEE international conference on Advanced Networks and Telecommunication Systems (IEEE ANTS)

作者： Khanolkar, Shailesh Sharma, Nitin Birla Inst Technol & Sci Dept Elect & Elect Engn Pilani Goa India

ISBN: (纸本)9781728137155

Device to Device (D2D) communication represents a paradigm shift in the quest for realizing the twin objectives of maximization of system throughput and spectral efficiency for 5G networks. D2D communication allows devices in close proximity, to directly communicate, bypassing the base station, by reusing the licensed spectral resources of the cellular users. the resulting interference between D2D and cellular users has to be controlled by intelligent resource management strategies. In this paper, we have used Artificial Bee Colony (ABC) optimization to solve the joint user selection and throughput maximization optimization problem for D2D communication underlaying cellular network. the optimization herein, represents a mixed integer nonlinear programming problem (MINLP) nondeterministic polynomial (NP) hard problem, whose computational complexity increases exponentially with the number of users. ABC optimization, based on the foraging behavior of the bees, is used to provide a solution to the optimization problem. the ABC algorithm jointly optimizes user selection, mode selection and power allocation for D2D users, subject to interference, power and quality of service (QoS) constraints. the ABC aided solution is evaluated under multiple simulation scenarios. the results obtained prove the efficacy of the ABC aided approach as compared to results reported in literature.

关键词： D2D communication ABC optimization mode selection user selection power allocation sumrate fitness function

来源：评论

学校读者我要写书评

暂无评论

A Computational Comparison of optimization Methods for the Golomb Ruler Problem 16th

A Computational Comparison of Optimization Methods for the G...

引用

16th international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Kocuk, Burak van Hoeve, Willem-Jan Sabanci Univ TR-34956 Istanbul Turkey Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9783030192129;9783030192112

the Golomb ruler problem is defined as follows: Given a positive integer n, locate n marks on a ruler such that the distance between any two distinct pair of marks are different from each other and the total length of the ruler is minimized. the Golomb ruler problem has applications in information theory, astronomy and communications, and it can be seen as a challenge for combinatorial optimization algorithms. Although constructing high quality rulers is well-studied, proving optimality is a far more challenging task. In this paper, we provide a computational comparison of different optimization paradigms, each using a different model (linear integer, constraint programming and quadratic integer) to certify that a given Golomb ruler is optimal. We propose several enhancements to improve the computational performance of each method by exploring bound tightening, valid inequalities, cutting planes and branching strategies. We conclude that a certain quadratic integer programming model solved through a Benders decomposition and strengthened by two types of valid inequalities performs the best in terms of solution time for small-sized Golomb ruler problem instances. On the other hand, a constraint programming model improved by range reduction and a particular branching strategy could have more potential to solve larger size instances due to its promising parallelization features.

关键词： Golomb ruler integer programming Constraint programming

来源：评论

学校读者我要写书评

暂无评论

integer programming and Incidence Treedepth 1

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Eiben, Eduard Ganian, Robert Knop, Dusan Ordyniak, Sebastian Pilipczuk, Michal Wrochna, Marcin Univ Bergen Dept Informat Bergen Norway Tech Univ Wien Algorithms & Complex Grp Vienna Austria TU Berlin Fac 4 Algorithm & Computat Complex Berlin Germany Czech Tech Univ Dept Theoret Comp Sci Fac Informat Technol Prague Czech Republic Univ Sheffield Dept Comp Sci Algorithms Grp Sheffield S Yorkshire England Univ Warsaw Inst Informat Warsaw Poland Univ Oxford Oxford England

ISBN: (数字)9783030179533

ISBN: (纸本)9783030179533;9783030179526

Recently a strong connection has been shown between the tractability of integer programming (IP) with bounded coefficients on the one side and the structure of its constraint matrix on the other side. To that end, integer linear programming is fixed-parameter tractable with respect to the primal (or dual) treedepth of the Gaifman graph of its constraint matrix and the largest coefficient (in absolute value). Motivated by this, Koutecky, Levin, and Onn [ICALP 2018] asked whether it is possible to extend these result to a more broader class of integer linear programs. More formally, is integer linear programming fixed-parameter tractable with respect to the incidence treedepth of its constraint matrix and the largest coefficient (in absolute value)? We answer this question in negative. We prove that deciding the feasibility of a system in the standard form, Ax = b, l <= x <= u, is NP-hard even when the absolute value of any coefficient in A is 1 and the incidence treedepth of A is 5. Consequently, it is not possible to decide feasibility in polynomial time even if both the assumed parameters are constant, unless P = NP.

关键词： integer programming Incidence treedepth Gaifman graph Computational complexity

来源：评论

学校读者我要写书评

暂无评论

combinatorial Learning in Traffic Management 5th

Combinatorial Learning in Traffic Management

引用

5th international conference on Machine Learning, optimization, and Data Science (LOD)

作者： Sartor, Giorgio Mannino, Carlo Bach, Lukas SINTEF Digital Oslo Norway

ISBN: (纸本)9783030375997;9783030375980

We describe an exact combinatorial learning approach to solve dynamic job-shop scheduling problems arising in traffic management. When a set of vehicles has to be controlled in real-time, a new schedule must be computed whenever a deviation from the current plan is detected, or periodically after a short amount of time. this suggests that each two (or more) consecutive instances will be very similar. We exploit a recently introduced MILP formulation for job-shop scheduling (called path&cycle) to develop an effective solution algorithm based on delayed row generation. In our re-optimization framework, the algorithm maintains a pool of combinatorial cuts separated during the solution of previous instances, and adapts them to warm start each new instance. In our experiments, this adaptive approach led to a 4-time average speedup over the static approach (where each instance is solved independently) for a critical application in air traffic management.

关键词： Job-shop scheduling Re-optimization Mixed integer Linear programming

来源：评论

学校读者我要写书评

暂无评论

Computational Models for Cumulative Prospect theory: Application to the Knapsack Problem Under Risk 1

引用

13th international conference on Scalable Uncertainty Management (SUM)

作者： Martin, Hugo Perny, Patrice Sorbonne Univ CNRS LIP6 F-75005 Paris France

ISBN: (数字)9783030355142

ISBN: (纸本)9783030355142;9783030355135

Cumulative Prospect theory (CPT) is a well known model introduced by Kahneman and Tversky in the context of decision making under risk to overcome some descriptive limitations of Expected Utility. In particular CPT makes it possible to account for the framing effect (outcomes are assessed positively or negatively relatively to a reference point) and the fact that people often exhibit different risk attitudes towards gains and losses. We study here computational aspects related to the implementation of CPT for decision making in combinatorial domains. More precisely, we consider the Knapsack Problem under Risk that consists of selecting the "best" subset of alternatives (investments, projects, candidates) subject to a budget constraint. the alternatives' outcomes may be positive or negative (gains or losses) and are uncertain due to the existence of several possible scenarios of known probability. Preferences over admissible subsets are based on the CPT model and we want to determine the CPT-optimal subset for a risk-averse Decision Maker (DM). the problem requires to optimize a non-linear function over a combinatorial domain. In the paper we introduce two distinct computational models based on mixed-integer linear programming to solve the problem. these models are implemented and tested on randomly generated instances of different sizes to show the practical efficiency of the proposed approach.

关键词： Cumulative Prospect theory Knapsack Problem Risk aversion Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On Perturbation Spaces of Minimal Valid Functions: Inverse Semigroup theory and Equivariant Decomposition theorem 1

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Hildebrand, Robert Koppe, Matthias Zhou, Yuan Virginia Tech Grado Dept Ind & Syst Engn Blacksburg VA USA Univ Calif Davis Dept Math Davis CA 95616 USA Univ Kentucky Dept Math Lexington KY 40506 USA

ISBN: (数字)9783030179533

ISBN: (纸本)9783030179533;9783030179526

the non-extreme minimal valid functions for the Gomory-Johnson infinite group problem are those that admit effective perturbations. For a class of piecewise linear functions for the 1-row problem we give a precise description of the space of these perturbations as a direct sum of certain finite- and infinite-dimensional subspaces. the infinite-dimensional subspaces have partial symmetries;to describe them, we develop a theory of inverse semigroups of partial bijections, interacting with the functional equations satisfied by the perturbations. Our paper provides the foundation for grid-free algorithms for testing extremality and for computing liftings of non-extreme functions. the grid-freeness makes the algorithms suitable for piecewise linear functions whose breakpoints are rational numbers with huge denominators.

关键词： integer programs Cutting planes Group relaxations

来源：评论

学校读者我要写书评

暂无评论

A stochastic dual dynamic integer programming for the uncapacitated lot-sizing problem with uncertain demand and costs 29

A stochastic dual dynamic integer programming for the uncapa...

引用

29th international conference on Automated Planning and Scheduling, ICAPS 2019

作者： Quezada, Franco Gicquel, Céline Kedad-Sidhoum, Safia Sorbonne Université LIP6 4 Place Jussieu Paris75005 France Université Paris-Saclay LRI Rue Noetzlin Gif-sur-Yvette91190 France CNAM CEDRIC 292 Rue Saint-Martin Paris75003 France

ISBN: (纸本)9781577358077

We study the uncapacitated lot-sizing problem with uncertain demand and costs. We consider a multi-stage decision process and rely on a scenario tree to represent the uncertainty. We propose to solve this stochastic combinatorial optimization problem thanks to a new extension of the stochastic dual dynamic integer programming algorithm. Our results show that this approach can provide good quality solutions in a reasonable time for large-size instances. © 2019, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Systems Modeling and optimization of Container Ship Berthing with Various Enterprise Risks 13

Systems Modeling and Optimization of Container Ship Berthing...

引用

13th Annual IEEE international Systems conference (SysCon)

作者： thorisson, Heimir Pennetti, Cody A. Andrews, Daniel J. Hendrickson, Daniel C. Polmateer, thomas L. Lambert, James H. Univ Virginia Dept Engn Syst & Environm Charlottesville VA 22903 USA Virginia Port Author Norfolk VA USA

ISBN: (纸本)9781538683965

Scheduling for logistics systems, such as assigning of container vessels to marine port terminals, is subject to uncertainty in product arrival times, resource availability, efficiency of available resources, product volume, and others. A model-based approach is developed to create schedule options that are evaluated on multiple performance objectives. Mixed-integer linear programming minimizing the schedule cost is coupled with Monte Carlo simulation that samples inputs represented by random variables. this results in probabilistic assignments of vessels to terminals. Based on the likelihood of assignments, multiple schedule options are created and filtered. the schedule options are subsequently evaluated for the random variables and multiple performance criteria are observed. this allows stakeholders to negotiate a schedule that balances cost, delay, and other objectives. the approach is demonstrated for a marine container port in the United States. the research contributes to the methods and applications of scheduling for systems with stochastic elements. the results and methods are of interest to enterprises whose schedules face significant uncertainty, including the fields of logistics, construction, manufacturing, and others.

关键词： berth allocation generalized assignment model risk management systems engineering operations research

来源：评论

学校读者我要写书评

暂无评论

A Generic Exact Solver for Vehicle Routing and Related Problems 20th

A Generic Exact Solver for Vehicle Routing and Related Probl...

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Pessoa, Artur Sadykov, Ruslan Uchoa, Eduardo Vanderbeck, Francois Inria Bordeaux Sud Ouest Talence France Univ Bordeaux Talence France Univ Fed Fluminense Niteroi RJ Brazil

ISBN: (纸本)9783030179533;9783030179526

Major advances were recently obtained in the exact solution of Vehicle Routing Problems (VRPs). Sophisticated Branch-Cut-and-Price (BCP) algorithms for some of the most classical VRP variants now solve many instances with up to a few hundreds of customers. However, adapting and reimplementing those successful algorithms for other variants can be a very demanding task. this work proposes a BCP solver for a generic model that encompasses a wide class of VRPs. It incorporates the key elements found in the best recent VRP algorithms: ng-path relaxation, rank-1 cuts with limited memory, and route enumeration;all generalized through the new concept of "packing set". this concept is also used to derive a new branch rule based on accumulated resource consumption and to generalize the Ryan and Foster branch rule. Extensive experiments on several variants show that the generic solver has an excellent overall performance, in many problems being better than the best existing specific algorithms. Even some non-VRPs, like bin packing, vector packing and generalized assignment, can be modeled and effectively solved.

关键词： integer programming Column generation Routing

来源：评论

学校读者我要写书评

暂无评论

A Generalized and Dynamic Framework for Solar-Powered Roadside Transmitter Unit Planning 13

A Generalized and Dynamic Framework for Solar-Powered Roadsi...

引用

13th Annual IEEE international Systems conference (SysCon)

作者： Lucic, Michael C. Ghazzai, Hakim Massoud, Yehia Stevens Inst Technol Sch Syst & Enterprises Hoboken NJ 07030 USA

ISBN: (纸本)9781538683965

Roadside Unit (RSU) planning is a key step for the development of a robust Intelligent Transportation System (ITS). Many factors, including traffic flow variation, energy consumption, and budgetary constraints, all affect the daily operation and performance of the ITS. therefore, there is an urgent need to effectively incorporate all these factors in designing a planning program that addresses this complex and dynamic problem. In this paper, we propose a general RSU planning solution, where complex and dynamic parameters are investigated. the objective is to maximize the effective coverage area of the placed RSUs, given: i) a planning budget comprised of periodic operating expenses (OPEX) and capital expenditures (CAPEX), ii) the physical limitations of the transceivers, and iii) the potential use of renewable energy to offset the on-grid electricity cost. We formulate a Mixed-integer Quadratically Constrained programming (MIQCP) problem that can simultaneously determine the optimal placement and daily activation/deactivation schedules of each RSU, whether or not they have a solar panel attached, and their ranges during each period of time. We performed a sensitivity analysis over a realistic map, and results show that as the budget increases, no matter the CAPEX/OPEX, there is an increase in coverage efficiency with a diminishing-returns behavior, a positive correlation between maximum transmission power ratings on the RSUs and coverage efficiency, and a negative correlation between minimum required data transfer rale and coverage efficiency.

关键词： Infrastructure Planning Intelligent Transportation Systems optimization Roadside Unit

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：