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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

735 篇 会议
24 篇 期刊文献
16 册 图书

馆藏范围

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

日期分布

学科分类号

565 篇 工学
- 484 篇 计算机科学与技术...
- 136 篇 软件工程
- 78 篇 电气工程
- 48 篇 信息与通信工程
- 46 篇 控制科学与工程
- 19 篇 机械工程
- 12 篇 交通运输工程
- 11 篇 石油与天然气工程
- 10 篇 冶金工程
- 8 篇 电子科学与技术（可...
- 7 篇 动力工程及工程热...
- 7 篇 水利工程
- 6 篇 化学工程与技术
- 6 篇 生物工程
- 6 篇 安全科学与工程
- 5 篇 土木工程
- 5 篇 生物医学工程（可授...
361 篇 理学
- 349 篇 数学
- 52 篇 系统科学
- 15 篇 物理学
- 15 篇 统计学（可授理学、...
- 11 篇 生物学
- 6 篇 化学
176 篇 管理学
- 169 篇 管理科学与工程(可...
- 52 篇 工商管理
- 5 篇 图书情报与档案管...
21 篇 经济学
- 19 篇 应用经济学
8 篇 医学
- 6 篇 基础医学(可授医学...
- 6 篇 临床医学
5 篇 法学
- 5 篇 社会学
3 篇 农学
1 篇 文学
1 篇 军事学

主题

191 篇 integer programm...
100 篇 combinatorial op...
67 篇 optimization
59 篇 linear programmi...
25 篇 integer linear p...
22 篇 dynamic programm...
16 篇 mixed integer li...
15 篇 constraint progr...
14 篇 mixed integer pr...
13 篇 approximation al...
12 篇 combinatorial ma...
11 篇 mixed-integer pr...
11 篇 scheduling
9 篇 mixed-integer li...
9 篇 discrete mathema...
9 篇 artificial intel...
9 篇 mathematical mod...
9 篇 algorithm analys...
8 篇 computational co...
8 篇 computational mo...

机构

7 篇 carnegie mellon ...
6 篇 georgia inst tec...
5 篇 zuse inst berlin...
5 篇 ibm tj watson re...
5 篇 department of co...
4 篇 univ bologna dei...
4 篇 max planck inst ...
4 篇 mit cambridge ma...
4 篇 carnegie mellon ...
4 篇 department of co...
3 篇 mit alfred p slo...
3 篇 school of indust...
3 篇 univ wisconsin d...
3 篇 univ padua dipar...
3 篇 brown univ dept ...
3 篇 school of indust...
3 篇 eindhoven univ t...
3 篇 georgia inst tec...
3 篇 mit 77 massachus...
3 篇 univ padua dei i...

作者

8 篇 rousseau louis-m...
8 篇 lodi andrea
8 篇 nemhauser george...
6 篇 dilkina bistra
6 篇 weismantel rober...
6 篇 basu amitabh
6 篇 conforti michele
5 篇 linderoth jeff
5 篇 ahmed shabbir
5 篇 vielma juan pabl...
5 篇 balas egon
5 篇 dey santanu s.
5 篇 fischetti matteo
4 篇 munoz gonzalo
4 篇 cornuéjols gérar...
4 篇 fukasawa ricardo
4 篇 khalil elias b.
4 篇 berthold timo
4 篇 weltge stefan
4 篇 kaibel volker

语言

762 篇 英文
10 篇 其他
5 篇 中文

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

共 775 条记录，以下是11-20 订阅

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Recycling Inequalities for Robust combinatorial optimization with Budget Uncertainty 1

引用

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

作者： Buesing, Christina Gersing, Timo Koster, Arie M. C. A. Rhein Westfal TH Aachen Combinatorial Optimizat Aachen Germany Rhein Westfal TH Aachen Discrete Optimizat Aachen Germany

ISBN: (数字)9783031327261

ISBN: (纸本)9783031327254;9783031327261

Robust combinatorial optimization with budget uncertainty is one of the most popular approaches for integrating uncertainty in optimization problems. the existence of a compact reformulation for (mixed-integer) linear programs and positive complexity results give the impression that these problems are relatively easy to solve. However, the practical performance of the reformulation is actually quite poor when solving robust integer problems due to its weak linear relaxation. To overcome the problems arising from the weak formulation, we propose a procedure to derive new classes of valid inequalities for robust binary optimization problems. For this, we recycle valid inequalities of the underlying deterministic problem such that the additional variables from the robust formulation are incorporated. the valid inequalities to be recycled may either be readily available model constraints or actual cutting planes, where we can benefit from decades of research on valid inequalities for classical optimization problems. We first demonstrate the strength of the inequalities theoretically, by proving that recycling yields a facet-defining inequality in surprisingly many cases, even if the original valid inequality was not facet-defining. Afterwards, we show in a computational study that using recycled inequalities leads to a significant improvement of the computation time when solving robust optimization problems.

关键词： Robust optimization combinatorial optimization integer programming Polyhedral Combinatorics

来源：评论

学校读者我要写书评

暂无评论

Two-Stage Stochastic Stable Matching 25th

Two-Stage Stochastic Stable Matching

引用

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

作者： Faenza, Yuri Foussoul, Ayoub He, Chengyue Columbia Univ IEOR New York NY 10027 USA

ISBN: (纸本)9783031598340;9783031598357

We introduce and study a two-stage stochastic stable matching problem between students and schools. A decision maker chooses a stable matching in a marriage instance;then, after some agents enter or leave the market following a probability distribution D, chooses a stable matching in the new instance. the goal is, roughly speaking, to maximize the expected quality of the matchings across the two stages and minimize the expected students' discontent for being downgraded to a less preferred school in the second-stage. We consider both the case when D is given explicitly and when it is accessed via a sampling oracle. In the former case, we give a polynomial time algorithm. In the latter case, we show that, unless P = NP, no algorithm can find the optimal value or the optimal solution of the problem in polynomial-time. On the positive side, we give a pseudopolynomial algorithm that computes a solution of arbitrarily small additive error. Our techniques include the use of a newly defined poset of stable pairs, which may be of independent interest.

关键词： Stable Matching Two-stage stochastic programming Poset

来源：评论

学校读者我要写书评

暂无评论

Lower Bounds on the Complexity of Mixed-integer Programs for Stable Set and Knapsack 25th

Lower Bounds on the Complexity of Mixed-Integer Programs for...

引用

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

作者： Schade, Jamico Sinha, Makrand Weltge, Stefan Tech Univ Munich Munich Germany Univ Illinois Champaign IL 61820 USA

ISBN: (纸本)9783031598340;9783031598357

Standard mixed-integer programming formulations for the stable set problem on n-node graphs require n integer variables. We prove that this is almost optimal: We give a family of n-node graphs for which every polynomial-sizeMIP formulation requires Omega(n/ log(2) n) integer variables. By a polyhedral reduction we obtain an analogous result for n-item knapsack problems. In both cases, this improves the previously known bounds of Omega(root n/ log n) by Cevallos, Weltge & Zenklusen (SODA 2018). To this end, we show that there exists a family of n-node graphs whose stable set polytopes satisfy the following: any (1 + epsilon/n)-approximate extended formulation for these polytopes, for some constant epsilon > 0, has size 2(Omega(n / log n)). Our proof extends and simplifies the information-theoretic methods due to Goos, Jain & Watson (FOCS 2016, SIAM J. Comput. 2018) who showed the same result for the case of exact extended formulations (i.e. epsilon = 0).

关键词： mixed-integer programming stable set problem knapsack problem extended formulations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Deletion-Robust Submodular Maximization Under the Cardinality Constraint over the integer Lattice 12th

Deletion-Robust Submodular Maximization Under the Cardinali...

引用

12th international conference on Computational Data and Social Networks, CSoNet 2023

作者： Zhou, Guangwen Liu, Bin Qiang, Yuanyuan School of Mathematical Sciences Ocean University of China Qingdao China

ISBN: (纸本)9789819706686

Submodular optimization is a classical problem of combinatorial optimization. the objective functions of many combinatorial optimization problems are submodular functions and they also have significant applications in real life. Since some practical problems such as budget allocations that are hard to be modeled over set functions, submodular functions over the integer lattice have been widely and intensively studied subject to various classical constraints for decades. In this paper we study the robustness of maximizing a monotone diminishing return submodular function over the integer lattice under the cardinality constraint. We propose a robustness model over the integer lattice and design algorithms under this specific model by utilizing stochastic strategy combining with binary search approach. the algorithms we designed in centralized settings can achieve a (1/2-δ)-approximation and maintain robustness against deleting any d elements adversarially. While in streaming settings the algorithms we designed can still achieve the same approximation and be robust against deleting any d elements adversarially as well. © the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Assortment optimization with Visibility Constraints 25th

Assortment Optimization with Visibility Constraints

引用

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

作者： Barre, theo El Housni, Omar Lodi, Andrea Univ Calif Berkeley IEOR Berkeley CA USA Cornell Univ Cornell Tech ORIE New York NY 10021 USA

ISBN: (纸本)9783031598340;9783031598357

Motivated by applications in e-retail and online advertising, we study the problem of assortment optimization under visibility constraints, referred to as APV. We are given a universe of substitutable products and a stream of T customers. the objective is to determine the optimal assortment of products to offer to each customer in order to maximize the total expected revenue, subject to the constraint that each product is required to be shown to a minimum number of customers. the minimum display requirement for each product is given exogenously and we refer to these constraints as visibility constraints. We assume that customer choices follow a Multinomial Logit model. We provide a characterization of the structure of the optimal assortments and present an efficient polynomial time algorithm for solving APV. To accomplish this, we introduce a novel function called the "expanded revenue" of an assortment and establish its supermodularity. Our algorithm takes advantage of this structural property. Additionally, we demonstrate that APV can be formulated as a compact linear program. Finally, we propose a novel, fair strategy for pricing the revenue loss due to the enforcement of visibility constraints.

关键词： Assortment optimization Supermodularity Algorithm Design Multinomial Logit model Visibility Constraints

来源：评论

学校读者我要写书评

暂无评论

A Fast combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints 24th

A Fast Combinatorial Algorithm for the Bilevel Knapsack Prob...

引用

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

作者： Weninger, Noah Fukasawa, Ricardo Univ Waterloo Waterloo ON Canada

ISBN: (纸本)9783031327254;9783031327261

We consider the bilevel knapsack problem with interdiction constraints, a fundamental bilevel integer programming problem which generalizes the 0-1 knapsack problem. In this problem, there are two knapsacks and n items. the objective is to select some items to pack into the first knapsack such that the maximum profit attainable from packing some of the remaining items into the second knapsack is minimized. We present a combinatorial branch-and-bound algorithm which outperforms the current state-of-the-art solution method in computational experiments by 4.5 times on average for all instances reported in the literature. On many of the harder instances, our algorithm is hundreds of times faster, and we solved 53 of the 72 previously unsolved instances. Our result relies fundamentally on a new dynamic programming algorithm which computes very strong lower bounds. this dynamic program solves a relaxation of the problem from bilevel to 2n-level where the items are processed in an online fashion. the relaxation is easier to solve but approximates the original problem surprisingly well in practice. We believe that this same technique may be useful for other interdiction problems.

关键词： Bilevel programming Interdiction Knapsack problem combinatorial algorithm Dynamic programming Branch and bound

来源：评论

学校读者我要写书评

暂无评论

Sensitivity Analysis for Mixed Binary Quadratic programming 25th

Sensitivity Analysis for Mixed Binary Quadratic Programming

引用

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

作者： Cifuentes, Diego Dey, Santanu S. Xu, Jingye Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA

ISBN: (纸本)9783031598340;9783031598357

We consider sensitivity analysis for Mixed Binary Quadratic Programs (MBQPs) with respect to changing right-hand-sides (rhs). We show that even if the optimal solution of a given MBQP is known, it is NP-hard to approximate the change in objective function value with respect to changes in rhs. Next, we study algorithmic approaches to obtaining dual bounds for MBQP with changing rhs. We leverage Burer's completely-positive (CPP) reformulation of MBQPs. Its dual is an instance of co-positive programming (COP), and can be used to obtain sensitivity bounds. We prove that strong duality between the CPP and COP problems holds if the feasible region is bounded or if the objective function is convex, while the duality gap can be strictly positive if neither condition is met. We also show that the COP dual has multiple optimal solutions, and the choice of the dual solution affects the quality of the bounds with rhs changes. We finally provide a method for finding good nearly optimal dual solutions, and we present preliminary computational results on sensitivity analysis for MBQPs.

关键词： Sensitivity Analysis Mixed Binary Quadratic programming Copositive programming Duality theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共78页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：