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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

33 篇 会议
1 册 图书

馆藏范围

33 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

29 篇 工学
- 28 篇 计算机科学与技术...
- 6 篇 软件工程
- 2 篇 电气工程
- 1 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 水利工程
- 1 篇 环境科学与工程（可...
27 篇 理学
- 27 篇 数学
- 1 篇 系统科学
2 篇 管理学
- 2 篇 管理科学与工程(可...
- 2 篇 工商管理
1 篇 经济学
- 1 篇 应用经济学

主题

6 篇 linear programmi...
5 篇 integer programm...
4 篇 optimization
2 篇 assortment optim...
2 篇 planning
2 篇 extended formula...
2 篇 combinatorial op...
2 篇 mixed integer li...
1 篇 circuit imbalanc...
1 篇 additive combina...
1 篇 second-order con...
1 篇 task migration
1 篇 tree-fold
1 篇 scalability
1 篇 two-stage stocha...
1 篇 greedy algorithm...
1 篇 supermodularity
1 篇 routing
1 篇 clustering
1 篇 pseudo-boolean o...

机构

2 篇 inst adv study o...
2 篇 georgia inst tec...
1 篇 london sch econ ...
1 篇 school of cyber ...
1 篇 univ chile dept ...
1 篇 charles univ pra...
1 篇 dalle molle inst...
1 篇 univ michigan an...
1 篇 ppgla-pucpr para...
1 篇 swiss fed inst t...
1 篇 university of co...
1 篇 amazon modeling ...
1 篇 lund university
1 篇 univ ohiggins in...
1 篇 technion haifa
1 篇 univ bonn hausdo...
1 篇 bocconi univ mil...
1 篇 cornell univ ith...
1 篇 citibank n.a. 1 ...
1 篇 school of comput...

作者

2 篇 nagele martin
2 篇 el housni omar
2 篇 verdugo victor
2 篇 klein nathan
1 篇 mastrolilli mona...
1 篇 munoz gonzalo
1 篇 hassan mohamed m...
1 篇 oertel andy
1 篇 mikiharu arimura
1 篇 mathieu claire
1 篇 lee euiwoong
1 篇 walte matthias
1 篇 levin asaf
1 篇 williamson david...
1 篇 marsters brittne...
1 篇 neves flavio
1 篇 koenemann jochen
1 篇 foussoul ayoub
1 篇 lodi andrea
1 篇 buchbinder niv

语言

33 篇 英文
1 篇 其他

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

共 34 条记录，以下是1-10 订阅

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

详细简洁

排序：

25th international conference on integer programming and combinatorial optimization, ipco 2024

25th International Conference on Integer Programming and Com...

引用

25th international conference on integer programming and combinatorial optimization, ipco 2024

ISBN: (纸本)9783031598340

the proceedings contain 33 papers. the special focus in this conference is on integer programming and combinatorial optimization. the topics include: A Better-than-1.6-Approximation for Prize-Collecting TSP;on Matrices over a Polynomial Ring with Restricted Subdeterminants;a First Order Method for Linear programming Parameterized by Circuit Imbalance;approximately Packing Dijoins via Nowhere-Zero Flows;capacitated Facility Location with Outliers and Uniform Facility Costs;integer Points in Arbitrary Convex Cones: the Case of the PSD and SOC Cones;the Extension Complexity of Polytopes with Bounded Integral Slack Matrices;assortment optimization with Visibility Constraints;adaptivity Gaps in Two-Sided Assortment optimization;two-Stage Stochastic Stable Matching;von Neumann-Morgenstern Stability and Internal Closedness in Matching theory;fully-Dynamic Load Balancing;pairwise-Independent Contention Resolution;An FPTAS for Connectivity Interdiction;tight Lower Bounds for Block-Structured integer Programs;A Lower Bound for the Max Entropy Algorithm for TSP;on the Number of Degenerate Simplex Pivots;on the Partial Convexification of the Low-Rank Spectral optimization: Rank Bounds and Algorithms;on the Congruency-Constrained Matroid Base;online combinatorial Assignment in Independence Systems;decomposing Probability Marginals Beyond Affine Requirements;polynomial Algorithms to Minimize 2/3-Submodular Functions;A 43-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs;extending the Primal-Dual 2-Approximation Algorithm Beyond Uncrossable Set Families;network Flow Problems with Electric Vehicles;lower Bounds on the Complexity of Mixed-integer Programs for Stable Set and Knapsack;relaxation Strength for Multilinear optimization: McCormick Strikes Back;online Algorithms for Spectral Hypergraph Sparsification;fast combinatorial Algorithms for Efficient Sortation;a New Branching Rule for Range Minimization Problems;sensitivity Analysis for Mixed Binary Quadrat

关键词：

来源：评论

学校读者我要写书评

暂无评论

integer programming and combinatorial optimization : 17th international conference, ipco 2014, Bo...

引用

2014年

作者： ipco 2014

来源：内蒙古大学图书馆图书评论

学校读者我要写书评

暂无评论

Research on Task Migration Problem Based on Link Uncertainty in Adversarial Scenarios 25th

Research on Task Migration Problem Based on Link Uncertainty...

引用

25th international conference on Parallel and Distributed Computing, Applications and Technologies, PDCAT 2024

作者： Xing, Xiangxiang Li, Pan Zuo, Tianyu Jiang, Yuanshuang Di, Kai Wang, Xin Jiao, Xun Jiang, Yichuan Chen, Dan School of Cyber Science and Engineering Southeast University Jiangsu Nanjing211189 China School of Computer Science and Engineering Southeast University Jiangsu Nanjing211189 China No. 8511 Research Institute of CASIC Jiangsu Nanjing210007 China Institute of Systems Engineering Academy of Military Science Beijing China College of Electronics and Information Engineering Beibu Gulf University Guangxi Qinzhou535000 China

ISBN: (纸本)9789819642069

With developments in artificial intelligence, computer science, and network technologies, modern confrontational scenarios are increasingly related to multi-agent systems characterized by multi-network. To reduce the effects of external factors on task execution, a task migration algorithm based on link uncertainty in adversarial scenarios is designed. Firstly, this thesis models the underlying problem as an integer programming problem, defining the optimization objectives and constraints accordingly. Subsequently, inter- and intra-network layer task migration is carried out based on gene expression programming to ensure the optimization objective and improve the load balance. Finally, experimental results demonstrate the algorithm’s efficacy in improving migration benefits and mitigating the impact of uncertainty. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Gene expression programming optimization Objectives Task migration Uncertainty

来源：评论

学校读者我要写书评

暂无评论

Relaxation Strength for Multilinear optimization: McCormick Strikes Back 25th

Relaxation Strength for Multilinear Optimization: McCormick ...

引用

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

作者： Schutte, Emily Walte, Matthias Univ Luxembourg L-4365 Esch Sur Alzette Luxembourg Univ Twente Dept Appl Math Enschede Netherlands

ISBN: (纸本)9783031598340;9783031598357

We consider linear relaxations for multilinear optimization problems. In a recent paper, Khajavirad proved that the extended flower relaxation is at least as strong as the relaxation of any recursive McCormick linearization (Operations Research Letters 51 (2023) 146-152). In this paper we extend the result to more general linearizations, and present a simpler proof. Moreover, we complement Khajavirad's result by showing that the intersection of the relaxations of such linearizations and the extended flower relaxation are equally strong.

关键词： Pseudo-Boolean optimization multilinear optimization cutting planes extended formulations

来源：评论

学校读者我要写书评

暂无评论

integer Points in Arbitrary Convex Cones: the Case of the PSD and SOC Cones 25th

Integer Points in Arbitrary Convex Cones: The Case of the PS...

引用

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

作者： De Loera, Jesus A. Marsters, Brittney Xu, Luze Zhang, Shixuan Univ Calif Davis Davis CA 95616 USA Texas A&M Univ College Stn TX 77843 USA

ISBN: (纸本)9783031598340;9783031598357

We investigate the semigroup of integer points inside a convex cone. We extend classical results in integer linear programming to integer conic programming. We show that the semigroup associated with nonpolyhedral cones can sometimes have a notion of finite generating set. We show this is true for the cone of positive semidefinite matrices (PSD) and the second-order cone (SOC). Both cones have a finite generating set of integer points, similar in spirit to Hilbert bases, under the action of a finitely generated group. We also extend notions of total dual integrality, Gomory-Chv ' atal closure, and Carath ' eodory rank to integer points in arbitrary cones.

关键词： integer Points Convex Cones Semigroups Hilbert bases Conic programming Positive Semidefinite Cone Second-Order Cone

来源：评论

学校读者我要写书评

暂无评论

On the Congruency-Constrained Matroid Base 25th

On the Congruency-Constrained Matroid Base

引用

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

作者： Liu, Siyue Xu, Chao Univ Elect Sci & Technol China Chengdu Peoples R China Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9783031598340;9783031598357

Consider a matroid where all elements are labeled with an element in Z. We are interested in finding a base where the sum of the labels is congruent to g (mod m). We show that this problem can be solved in (O) over tilde (2(4m)nr(5/6)) time for a matroid with n elements and rank r, when m is either the product of two primes or a prime power. the algorithm can be generalized to all moduli and, in fact, to all abelian groups if a classic additive combinatorics conjecture by Schrijver and Seymour holds true. We also discuss the optimization version of the problem.

关键词： Matroid Additive Combinatorics optimization

来源：评论

学校读者我要写书评

暂无评论

Sparsity and Integrality Gap Transference Bounds for integer Programs 25th

Sparsity and Integrality Gap Transference Bounds for Integer...

引用

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

作者： Aliev, Iskander Celaya, Marcel Henk, Martin Cardiff Univ Cardiff Wales Tech Univ Berlin Berlin Germany

ISBN: (纸本)9783031598340;9783031598357

We obtain new transference bounds that connect two active areas of research: proximity and sparsity of solutions to integer programs. Specifically, we study the additive integrality gap of the integer linear programs min{c.x : x is an element of P boolean AND Z(n)}, where P = {x is an element of R-n : Ax = b, x >= 0} is a polyhedron in the standard form determined by an integer m x n matrix A and an integer vector b. the main result of the paper gives an upper bound for the integrality gap that drops exponentially in the size of support of the optimal solutions corresponding to the vertices of the integer hull of P. Additionally, we obtain a new proximity bound that estimates the l(2)-distance from a vertex of P to its nearest integer point in the polyhedron P. the proofs make use of the results from the geometry of numbers and convex geometry.

关键词： Integrality gap Proximity Sparsity

来源：评论

学校读者我要写书评

暂无评论

On the Number of Degenerate Simplex Pivots 25th

On the Number of Degenerate Simplex Pivots

引用

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

作者： Kukharenko, Kirill Sanita, Laura Otto von Guericke Univ Magdeburg Germany Bocconi Univ Milan Italy

ISBN: (纸本)9783031598340;9783031598357

the simplex algorithm is one of the most popular algorithms to solve linear programs (LPs). Starting at an extreme point solution of an LP, it performs a sequence of basis exchanges (called pivots) that allows one to move to a better extreme point along an improving edge-direction of the underlying polyhedron. A key issue in the simplex algorithm's performance is degeneracy, which may lead to a (potentially long) sequence of basis exchanges which do not change the current extreme point solution. In this paper, we prove that it is always possible to limit the number of consecutive degenerate pivots that the simplex algorithm performs to n - m - 1, where n is the number of variables and m is the number of equality constraints of a given LP in standard equality form.

关键词： Simplex Algorithm Linear programming Degeneracy

来源：评论

学校读者我要写书评

暂无评论

A Lower Bound for the Max Entropy Algorithm for TSP 25th

A Lower Bound for the Max Entropy Algorithm for TSP

引用

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

作者： Jin, Billy Klein, Nathan Williamson, David P. Cornell Univ Ithaca NY 14850 USA Inst Adv Study Olden Lane Princeton NJ 08540 USA

ISBN: (纸本)9783031598340;9783031598357

One of the most famous conjectures in combinatorial optimization is the four-thirds conjecture, which states that the integrality gap of the subtour LP relaxation of the TSP is equal to 4/3. For 40 years, the best known upper bound was 1.5, due to Wolsey [Wol80]. Recently, Karlin, Klein, and Oveis Gharan [KKO22] showed that the max entropy algorithm for the TSP gives an improved bound of 1.5 - 10(-36). In this paper, we show that the approximation ratio of the max entropy algorithm is at least 1.375, even for graphic TSP. thus the max entropy algorithm does not appear to be the algorithm that will ultimately resolve the four-thirds conjecture in the affirmative, should that be possible.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：