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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Backdoors to combinatorial optimization: Feasibility and Optimality

Backdoors to Combinatorial Optimization: Feasibility and Opt...

引用

6th international conference Integration of AI and OR Techniques in Constraint programming for Combinatial optimization Problems

作者： Dilkina, Bistra Gomes, Carla P. Malitsky, Yuri Sabharwal, Ashish Sellmann, Meinolf Cornell Univ Dept Comp Sci Ithaca NY 14853 USA Brown Univ Dept Comp Sci Providence RI 02912 USA

ISBN: (纸本)9783642019289

there has been considerable interest in the identification of structural properties of combinatorial problems that lead;directly or indirectly, to the development of efficient algorithms for solving them. One such concept is that of a backdoor set-a set of variables such that once they are instantiated, the remaining problem simplifies to a tractable form. While backdoor sets were originally defined to capture structure in decision problems with discrete variables, here we introduce a notion of backdoors that;captures structure in optimization problems;which often have both discrete and continuous variables. We show that finding a feasible solution and proving optimality are characterized by backdoors of different kinds and size. Surprisingly;in certain mixed integer programming problems, proving optimality involves a smaller backdoor set, than finding the optimal solution. We also show extensive results on the number of backdoors of various sizes in optimization problems. Overall;this work demonstrates that backdoors;appropriately generalized;are also effective in capturing problem structure in optimization problems.

关键词： search variable selection backdoor sets

来源：评论

学校读者我要写书评

暂无评论

Generating Optimal Stowage Plans for Container Vessel Bays

Generating Optimal Stowage Plans for Container Vessel Bays

引用

15th international conference on Principles and Practice of Constraint programming (CP 2009)

作者： Delgado, Alberto Jensen, Rune Moller Schulte, Christian IT Univ Copenhagen Copenhagen Denmark KTH Royal Inst Technol Stockholm Sweden

ISBN: (纸本)9783642042430

Millions of containers are stowed ever.), week with goods worth billions of dollars, but container vessel stowage is an all but neglected combinatorial optimization problem. In this paper, we introduce a model for stowing containers in a vessel bay which is the result of probably the longest collaboration to date with a liner shipping company on automated stowage planning. We then show how to solve this model efficiently in - to our knowledge - the first;application of CP to stowage planning using state-of-the-art techniques such as extensive use of global constraints, viewpoints, static and dynamic symmetry breaking, decomposed branching strategies, and early failure detection. Our CP approach outperforms an integer programming and column generation approach in a preliminary study. Since a complete model of this problem includes even more logical constraints, we believe that stowage planning is a new application area, for CP with a high impact potential.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Nonlinear optimization over a Weighted Independence System

Nonlinear Optimization over a Weighted Independence System

引用

5th international conference on Algorithmic Aspects in Information and Management

作者： Lee, Jon Onn, Shmuel Weismantel, Robert IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA Technion Israel Inst Technol Haifa 32000 Israel Otto von Guericke Univ D-39106 Magdeburg Germany

ISBN: (纸本)9783642021572

We consider the problem of optimizing a nonlinear objective function over a weighted independence system presented by a linear optimization oracle. We provide a polynomial-time algorithm that determines an r-best solution for nonlinear functions of the total weight of an independent set, where r is a constant depending on certain Frobenius numbers of the weights and is independent of the size of the ground set. In contrast, we show that finding an optimal (0-best) solution requires exponential time even in a very special case of the problem.

关键词： independence system matroid oracle computation exponential running time combinatorial optimization integer programming nonlinear optimization approximation algorithm Frobenius number

来源：评论

学校读者我要写书评

暂无评论

κ-clustering minimum biclique completion via a hybrid CP and SDP approach

κ-clustering minimum biclique completion via a hybrid CP an...

引用

6th international conference on Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems, CPAIOR 2009

作者： Gualandi, Stefano Dipartimento di Elettronica e Informazione Politecnico di Milano Italy

ISBN: (纸本)3642019285

this paper presents a hybrid Constraint programming (CP) and Semidefinite programming (SDP) approach to the k-clustering minimum biclique completion problem on bipartite graphs. the problem consists in partitioning a bipartite undirected graph into k clusters such that the sum of the edges that complete each cluster into a biclique, i.e., a complete bipartite subgraph, is minimum. the problem arises in telecommunications, in particular in bundling channels in multicast transmissions. In literature, the problem has been tackled with an integer Bilinear programming approach. We introduce two quasi-biclique constraints and we propose a SDP relaxation of the problem that provides much stronger lower bounds than the Bilinear programming relaxation. the quasi-biclique constraints and the SDP relaxation are integrated into a hybrid CP and SDP approach. Computational results on a set of random instances provide further evidence about the potential of CP and SDP hybridizations. © 2009 Springer Berlin Heidelberg.

关键词： Constraint programming

来源：评论

学校读者我要写书评

暂无评论

Constrained multi-aspect expertise matching for committee review assignment

Constrained multi-aspect expertise matching for committee re...

引用

ACM 18th international conference on Information and Knowledge Management, CIKM 2009

作者： Karimzadehgan, Maryam Zhai, ChengXiang Department of Computer Science University of Illinois at Urbana-Champaign Urbana IL 61801 United States

ISBN: (纸本)9781605585123

Automatic review assignment can significantly improve the productivity of many people such as conference organizers, journal editors and grant administrators. Most previous works have set the problem up as using a paper as a query to independently "retrieve" a set of reviewers that should review the paper. A more appropriate formulation of the problem would be to simultaneously optimize the assignments of all the papers to an entire committee of reviewers under constraints such as the review quota. In this paper, we solve the problem of committee review assignment with multi-aspect expertise matching by casting it as an integer linear programming problem. the proposed algorithm can naturally accommodate any probabilistic or deterministic method for modeling multiple aspects to automate committee review assignments. Evaluation using an existing data set shows that the proposed algorithm is effective for committee review assignments based on multi-aspect expertise matching. Copyright 2009 ACM.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Shared Peptides in Mass Spectrometry Based Protein Quantification

引用

13th Annual international conference on Research Computational Molecular Biology

作者： Dost, Banu Bandeira, Nuno Li, Xiangqian Shen, Zhouxin Briggs, Steve Bafna, Vineet Univ Calif San Diego Dept Comp Sci & Engn La Jolla CA 92093 USA Univ Calif San Diego Dept Sci Biol San Diego CA 92093 USA

ISBN: (纸本)9783642020070

In analyzing the proteome using mass spectrometry, the mass values help identify the molecules, and the intensities help quantify them, relative to their abundance in other samples. Peptides that are shared across different protein sequences are typically discarded as being uninformative w.r.t each of the parent proteins. In this paper, we investigate the use of shared peptides which are ubiquitous (similar to 50% of peptides) in mass spectrometric data-sets. In many cases, shared peptides can help compute the relative amounts of different proteins that share the same peptide. Also, proteins with no unique peptide in the sample can still be analyzed for relative abundance. Our paper is the first attempt to use shared peptides in protein quantification, and makes use of combinatorial optimization to reduce the error in relative abundance measurements. We describe the topological and numerical properties required for robust estimates, and use them to improve our estimates for ill-conditioned systems. Extensive simulations validate our approach even in the presence of experimental error. We apply our method to a model of Arabidopsis root knot nematode infection, and elucidate the differential role of many protein family members in mediating host response to the pathogen.

关键词： shared peptides protein quantification linear programming optimization ITRAQ mass spectrometry

来源：评论

学校读者我要写书评

暂无评论

the mixing set with divisible capacities

引用

13th international conference on integer programming and combinatorial optimization

作者： Conforti, Michele Di Summa, Marco Wolsey, Laurence A. Univ Padua Dipartimento Matemat Pura & Applicata Via Trieste 63 I-35121 Padua Italy Catholic Univ Louvain CORE B-1348 Louvain Belgium

Given rational numbers C-0,...,C-m and b(0),...,b(m), the mixing set with arbitrary capacities is the mixed-integer set defined by conditions s + C(t)z(t) >= b(t), 0 = 0, z(t) integer, 0 <= t <= m. Such a set... 详细信息

ISBN: (纸本)9783540688860

Given rational numbers C-0,...,C-m and b(0),...,b(m), the mixing set with arbitrary capacities is the mixed-integer set defined by conditions s + C(t)z(t) >= b(t), 0 <= t <= m, s >= 0, z(t) integer, 0 <= t <= m. Such a set has applications in lot-sizing problems. We study the special case of divisible capacities, i.e. C-t/Ct-1 is a positive integer for 1 < t <= m. Under this assumption, we give an extended formulation for the convex hull of the above set that uses a quadratic number of variables and constraints.

关键词： mixed-integer programming compact extended formulations mixing sets

来源：评论

学校读者我要写书评

暂无评论

the air traffic flow management problem: An integer optimization approach

引用

13th international conference on integer programming and combinatorial optimization

作者： Bertsimas, Dimitris Lulli, Guglielmo Odoni, Amedeo MIT Alfred P Sloan Sch Management Cambridge MA 02139 USA Univ Milan Dept Informat Syst & Commun Milan Italy MIT Ctr Operat Res Dept Aeronaut & Astronaut Cambridge MA USA

ISBN: (纸本)9783540688860

In this paper, we present a new integer Program (IP) for the Air Traffic Flow Management (ATFM) problem. the model we propose provides a complete representation of all the phases of each flights, i.e., the phase of taking-off, of cruising and of landing;suggesting all the actions to be implemented to achieve the goal of safe, efficient, and expeditious aircraft movement. the distinctive feature of the model is that it allows rerouting decisions. these decisions are formulated by means of "local" conditions, which allow us to represent such decisions in a very compact way by only introducing new constraints. Moreover, to strengthen the polyhedral structure of the underlying relaxation, we also present three classes of valid inequalities. We report short computational times (less than 15 minutes) on instances of the size of the US air traffic control system that make it realistic that our approach can be used as the main engine of managing air traffic in the US.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Binary positive semidefinite matrices and associated integer polytopes

引用

13th international conference on integer programming and combinatorial optimization

作者： Letchford, Adam N. Sorensen, Michael M. Univ Lancaster Dept Management Sci Lancaster LA1 4YW England Univ Aarhus Aarhus Sch Business CORAL & Dept Business Studies Aarhus Denmark

ISBN: (纸本)9783540688860

We consider the positive semidefinite (psd) matrices with binary entries. We give a characterisation of such matrices, along with a graphical representation. We then move on to consider the associated integer polytopes. Several important and well-known integer polytopes - the cut, boolean quadric, multicut and clique partitioning polytopes - are shown to arise as projections of binary psd polytopes. Finally, we present various valid inequalities for binary psd polytopes, and show how they relate to inequalities known for the simpler polytopes mentioned. Along the way, we answer an open question in the literature on the max-cut problem, by showing that the so-called k-gonal inequalities define a polytope.

关键词： polyhedral combinatorics semidefinite programming

来源：评论

学校读者我要写书评

暂无评论

Constraint orbital branching

引用

13th international conference on integer programming and combinatorial optimization

作者： Ostrowski, James Linderoth, Jeff Rossi, Fabrizio Smriglio, Stefano Lehigh Univ Dept Ind & Syst Engn 200 W Packer Ave Bethlehem PA 18015 USA Univ Wisconsin Madison Dept Ind & Syst Engn Madison WI 53706 USA Univ Aquila Dept Informat I-67010 Coppito Italy

ISBN: (纸本)9783540688860

Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound procedure. In this work, the orbital branching methodology is extended so that the branching disjunction can be based on an arbitrary constraint. Many important families of integer programs are structured such that small instances from the family are embedded in larger instances. this structural information can be exploited to define a group of strong constraints on which to base the orbital branching disjunction. the symmetric nature of the problems is further exploited by enumerating non-isomorphic solutions to instances of the small family and using these solutions to create a collection of typically easy-to-solve integer programs. the solution of each integer program in the collection is equivalent to solving the original large instance. the effectiveness of this methodology is demonstrated by computing the optimal incidence width of Steiner Triple Systems and minimum cardinality covering designs.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 51 52 53 54 55 56 57 58 59 60 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：