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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

195 篇 integer programm...
87 篇 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

语言

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

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

共 741 条记录，以下是671-680 订阅

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

详细简洁

排序：

Attentive, Permutation Invariant, One-Shot Node-Conditioned Graph Generation for Wireless Networks Topology optimization 1

引用

6th international conference on Machine Learning for Networking (MLN)

作者： Marcoccia, Felix Adjih, Cedric Muhlethaler, Paul INRIA Paris Paris France Thales SIX Gennevilliers France INRIA Saclay Palaiseau France Sorbonne Univ Paris France

ISBN: (数字)9783031599330

ISBN: (纸本)9783031599323;9783031599330

It is common knowledge that using directional antennas is often mandatory for Multi-hop ad-hoc wireless networks to provide satisfying quality of service, especially when dealing with an important number of communication nodes [1]. As opposed to their omnidirectional counterpart, directional antennas allow for much more manageable interference patterns: a receiving antenna is not necessarily interfered by nearby emitting antennas as long as this receiving antenna is not directed towards these undesired emission beams. Two nodes then need to steer one of their antennas in the direction of the other node in order to create a network communication link. these two users will then be able to, in turn, emit and receive to and from each other. the scope of this work resides in finding a centralized algorithm to governate these antenna steering decisions for all users to instantaneously provide a valid set of communication links at any time given the positions of each user. the problem that raises is then a geometrical one that implies finding topologies of network links that present satisfying throughput and overall QoS and guarantee instantaneous connectedness i.e. the computed set of links allows any user to reach any other user in a certain number of hops. Building such optimized link topologies makes further tasks, such as routing and scheduling of the network, much simpler and faster. this problem is highly combinatorial and, while it is solvable with traditional Mixed integer programming (MIP), it is quite challenging to carry it out in real time. For this purpose, we propose a Deep Neural Network that is trained to imitate valid, solved instances of the problem. We use the Attention mechanism [2,3] to let nodes exchange information in order to capture interesting patterns and properties that then enable the neural network to generate valid network link topologies, even dealing with unseen sets of users positions.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Off-line algorithms for Routing, Modulation Level, and Spectrum Assignment in elastic optical networks

Off-line algorithms for Routing, Modulation Level, and Spect...

引用

international conference on Transparent Optical Networks

作者： Miroslaw Klinkowski Krzysztof Walkowiak Marek Jaworski Department of Transmission and Optical Technologies National Institute of Telecommunications Warszawa Poland Department of System and Computer Networks Wroclaw University of Technology Wroclaw Poland

ISBN: (纸本)9781457708817

Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical networks. Such elastic optical networks will enable efficient resource utilization and flexible sub-wavelength and super-channel connection provisioning to support heterogeneous and immense bandwidth demands. In this paper, we focus on the problem of Routing, Modulation Level, and Spectrum Allocation/Assignment (RMLSA) which emerges in such networks. We both formulate RMLSA as an integer Linear programming (ILP) problem and propose an effective heuristic method called Adaptive Frequency Assignment - Division and Collision Avoidance (AFA-DCA) to be used if the solution of ILP is not attainable.

关键词： Elastic Optical Networks Network optimization RMLSA Fiber optic networks Resource utilization inductive logic programming frequency assignment Network routing OFF LINE Spectra NETWORK STRUCTURE Bandwidth

来源：评论

学校读者我要写书评

暂无评论

New Valid Inequalities and combinatorial Benders' Cuts Algorithm for the Quayside Operation optimization Problem Without Big-M Coefficient

New Valid Inequalities and Combinatorial Benders' Cuts Algor...

引用

international conference on Services Systems and Services Management, ICSSSM

作者： Ming Liu Bian Liang Chengbin Chu Feng Chu School of Economics & Management Tongji University Shanghai China Laboratoire Génie Industriel Centrale Supélec Université Paris-Saclay Châtenay-Malabry France Laboratory IBISC University of Evry-Val d'Essonne Evry France

this paper studies the quayside operation problem, in which three seaside planning decisions are integrated, with the objective of minimizing the maximum relative tardiness. A refinement of the state-of-the-art formulation is presented in this work, and an improved exact combinatorial Benders decomposition algorithm is devised for the problem at container terminals which used to be typically modeled by mixed-integer linear programming problems containing a large number of “big-M” coefficients.

关键词： Marine vehicles Cranes Mixed integer linear programming Resource management Planning Containers Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Answer Set programming: Boolean Constraint Solving for Knowledge Representation and Reasoning

Answer Set Programming: Boolean Constraint Solving for Knowl...

引用

19th Annual international conference on Principles and Practice of Constraint programming (CP)

作者： Schaub, Torsten Simon Fraser Univ Burnaby BC V5A 1S6 Canada

ISBN: (纸本)9783642406263;9783642406270

Answer Set programming (ASP; [1,2,3]) is a declarative problem solving approach, combining a rich yet simple modeling language with high-performance Boolean constraint solving capacities. ASP is particularly suited for modeling problems in the area of Knowledge Representation and Reasoning involving incomplete, inconsistent, and changing information. As such, it offers, in addition to satisfiability testing, various reasoning modes, including different forms of model enumeration, intersection or unioning, as well as multi-criteria and -objective optimization. From a formal perspective, ASP allows for solving all search problems in NP (and NP NP ) in a uniform way. Hence, ASP is wellsuited for solving hard combinatorial search problems, like system design and timetabling. Prestigious applications of ASP include composition of Renaissance music [4], decision support systems for NASA shuttle controllers [5], reasoning tools in systems biology [6,7,8] and robotics [9,10], industrial team-building [11], and many more. the versatility of ASP is nicely reflected by the ASP solver clasp [12], winning first places at various solver competitions, such as ASP,MISC, PB, and SAT competitions. the solver clasp is at the heart of the open source platform Potassco hosted at *** . Potassco stands for the “Potsdam Answer Set Solving Collection-[13] and has seen more than 30000 downloads world-wide since its inception at the end of 2008. the talk will start with an introduction to ASP, its modeling language and solving methodology, and portray some distinguished ASP systems.

关键词： Problem solving

来源：评论

学校读者我要写书评

暂无评论

Multiple traveling salesmen in asymmetric metrics

Multiple traveling salesmen in asymmetric metrics

引用

16th international Workshop on Approximation Algorithms for combinatorial optimization Problems, APPROX 2013 and the 17th international Workshop on Randomization and Computation, RANDOM 2013

作者： Friggstad, Zachary University of Waterloo Department of Combinatorics and Optimization Waterloo ON Canada

ISBN: (纸本)9783642403279

We consider some generalizations of the Asymmetric Traveling Salesman Path Problem. In these variants, we have multiple salesmen that we are to move around a metric and the goal is to have each node visited by at least one salesman. this should be done while minimizing the total distance travelled by all salesmen. In the first variant, we are given two nodes s,t and an integer k and the goal is to find k paths from s to t whose union covers all nodes. We give an efficient bicriteria approximation for this problem that uses at most k + k/b paths of total length at most O(b log |V|) times the optimum value of a natural LP relaxation. By setting b appropriately, we can obtain a true O(k log n)-approximation, an O(log n)-bicriteria approximation using at most 2k paths, or, more generally, an O(1/Ε log n)-bicriteria approximation using at most (1 + Ε)k paths. Prior to this work, only an O(k 2 log n)-approximation and an O(log n)-bicriteria approximation using at most O(k log n) paths were known. Next, we consider the case where we have k pairs of nodes {(si, ti)}i=1k. the goal is to find an si - ti path for every pair such that each node of G lies on at least one of these paths. Simple approximation algorithms are presented for the special cases where the metric is symmetric or where s i = ti for each i. We also show that the problem can be approximated within a factor O(log n) when k = 2. On the other hand, we demonstrate that the general problem cannot be approximated within any finite ratio unless P = NP. © 2013 Springer-Verlag.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Discrepancy-based additive bounding for the alldifferent constraint

引用

9th international conference on Principles and Practice of Constraint programming, CP 2003

作者： Lodi, Andrea Milano, Michela Rousseau, Louis-Martin D.E.I.S Università di Bologna Viale Risorgimento 2 Bologna40136 Italy Centre for Research on Transportation Université de Montréal CP 6128 Succ Centre-Ville MontréalH3C 3J7 Canada

ISBN: (纸本)3540202021

In this paper we show how to exploit in Constraint programming (CP) a well-known integer programming technique, the additive bounding procedure, when using Limited Discrepancy Search (LDS). LDS is an effective search strategy based on the concept of discrepancy, i.e., a branching decision which does not follow the suggestion of a given heuristic. the property of a node to have an associated discrepancy k can be modeled (and enforced) through a constraint, called k-discrepancy constraint. Our key result is the exploitation of the k-discrepancy constraint to improve the bound given by any relaxation of a combinatorial optimization problem by using the additive bounding idea. We believe that this simple idea can be effectively exploited to tighten relaxations in CP solvers and speed up the proof of optimality. the general use of additive bounding in conjunction with LDS has been presented in [14]. Here we focus on a particular case where the AllDifferent constraint is part of the CP model. In this case, the integration of additive bound in CP is particularly effective. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Sustainable Biofuel Solution for Industrial and Commercial Sectors: A Stochastic Green Supply Chain Design Approach 8th

Sustainable Biofuel Solution for Industrial and Commercial S...

引用

8th international conference on Advances in Energy Research , ICAER 2022

作者： Gumte, Kapil Indian Institute of Management Jammu Jammu India

ISBN: (纸本)9789819922789

To solve the two major challenges in the energy sector i.e. demand supply ratio and to achieve clean energy, biomass and biofuels provide the best suitable options in agriculture based developing nations like India. To facilitate the connection between stochastic biomass feed supply and final biofuel product demand green mixed-integer linear programming (MILP) based flexible supply chain network design (SCND) has been developed to act as an efficient tool to handle the uncertainty of biomass supply flow across the geographical states and union territories irrespective of variations in climate, water supply, soil, biomass composition, external imports using probability-based chance constraint programming (CCP). the stochastic model is NP-hard in nature and has multiple feeds, multiple echelons, and multiple time periods across the Indian terrain. Apart from optimal site selection, connectivity and capacity, the model also performs the life cycle assessment (LCA) for greenhouse gas emission (GHGe), and its savings and transforms them into carbon credit as 14.49% of total revenue generation. the external import even though costlier is blended with local biofuel to avoid inventory stockouts and maintain customer service levels. the improved stochastic results obtained are compared with the deterministic case to find that the profit calculated using the time value of money via net present worth (NPW) is 2% more with a lesser infrastructure cost of 58.89%. Overall for a biofuel project to run successfully in the Indian context, the extent of probability satisfaction for biomass feed supply should be 20% and more. © 2023, the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Transmission capacity margin assessment in power systems with uncertain wind integration

Transmission capacity margin assessment in power systems wit...

引用

IEEE international conference on Automation Science and Engineering (CASE)

作者： Yafei Yang Xuejiao Lei Qiaozhu Zhai Jiang Wu Xiaohong Guan Systems Engineering Institute MOE KLINNS Lab of Xi'an Jiaotong University China State Grid Energy Research Institute Beijing China Center for Intelligent and Networked Systems Tsinghua University Beijing China

High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacity margin assessment (TCMA) is established to quantify the transmission security with uncertain wind generation. the basic formulation is reformulated as a two-stage non-differentiable programming model. It can be transformed into a mixed integer linear programming (MILP) by duality theory and specific linearization techniques. Furthermore, an effective procedure is developed to improve the transmission capacity margin by necessary wind curtailment. A detailed case study is performed on the IEEE 31-bus system and numerical results verify the effectiveness of this TCMA framework.

关键词： Security Wind power generation Uncertainty Power transmission lines programming Linearization techniques optimization

来源：评论

学校读者我要写书评

暂无评论

A class of linear programs solvable by coordinate-wise minimization 1

引用

14th international conference on Learning and Intelligent optimization, LION 2020

作者： Dlask, Tomáš Werner, Tomáš Faculty of Electrical Engineering Czech Technical University in Prague Prague Czech Republic

ISBN: (数字)9783030535520

ISBN: (纸本)9783030535513

Coordinate-wise minimization is a simple popular method for large-scale optimization. Unfortunately, for general (non-differentiable and/or constrained) convex problems it may not find global minima. We present a class of linear programs that coordinate-wise minimization solves exactly. We show that dual LP relaxations of several well-known combinatorial optimization problems are in this class and the method finds a global minimum with sufficient accuracy in reasonable runtimes. Moreover, for extensions of these problems that no longer are in this class the method yields reasonably good suboptima. though the presented LP relaxations can be solved by more efficient methods (such as max-flow), our results are theoretically non-trivial and can lead to new large-scale optimization algorithms in the future. © Springer Nature Switzerland AG 2020.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

On the effectiveness of using sentence compression models for query-focused multi-document summarization

On the effectiveness of using sentence compression models fo...

引用

24th international conference on Computational Linguistics, COLING 2012

作者： Chali, Yllias Hasan, Sadid A. University of Lethbridge Lethbridge AB Canada

this paper applies sentence compression models for the task of query-focused multi-document summarization in order to investigate if sentence compression improves the overall summarization performance. Both compression and summarization are considered as global optimization problems and solved using integer linear programming (ILP). three different models are built depending on the order in which compression and summarization are performed: 1) ComFirst (where compression is performed first), 2) SumFirst (where important sentence extraction is performed first), and 3) Combined (where compression and extraction are performed jointly via optimizing a combined objective function). Sentence compression models include lexical, syntactic and semantic constraints while summarization models include relevance, redundancy and length constraints. A comprehensive set of query-related and importance-oriented measures are used to define the relevance constraint whereas four alternative redundancy constraints are employed based on different sentence similarity measures using a) cosine similarity, b) syntactic similarity, c) semantic similarity, and d) extended string subsequence kernel (ESSK). Empirical evaluation on the DUC benchmark datasets demonstrates that the overall summary quality can be improved significantly using global optimization with semantically motivated models. © 2012 the COLING.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 64 65 66 67 68 69 70 71 72 73 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：