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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

41 篇 会议
2 册 图书
2 篇 期刊文献

馆藏范围

45 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

24 篇 理学
- 23 篇 数学
- 2 篇 物理学
- 1 篇 系统科学
- 1 篇 统计学（可授理学、...
22 篇 工学
- 18 篇 计算机科学与技术...
- 6 篇 软件工程
- 2 篇 电气工程
- 1 篇 信息与通信工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 安全科学与工程
- 1 篇 公安技术
5 篇 管理学
- 5 篇 管理科学与工程(可...
- 2 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
1 篇 医学
- 1 篇 临床医学

主题

9 篇 integer programm...
6 篇 linear programmi...
4 篇 combinatorial op...
3 篇 approximation al...
2 篇 polynomial appro...
2 篇 optimization
2 篇 discrete mathema...
2 篇 graph theory
2 篇 path traveling s...
2 篇 numeric computin...
2 篇 constraint progr...
2 篇 linear programmi...
2 篇 algorithm analys...
1 篇 multi-objective ...
1 篇 computer science
1 篇 passive optical ...
1 篇 greedy algorithm...
1 篇 stable set
1 篇 rails
1 篇 theory of comput...

机构

2 篇 univ waterloo de...
2 篇 department of co...
1 篇 cnrs grenoble
1 篇 sabanci univ tr-...
1 篇 department of ma...
1 篇 univ politecn ca...
1 篇 department of co...
1 篇 tsinghua univers...
1 篇 university of ca...
1 篇 beijing jiatong ...
1 篇 computer science...
1 篇 technion haifa
1 篇 canadian inst te...
1 篇 abo akad univ la...
1 篇 microsoft resear...
1 篇 max-planck-insti...
1 篇 institut für mat...
1 篇 university of pa...
1 篇 massachusetts in...
1 篇 swiss fed inst t...

作者

2 篇 friggstad zachar...
2 篇 gao zhihan
2 篇 guenin bertrand
2 篇 gupta anupam
1 篇 telha claudio
1 篇 munoz gonzalo
1 篇 jensen anders ne...
1 篇 buesing christin...
1 篇 daniilidis aris
1 篇 li yz
1 篇 lim a
1 篇 çela eranda
1 篇 van den boom ton...
1 篇 herrero xavier
1 篇 woeginger gerhar...
1 篇 andersen kent
1 篇 bienstock daniel
1 篇 kocuk burak
1 篇 buchbinder niv
1 篇 cornuéjols gérar...

语言

45 篇 英文

检索条件"任意字段=16th Conference on Integer Programming and Combinatorial Optimization, IPCO 2013"

共 45 条记录，以下是31-40 订阅

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

详细简洁

排序：

Integral polyhedra related to even cycle and even cut matroids 1

引用

8th International integer programming and combinatorial optimization conference, ipco 2001

作者： Guenin, Bertrand Department of Combinatorics and Optimization University of Waterloo Canada

ISBN: (数字)9783540455356

ISBN: (纸本)3540422250

A family of sets H is ideal if the polyhedron {x ≥ 0 ∑i∈Sxi ≥ 1, VS H} is integral. Consider a graph G with vertices s,*** odd st-walk is either: an odd st-path;or the union of an even st-path and an odd circuit which share at most one vertex. Let T be a subset of vertices of even cardinality. An st-T-cut is a cut of the form δ(U) where |U ⋂ T| is odd and U contains exactly one of s or t. We give excluded minor characterizations for when the families of odd st-walks and st-T-cuts (represented as sets of edges) are ideal. As a corollary we characterize which extensions and coextensions of graphic and cographic matroids are 1-flowing. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Algorithms - ESA 2008 1

引用

丛书名： Lecture Notes in Computer Science

1000年

ISBN: (数字)9783540877448

ISBN: (纸本)9783540877431

this book constitutes the refereed proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. the 67 revised full papers presented together with 2 invited lectures were carefully reviewed and selected: 51 papers out of 147 submissions for the design and analysis track and 16 out of 53 submissions in the engineering and applications track. the papers address all current subjects in algorithmics reaching from design and analysis issues of algorithms over to real-world applications and engineering of algorithms in various fields. Special focus is given to mathematical programming and operations research, including combinatorial optimization, integer programming, polyhedral combinatorics and network optimization.

关键词： programming Techniques Computer Communication Networks theory of Computation Algorithm Analysis and Problem Complexity Numeric Computing Discrete Mathematics in Computer Science

来源：评论

学校读者我要写书评

暂无评论

the quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases 5th

The quadratic assignment problem with a monotone anti-monge ...

引用

5th International conference integer programming and combinatorial optimization, ipco 1996

作者： Burkard, Rainer E. Çela, Eranda Rote, Günther Woeginger, Gerhard J. Institut für Mathematik B Technische Universität Graz Steyrergasse 30 GrazA-8010 Austria Department of Mathematics and Computer Science Eindhoven University of Technology P.O. Box 513 Eindhoven5600 MB Netherlands

ISBN: (纸本)3540613102

the Anti-Monge-Toeplitz QAP (AMT-QAP) is a restricted version of the Quadratic Assignment Problem (QAP), with a monotone Anti-Monge matrix and a symmetric Toeplitz matrix. the following problems can be modeled via the AMT-QAP: (P1) the "Turbine Problem", i. e. the assignment of given masses to the vertices of a regular polygon such that the distance of the gravity center of the resulting system to the polygon's center is minimized. (P2) the Traveling Salesman Problem on symmetric Monge matrices. (P3) the linear arrangement of records with given access probabilities in order to minimize the average access time. We identify conditions on the Toeplitz matrix that lead to polynomially solvable cases of the AMT-QAP. In each of these cases an optimal permutation can be given without regarding the numerical problem data. We show that the Turbine Problem is NP-hard and consequently, that the AMT-QAP is NP-hard. © Springer-Verlag Berlin Heidelberg 1996.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Orchestration by approximation

Orchestration by approximation

引用

16th International conference on Architectural Support for programming Languages and Operating Systems, ASPLOS 2011

作者： Farhad, S.M. Ko, Yousun Burgstaller, Bernd Scholz, Bernhard University of Sydney Sydney Australia Yonsei University Seoul Korea Republic of NICTA Locked Bag 9013 Alexandria NSW 1435 Australia

ISBN: (纸本)9781450302661

We present a novel 2-approximation algorithm for deploying stream graphs on multicore computers and a stream graph transformation that eliminates bottlenecks. the key technical insight is a data rate transfer model that enables the computation of a "closed form", i.e., the data rate transfer function of an actor depending on the arrival rate of the stream program. A combinatorial optimization problem uses the closed form to maximize the throughput of the stream program. Although the problem is inherently NP-hard, we present an efficient and effective 2-approximation algorithm that provides a lower bound on the quality of the solution. We introduce a transformation that uses the closed form to identify and eliminate bottlenecks. We show experimentally that state-of-the art integer linear programming approaches for orchestrating stream graphs are (1) intractable or at least impractical for larger stream graphs and larger number of processors and (2) our 2-approximation algorithm is highly efficient and its results are close to the optimal solution for a standard set of StreamIt benchmark programs. Copyright © 2011 ACM.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

16th Annual International conference on combinatorial optimization and Applications, COCOA 2023

16th Annual International Conference on Combinatorial Optimi...

引用

16th Annual International conference on combinatorial optimization and Applications, COCOA 2023

ISBN: (纸本)9783031496103

the proceedings contain 73 papers. the special focus in this conference is on combinatorial optimization and Applications. the topics include: Improved Scheduling with a Shared Resource;an Energy-Efficient Scheduling Method for Real-Time Multi-workflow in Container Cloud;weakly Nondominated Solutions of Set-Valued optimization Problems with Variable Ordering Structures in Linear Spaces;the MaxIS-Shapley Value in Perfect Graphs;asteroidal Sets and Dominating Paths;a Novel Approximation Algorithm for Max-Covering Circle Problem;GAMA: Genetic Algorithm for k-Coverage and Connectivity with Minimum Sensor Activation in Wireless Sensor Networks;simple Heuristics for the Rooted Max Tree Coverage Problem;efficient Algorithms for k-Submodular Function Maximization with p-System and d-Knapsack Constraint;algorithms on a Path Covering Problem with Applications in Transportation;data Summarization Beyond Monotonicity: Non-monotone Two-Stage Submodular Maximization;greedy+Max: An Efficient Approximation Algorithm for k-Submodular Knapsack Maximization;improved Lower Bound for Estimating the Number of Defective Items;popularity on the Roommate Diversity Problem;on Half Guarding Polygons;dynamic programming for the Fixed Route Hybrid Electric Aircraft Charging Problem;algorithms for the Ridesharing with Profit Constraint Problem;multi-Candidate Carpooling Routing Problem and Its Approximation Algorithms;maximizing Utilitarian and Egalitarian Welfare of Fractional Hedonic Games on Tree-Like Graphs;the Line-Constrained Maximum Coverage Facility Location Problem;faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges;on Connectedness of Solutions to integer Linear Systems;an Exact Algorithm for the Line-Constrained Bottleneck k-Steiner Tree Problem;the Longest Subsequence-Repeated Subsequence Problem;an Approximation Algorithm for Covering Vertices by 4+ -Paths;V-Words, Lyndon Words and Substring circ-UMFFs;the Two-Center

关键词：

来源：评论

学校读者我要写书评

暂无评论

16th Annual International conference on combinatorial optimization and Applications, COCOA 2023

16th Annual International Conference on Combinatorial Optimi...

引用

16th Annual International conference on combinatorial optimization and Applications, COCOA 2023

ISBN: (纸本)9783031496134

关键词：

来源：评论

学校读者我要写书评

暂无评论

An MILP Model for Distributed Energy System optimization

An MILP Model for Distributed Energy System Optimization

引用

16th International conference on Process Integration, Modelling and Optimisation for Energy Saving and Pollution Reduction (PRES)

作者： Haikarainen, Carl Pettersson, Frank Saxen, Henrik Abo Akad Univ Lab Heat & Flow Engn FI-20500 Turku Finland

ISBN: (纸本)9788895608266

Investigations regarding means to achieve savings in primary energy use and to decrease anthropogenic CO2 emissions have shown that improved energy efficiency has potential to offer a significant contribution to this cause. Considering energy networks and systems, improvements can be achieved by optimizing the structure of the energy chains and distribution networks. For instance, in the case of district heating, it is possible to find an optimal choice of energy supply and design of piping networks to provide the energy required by the customers. Additionally, heat storages and local small-scale energy contributions from e. g. heat pumps could provide benefits and should be taken into consideration. the complexity of the optimization problem increases when the choices of technologies and capacities as well as the network topologies need to be considered. Furthermore, a level of intricacy is added by the large differences in energy demand and temperature conditions between day and night and different seasons. A mixed-integer linear programming model for optimizing distributed energy systems, which takes into account the above mentioned aspects, is being developed and is presented herein. the model is tested with a case study concerning district heating in a locality in southern Finland.

关键词： District heating

来源：评论

学校读者我要写书评

暂无评论

ILP Model for Greenfield WDM PON Network Design Based on Physical Layer Constraints

ILP Model for Greenfield WDM PON Network Design Based on Phy...

引用

16th conference on Novel Optical Systems Design and optimization XVI

作者： Arevalo, German V. Sierra, Javier E. Hincapie, Roberto C. Univ Politecn Salesiana Gietec Res Grp Quito Ecuador

ISBN: (纸本)9780819496928

One of the main issues in the WDM PON networks design is the optimal dimensioning of the network. the network size usually depends on the traffic demand and the user density, taking in to account the active and passive equipment capacity and some physical layer constraints like the attenuation in the optical path. However, some physical layer limitations related with signal transmission in an optical fiber become more relevant in a WDM transmission and when operating at very high data rates, like 10 Gbps or beyond. In this paper we propose a novel physical layer restrictions based integer linear programming (ILP) model for greenfield next generation 10 Gbps WDM PON network design. the results of the model are validated by means of computational techniques. the proposed ILP model takes into account not only the attenuation of the signal in the optical path but also, through the use of the data obtained by simulation software. We take in to account the restrictions imposed by other phenomena like dispersion, cross talk and some non linear effects typically present in a dense WDM optical transmission.

关键词： Passive optical networks (PON) wavelength division multiplexing (WDM) integer linear programming (ILP)

来源：评论

学校读者我要写书评

暂无评论

Exploiting the power of MIP solvers in MAXSAT

Exploiting the power of MIP solvers in MAXSAT

引用

16th International conference on theory and Applications of Satisfiability Testing, SAT 2013

作者： Davies, Jessica Bacchus, Fahiem Department of Computer Science University of Toronto Toronto ON M5S 3H5 Canada

ISBN: (纸本)9783642390708

maxsat is an optimization version of satisfiability. Since many practical problems involve optimization, there are a wide range of potential applications for effective maxsat solvers. In this paper we present an extensive empirical evaluation of a number of maxsat solvers. In addition to traditional maxsat solvers, we also evaluate the use of a state-of-the-art Mixed integer Program (mip) solver, cplex, for solving maxsat. mip solvers are the most popular technology for solving optimization problems and are also theoretically more powerful than sat solvers. In fact, we show that cplex is quite effective on a range of maxsat instances. Based on these observations we extend a previously developed hybrid approach for solving maxsat, that utilizes both a sat solver and a mip solver. Our extensions aim to take better advantage of the power of the mip solver. the resulting improved hybrid solver is shown to be quite effective. © 2013 Springer-Verlag.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Disjoint cycles: Integrality gap, hardness, and approximation

Disjoint cycles: Integrality gap, hardness, and approximatio...

引用

11th International ipco conference on integer programming and combinatorial optimization

作者： Salavatipour, Mohammad R. Verstraete, Jacques Department of Computing Science University of Alberta Edmonton Alta. T6G 2E8 Canada Department of Combinatorics and Optimization University of Waterloo Waterloo Ont. N2L 3G1 Canada

In the edge-disjoint cycle packing problem we are given a graph G and we have to find a largest set of edge-disjoint cycles in G. the problem of packing vertex-disjoint cycles in G is defined similarly. the best approximation algorithms for edge-disjoint cycle packing are due to Krivelevich et al. [16], where they give an O(√log n)-approximation for undirected graphs and an O(√n)-approximation for directed graphs. they also conjecture that the problem in directed case has an integrality gap of Ω(√n). No non-trivial lower bound is known for the integrality gap of this problem. Here we show that both problems of packing edge-disjoint and packing vertex-disjoint cycles in a directed graph have an integrality gap of Ω(log n/log log n). this is the first super constant lower bound for the integrality gap of these problems. We also prove that both problems are quasi-NP-hard to approximate within a factor of Ω(log1-Ε n), for any Ε > 0. For the problem of packing vertex-disjoint cycles, we give the first approximation algorithms with ratios O(log n) (for undirected graphs) and O(√n) (for directed graphs). Our algorithms work for the more general case where we have a capacity cv on every vertex v and we are seeking a largest set C of cycles such that at most cv cycles of C contain v. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：