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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 石油与天然气工程
340 篇 理学
- 321 篇 数学
- 43 篇 系统科学
- 14 篇 生物学
- 12 篇 物理学
- 11 篇 统计学（可授理学、...
- 4 篇 化学
165 篇 管理学
- 158 篇 管理科学与工程(可...
- 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 条记录，以下是161-170 订阅

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

详细简洁

排序：

Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry 1

引用

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

作者： Bendotti, Pascale Fouilhoux, Pierre Rottner, Cecile Sorbonne Univ CNRS 7606 LIP6 Paris France EDF R&D Palaiseau France

ISBN: (数字)9783030179533

ISBN: (纸本)9783030179533;9783030179526

We consider integer linear programs whose solutions are binary matrices and whose (sub-)symmetry groups are symmetric groups acting on (sub-)columns. We propose a framework to build (sub-)symmetry-breaking inequalities for such programs, by introducing one additional variable per sub-symmetry group considered. the proposed framework is applied to derive inequalities breaking both symmetries and sub-symmetries in the graph coloring problem and in the ramp constrained min-up/min-down unit commitment problem.

关键词： integer linear programming (Sub)-symmetry breaking inequalities Graph Coloring Problem Unit Commitment Problem

来源：评论

学校读者我要写书评

暂无评论

A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable integer Programs

A Polynomial-Time Algorithm for Optimizing over <i>N</i>-Fol...

引用

14th international conference integer programming and combinatorial optimization

作者： Hemmecke, Raymond Koeppe, Matthias Weismantel, Robert Tech Univ Munich D-8000 Munich Germany Univ Calif Davis CA USA ETH Zurich Switzerland

ISBN: (纸本)9783642130359

In this paper we generalize N-fold integer programs and two-stage integer programs with AT scenarios to N-fold 4-block decomposable integer programs. We show that for fixed blocks but variable N, these integer programs are polynomial-time solvable for any linear objective. Moreover, we present a polynomial-time computable optimality certificate for the case of fixed blocks, variable N and any convex separable objective function. We conclude with two sample applications, stochastic integer programs with second-order dominance constraints and stochastic integer multi-commodity flows, which (for fixed blocks) can be solved in polynomial time in the number of scenarios and commodities and in the binary encoding length of the input data. In the proof of our main theorem we combine several non-trivial constructions from the theory of Graver bases. We are confident that our approach paves the way for further extensions.

关键词： N-fold integer programs Graver basis augmentation algorithm polynomial-time algorithm stochastic multi-commodity flow stochastic integer programming

来源：评论

学校读者我要写书评

暂无评论

Linear programming Using Limited-Precision Oracles 20th

Linear Programming Using Limited-Precision Oracles

引用

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

作者： Gleixner, Ambros Steffy, Daniel E. Konrad Zuse Zentrum Informat Tech Berlin Takustr 7 D-14195 Berlin Germany Oakland Univ Math & Stat Rochester MI 48063 USA

ISBN: (纸本)9783030179533;9783030179526

Linear programming is a foundational tool for many aspects of integer and combinatorial optimization. this work studies the complexity of solving linear programs exactly over the rational numbers through use of an oracle capable of returning limited-precision LP solutions. Under mild assumptions, it is shown that a polynomial number of calls to such an oracle and a polynomial number of bit operations, is sufficient to compute an exact solution to an LP. Previous work has often considered oracles that provide solutions of an arbitrary specified precision. While this leads to polynomial-time algorithms, the level of precision required is often unrealistic for practical computation. In contrast, our work provides a foundation for understanding and analyzing the behavior of the methods that are currently most effective in practice for solving LPs exactly.

关键词： Linear programming Oracle complexity Diophantine approximation Exact solutions Symbolic computation Rational arithmetic Extended-precision arithmetic Iterative refinement

来源：评论

学校读者我要写书评

暂无评论

Models and methods for One-Dimensional Space Allocation Problem with forbidden zones 13

Models and methods for One-Dimensional Space Allocation Prob...

引用

13th international Scientific and Technical conference on Applied Mechanics and Systems Dynamics, AMSD 2019

作者： Zabudsky, G.G. Veremchuk, N.S. Sobolev Institute of Mathematics Novosibirsk Russia Siberian State Automobile and Highway University Omsk Russia

We consider an extension of the well-known optimization placement problem. the problem is One-Dimensional Space Allocation Problem (ODSAP). the classical formulation of the problem is to place rectangular connected objects on a line with the minimum total cost of connections between them. the extension of the problem is that there are fixed objects (forbidden zones) on the line. the objects are impossible to place in forbidden zones. the placed objects are connected among themselves and with the zones. the configuration of connections between objects is defined by a network. A similar situation arises, for example, when designing the location of technological equipment of petrochemical enterprise. It is necessary to place units of equipment so that the total cost of the pipeline ties was minimal. In this article a review of the models and methods to solve of the classical ODSAP is given. the properties of the problem with the forbidden zones are noted. Models of combinatorial optimization and integer programming for the problem are constructed. Algorithms for finding an approximate solution and branch and bounds are described. Results of computational experiments are reported. © Published under licence by IOP Publishing Ltd.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Towards a Characterization of Maximal Quadratic-Free Sets 24th

Towards a Characterization of Maximal Quadratic-Free Sets

引用

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

作者： Munoz, Gonzalo Paat, Joseph Serrano, Felipe Univ OHiggins Engn Sci Inst Rancagua Chile Univ British Columbia Sauder Sch Business Vancouver BC Canada I2DAMO GmbH Berlin Germany

ISBN: (纸本)9783031327254;9783031327261

In 1971, Balas introduced intersection cuts as a method for generating cutting planes in integer optimization. these cuts are derived from convex S-free sets, and inclusion-wise maximal S-free sets yield the strongest intersection cuts. When S is a lattice, maximal S-free sets are well-studied. In this work, we provide a new characterization of maximal S-free sets, for arbitrary S, based on sequences that 'expose' inequalities defining the S-free set;these exposing sequences generalize the notion of blocking points when S is a lattice. We then apply our characterization to partially characterize maximal S-free polyhedra when S is defined by a homogeneous quadratic inequality. Our results generate new families of maximal quadratic-free sets and considerably generalize some of the constructions by Munoz and Serrano (IPCO 2020), who first introduced maximal quadratic-free sets.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Semidefinite and Linear programming Integrality Gaps for Scheduling Identical Machines 1

引用

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

作者： Kurpisz, Adam Mastrolilli, Monaldo Mathieu, Claire Moemke, Tobias Verdugo, Victor Wiese, Andreas Dalle Molle Inst Artificial Intelligence Res Manno Switzerland Ecole Normale Super CNRS UMR 8548 Dept Comp Sci Paris France Univ Saarland Dept Comp Sci Saarbrucken Germany Univ Chile Dept Ind Engn Santiago Chile Max Planck Inst Informat Saarbrucken Germany

ISBN: (数字)9783319334615

ISBN: (纸本)9783319334615;9783319334608

Sherali-Adams [25] and Lovasz-Schrijver [21] developed systematic procedures to strengthen a relaxation known as lift-and-project methods. they have been proven to be a strong tool for developing approximation algorithms, matching the best relaxations known for problems like Max-Cut and Sparsest-Cut. In this work we provide lower bounds for these hierarchies when applied over the configuration LP for the problem of scheduling identical machines to minimize the makespan. First we show that the configuration LP has an integrality gap of at least 1024/1023 by providing a family of instances with 15 different job sizes. then we show that for any integer n there is an instance with n jobs in this family such that after Omega(n) rounds of the Sherali-Adams (SA) or the Lovasz-Schrijver (LS+) hierarchy the integrality gap remains at least 1024/1023.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Infrastructure leasing problems

引用

12th international integer programming and combinatorial optimization conference

作者： Anthony, Barbara M. Gupta, Anupam Carnegie Mellon Univ Dept Math Sci Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA USA

ISBN: (纸本)9783540727910

Consider the following Steiner Tree leasing problem. Given a graph G = (V, E) with root r, and a sequence of terminal sets D-t subset of V for each day t is an element of [T]. A feasible solution to the problem is a set of edges E-t for each t connecting D-t to r. Instead of obtaining edges for a single day at a time, or for infinitely long (both of which give Steiner tree problems), we lease edges for say, { a day, a week, a month, a year}. Naturally, leasing an edge for a longer period costs less per unit of time. What is a good leasing strategy? In this paper, we give a general approach to solving a wide class of such problems by showing a close connection between deterministic leasing problems and problems in multistage stochastic optimization. All our results are in the offline setting.

关键词： Approximation algorithms Graph and network algorithms Randomized algorithms Stochastic combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Orbital branching

引用

12th international integer programming and combinatorial optimization conference

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

ISBN: (纸本)9783540727910

We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. the method is based on computing groups of variables that are equivalent with respect to the symmetry remaining in the problem after branching, including symmetry which is not present at the root node. these groups of equivalent variables, called orbits, are used to create a valid partitioning of the feasible region which significantly reduces the effects of symmetry while still allowing a flexible branching rule. We also show how to exploit the symmetries present in the problem to fix variables throughout the branch-and-bound tree. Orbital branching can easily be incorporated into standard IP software. through an empirical study on a test suite of symmetric integer programs, the question as to the most effective orbit on which to base the branching decision is investigated. the resulting method is shown to be quite competitive with a similar method known as isomorphism pruning and significantly better than a state-of-the-art commercial solver on symmetric integer programs.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

An Artificial Intelligence Based Novel Approach for Real-time Allocation of Armament to Hostile Targets

An Artificial Intelligence Based Novel Approach for Real-tim...

引用

10th international Bhurban conference on Applied Science and Technology (IBCAST)

作者： Shahzad, Atif Ur-Rehman, Raza CESAT Islamabad Pakistan

ISBN: (纸本)9781467344265;9781467344258

For some specified targets, it is desired to identify the optimal configuration for the assignment of weapons for a given deployment of different types of weapon systems along with their required quantity in order to achieve a desired level of damage subject to the minimal cost and mission specific constraints. this problem, in its essence, is an NP-complete combinatorial optimization problem in the area of command and control research. In defense-related applications of artificial intelligence, this problem is referred as Weapon Target Assignment (WTA) problem. the problem can be formulated as a non-linear integer programming problem for which no exact methods exist to solve even the small size instances. Our focus is on the Dynamic Weapon Target Assignment (DWTA) problem. A discrete-event system simulation model is developed taking into account the resource constraints, resource capability constraints, strategy constraints and engagement feasibility constraints. three different methods are employed;MMR, Reactive Tabu Search and a newly proposed artificial intelligence based simulation-optimization hybrid framework. A set of rules is generated based on the optimization module that is then employed for real-time control. the computational results show very promising prospects of the proposed approach, not only for DWTA but also for any real-time decision-making problem like Cooperative Unmanned Air Vehicle Mission Assignment etc.

关键词： artificial intelligence combinatorial mathematics computational complexity decision making discrete event simulation integer programming military computing nonlinear programming search problems weapons

来源：评论

学校读者我要写书评

暂无评论

Fast combinatorial Algorithms for Efficient Sortation 25th

Fast Combinatorial Algorithms for Efficient Sortation

引用

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

作者： Van Dyk, Madison Klause, Kim Koenemann, Jochen Megow, Nicole Univ Waterloo Dept Combinator & Optimizat Waterloo ON Canada Univ Bremen Fac Math & Comp Sci Bremen Germany Amazon Modeling & Optimizat Seattle WA USA

ISBN: (纸本)9783031598340;9783031598357

Modern parcel logistic networks are designed to ship demand between given origin, destination pairs of nodes in an underlying directed network. Efficiency dictates that volume needs to be consolidated at intermediate nodes in a typical hub-and-spoke fashion. In practice, such consolidation requires parcel sortation. In this work, we propose a mathematical model for the physical requirements, and limitations of parcel sortation. We then show that it is NP-hard to determine whether a feasible sortation plan exists. We discuss several settings, where (near-) feasibility of a given sortation instance can be determined efficiently. the algorithms we propose are fast and build on combinatorial witness set type lower bounds that are reminiscent and extend those used in earlier work on degree-bounded spanning trees and arborescences.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 13 14 15 16 17 18 19 20 21 22 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：