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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

37 篇 会议

馆藏范围

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

日期分布

学科分类号

30 篇 工学
- 25 篇 计算机科学与技术...
- 4 篇 电气工程
- 3 篇 软件工程
- 1 篇 机械工程
- 1 篇 控制科学与工程
- 1 篇 交通运输工程
24 篇 理学
- 24 篇 数学
- 1 篇 物理学
6 篇 管理学
- 6 篇 管理科学与工程(可...
- 2 篇 工商管理

主题

6 篇 integer programm...
4 篇 combinatorial op...
3 篇 optimization
3 篇 integer linear p...
2 篇 constraint progr...
1 篇 knapsack constra...
1 篇 closed-loop oper...
1 篇 stable set
1 篇 routing
1 篇 generic partitio...
1 篇 flow-cut
1 篇 network function...
1 篇 approximation al...
1 篇 server allocatio...
1 篇 migration cost
1 篇 mixed-integer pr...
1 篇 integrated optic...
1 篇 coarseness
1 篇 ant colony optim...
1 篇 influence market...

机构

2 篇 inesc tec porto
2 篇 feup porto
2 篇 monash univ sch ...
1 篇 univ southern ca...
1 篇 ecole polytech c...
1 篇 northwestern uni...
1 篇 deakin univ sch ...
1 篇 univ campinas un...
1 篇 swiss fed inst t...
1 篇 univ calif davis...
1 篇 tech univ munich...
1 篇 univ fed abc san...
1 篇 harbin inst tech...
1 篇 ntt network serv...
1 篇 univ padua dipar...
1 篇 univ miami miami...
1 篇 dei via gradenig...
1 篇 digital prod fla...
1 篇 univ fed vales j...
1 篇 univ laval dept ...

作者

2 篇 lee dabeen
2 篇 de rezende pedro...
2 篇 catalao joao p. ...
2 篇 weltge stefan
2 篇 huynh tony
2 篇 home-ortiz juan ...
1 篇 fawzi omar
1 篇 munoz gonzalo
1 篇 oertel timm
1 篇 serrano felipe
1 篇 stoilova krasimi...
1 篇 vargas renzo
1 篇 sebo andras
1 篇 alouneh sahel
1 篇 mccormick s. tho...
1 篇 rousseau louis-m...
1 篇 huston c.
1 篇 takashi miyamura
1 篇 lodi andrea
1 篇 macedo leonardo ...

语言

36 篇 英文
1 篇 其他

检索条件"任意字段=21st International Conference on Integer Programming and Combinatorial Optimization, IPCO 2020"

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

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

详细简洁

排序：

21st international conference on integer programming and combinatorial optimization, ipco 2020

21st International Conference on Integer Programming and Com...

引用

21st international conference on integer programming and combinatorial optimization, ipco 2020

ISBN: (纸本)9783030457709

The proceedings contain 33 papers. The special focus in this conference is on integer programming and combinatorial optimization. The topics include: Algorithms for Flows over Time with Scheduling Costs;integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation;stochastic Makespan Minimization in structured Set Systems (Extended Abstract);continuous Facility Location on Graphs;recognizing Even-Cycle and Even-Cut Matroids;a combinatorial Algorithm for Computing the Rank of a Generic Partitioned Matrix with 2 × 2 Submatrices;fair Colorful k-Center Clustering;popular Branchings and Their Dual Certificates;sparse Graphs and an Augmentation Problem;flexible Graph Connectivity: Approximating Network Design Problems Between 1- and 2-Connectivity;About the Complexity of Two-stage stochastic IPs;packing Under Convex Quadratic Constraints;weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles;single Source Unsplittable Flows with Arc-Wise Lower and Upper Bounds;maximal Quadratic-Free Sets;on Generalized Surrogate Duality in Mixed-integer Nonlinear programming;the Integrality Number of an integer Program;persistency of Linear programming Relaxations for the stable Set Problem;constructing Lattice-Free Gradient Polyhedra in Dimension Two;sequence Independent Lifting for the Set of Submodular Maximization Problem;faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts;a Fast (2 + 2/7)-Approximation Algorithm for Capacitated Cycle Covering;graph Coloring Lower Bounds from Decision Diagrams;On Convex Hulls of Epigraphs of QCQPs;on the Convexification of Constrained Quadratic optimization Problems with Indicator Variables;optimizing Sparsity over Lattices and Semigroups;a Technique for Obtaining True Approximations for k-Center with Covering Constraints;tight Approximation Bounds for Maximum Multi-coverage.

关键词：

来源：评论

学校读者我要写书评

暂无评论

21st international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research, CPAIOR 2024

21st International Conference on the Integration of Constrai...

引用

21st international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research, CPAIOR 2024

ISBN: (纸本)9783031606014

The proceedings contain 21 papers. The special focus in this conference is on Integration of Constraint programming, Artificial Intelligence, and Operations Research. The topics include: Acquiring Constraints for a Non-linear Transmission Maintenance Scheduling Problem;efficiently Mining Closed Interval Patterns with Constraint programming;Local Alterations of the Lagrange Multipliers for Enhancing the Filtering of the AtMostNValue Constraint;Single Constant Multiplication for SAT;towards a Generic Representation of combinatorial Problems for Learning-Based Approaches;accelerating Continuous Variable Coherent Ising Machines via Momentum;decision-Focused Predictions via Pessimistic Bilevel optimization: A Computational study;bi-objective Discrete Graphical Model optimization;an Exploration of Exact Methods for Effective Network Failure Detection and Diagnosis;UNSAT Solver Synthesis via Monte Carlo Forest Search;a Hybrid Approach Integrating Generalized Arc Consistency and Differential Evolution for Global optimization;assessing Group Fairness with Social Welfare optimization;modeling and Exploiting Dominance Rules for Discrete optimization with Decision Diagrams;ViolationLS: Constraint-Based Local Search in CP-SAT;ULD Build-Up Scheduling with Logic-Based Benders Decomposition;a Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities;don’t Explain Noise: Robust Counterfactuals for Randomized Ensembles;Certifying MIP-Based Presolve Reductions for 0–1 integer Linear Programs;learning to Solve Job Shop Scheduling Under Uncertainty.

关键词：

来源：评论

学校读者我要写书评

暂无评论

21st international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research, CPAIOR 2024

21st International Conference on the Integration of Constrai...

引用

21st international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research, CPAIOR 2024

ISBN: (纸本)9783031605963

关键词：

来源：评论

学校读者我要写书评

暂无评论

Framework for Waste Collection Problem in a Low-Tech Urban Setting in India 21st

Framework for Waste Collection Problem in a Low-Tech Urban S...

引用

21st ISME international conference on Advances in Mechanical Engineering, ISME 2023

作者： Kala, Kaveri Bolia, Nomesh B. Department of Mechanical Engineering Indian Institute of Technology Delhi Hauz Khas New Delhi110016 India

ISBN: (纸本)9789819736539

This paper presents an operations-research-based improvement framework for a waste collection system in the capital city of India, Delhi. The existing manual system divides the urban region into ‘wards’, each with its depot (or garage) of trucks, and a ‘greedy’ method to assign trucks to collect waste from collection points. Here, we propose a framework that encourages the use of OR-based modelling in a low-tech setting. It is based on two types of interventions: system change and system optimization. In system change, a new routing process is developed using a mixed-integer linear programming (MILP) model to address the waste collection problem, which is formulated as a combinatorial optimization known as the vehicle routing problem (VRP). In system optimization, an appropriate intervention link is identified, and minimal changes are introduced to improve the system. A clustering method is utilized for this intervention to achieve efficiency. We found that the system change and the system optimization models led to a decrease of 0.26% and 0.66%, respectively, over the baseline cost. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Top-k Rule List Learning via integer Linear programming 21st

Top-k Rule List Learning via Integer Linear Programming

引用

21st Pacific Rim international conference on Artificial Intelligence, PRICAI 2024

作者： Sasaki, Yoichi Okajima, Yuzuru NEC Corporation 1753 Shimonumabe Kanagawa Nakahara-ku Kawasaki Japan

ISBN: (纸本)9789819601271

Rule lists, one of the best-known rule-based models, have been intensively studied in recent years because its high interpretability is desirable for use in important decision-making tasks. Although rule lists often achieve relatively higher accuracy than other rule-based models such as decision trees, they still have considerably lower accuracy than complex, uninterpretable models such as deep neural networks or large tree ensembles. In this paper, in order to improve the accuracy of rule lists, we propose a new model called a top-k rule list. In contrast to the traditional rule list, which makes a prediction by using the first rule in the list whose conditions are satisfied by the input, the top-k rule list utilizes an ensemble of the first k rules instead of just the first one. The top-k rule list can be viewed as a generalization of the traditional rule list, which is a special case with k=1, and this generalization enables the user to obtain a preferable trade-off between accuracy and interpretability by selecting different values of k. Learning the traditional rule list is known as a computationally hard combinatorial optimization problem, and learning the top-k rule list can be even harder because multiple rules must be considered for each prediction. To enable efficient learning, we propose an integer linear programming formulation for learning the top-k rule list, and effectively reduce the number of variables and constraints by introducing an assumption that the rules are ordered by certainty score. The experimental results show that the top-k rule list learned with the ILP formulation for k>1 outperformed the traditional rule list in accuracy for most datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Minimizing the Cost of Leveraging Influencers in Social Networks: IP and CP Approaches 1

引用

21st international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Pereira, Felipe de C. de Rezende, Pedro J. Yunes, Tallys Univ Campinas Unicamp Inst Comp Campinas SP Brazil Univ Miami Miami Herbert Business Sch Coral Gables FL 33124 USA

ISBN: (数字)9783031605994

ISBN: (纸本)9783031606014;9783031605994

In this paper, we introduce and study mathematical programming formulations for the Least Cost Directed Perfect Awareness Problem (LDPAP), an NP-hard optimization problem that arises in the context of influence marketing. In the LDPAP, we seek to identify influential members of a given social network that can disseminate a piece of information and trigger its propagation throughout the network. The objective is to minimize the cost of recruiting the initial spreaders while ensuring that the information reaches everyone. This problem has been previously modeled as two different integer programming formulations that were tested on a collection of 300 small synthetic instances. In this work, we propose two new integer programming models and three constraint programming formulations for the LDPAP. We also present preprocessing techniques capable of significantly reducing the sizes of these models. To investigate and compare the efficiency and effectiveness of our approaches, we perform a series of experiments using the existing small instances and a new publicly available benchmark of 14 large instances. Our findings yield new optimal solutions to 185 small instances that were previously unsolved, tripling the total number of instances with known optima. Regarding both small and large instances, our contributions include a comprehensive analysis of the experimental results and an evaluation of the performance of each formulation in distinct scenarios, further advancing our understanding of the LDPAP toward the design of exact approaches for the problem.

关键词： Least Cost Directed Perfect Awareness Problem Influence Marketing Social Networks integer programming Constraint programming

来源：评论

学校读者我要写书评

暂无评论

On the Convexification of Constrained Quadratic optimization Problems with Indicator Variables 21st

On the Convexification of Constrained Quadratic Optimization...

引用

21st international conference on integer programming and combinatorial optimization (ipco)

作者： Wei, Linchuan Gomez, Andres Kucukyavuz, Simge Northwestern Univ Dept Ind Engn & Management Sci Evanston IL USA Univ Southern Calif Daniel J Epstein Dept Ind & Syst Engn Los Angeles CA USA

ISBN: (纸本)9783030457716;9783030457709

Motivated by modern regression applications, in this paper, we study the convexification of quadratic optimization problems with indicator variables and combinatorial constraints on the indicators. Unlike most of the previous work on convexification of sparse regression problems, we simultaneously consider the nonlinear objective, indicator variables, and combinatorial constraints. We prove that for a separable quadratic objective function, the perspective reformulation is ideal independent from the constraints of the problem. In contrast, while rankone relaxations cannot be strengthened by exploiting information from k-sparsity constraint for k >= 2, they can be improved for other constraints arising in inference problems with hierarchical structure or multicollinearity.

关键词： Convexification Perspective formulation Indicator variables Quadratic optimization combinatorial constraints

来源：评论

学校读者我要写书评

暂无评论

Persistency of Linear programming Relaxations for the stable Set Problem 21st

Persistency of Linear Programming Relaxations for the Stable...

引用

21st international conference on integer programming and combinatorial optimization (ipco)

作者： Rodriguez-Heck, Elisabeth stickler, Karl Walter, Matthias Weltge, stefan Rhein Westfal TH Aachen Lehrstuhl Operat Res Aachen Germany Univ Twente Dept Appl Math Enschede Netherlands Tech Univ Munich Dept Math Munich Germany

ISBN: (纸本)9783030457716;9783030457709

The Nemhauser-Trotter theorem states that the standard linear programming (LP) formulation for the stable set problem has a remarkable property, also known as (weak) persistency: for every optimal LP solution that assigns integer values to some variables, there exists an optimal integer solution in which these variables retain the same values. While the standard LP is defined by only non-negativity and edge constraints, a variety of stronger LP formulations have been studied and one may wonder whether any of them has the this property as well. We show that any stronger LP formulation that satisfies mild conditions cannot have the persistency property on all graphs, unless it is always equal to the stable-set polytope.

关键词： Persistency integer linear programming stable set

来源：评论

学校读者我要写书评

暂无评论

Optimizing Sparsity over Lattices and Semigroups 21st

Optimizing Sparsity over Lattices and Semigroups

引用

21st international conference on integer programming and combinatorial optimization (ipco)

作者： Aliev, Iskander Averkov, Gennadiy De Loera, Jesus A. Oertel, Timm Cardiff Univ Cardiff Wales Brandenburg Univ Technol Cottbus Senftenberg Senftenberg Germany Univ Calif Davis Davis CA USA

ISBN: (纸本)9783030457716;9783030457709

Motivated by problems in optimization we study the sparsity of the solutions to systems of linear Diophantine equations and linear integer programs, i.e., the number of non-zero entries of a solution, which is often referred to as the l(0)-norm. Our main results are improved bounds on the l(0)-norm of sparse solutions to systems Ax = b, where A is an element of E-m x n, b is an element of Z(m) and x is either a general integer vector (lattice case) or a nonnegative integer vector (semigroup case). In the lattice case and certain scenarios of the semigroup case, we give polynomial time algorithms for computing solutions with l(o)-norm satisfying the obtained bounds.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation 1

引用

21st international conference on integer programming and combinatorial optimization (ipco)

作者： Garg, Naveen Kumar, Nikhil Sebo, Andras Indian Inst Technol Delhi Delhi India Univ Grenoble Alpes CNRS Lab G SCOP Grenoble France

ISBN: (数字)9783030457716

ISBN: (纸本)9783030457716;9783030457709

In this paper, we bound the integrality gap and the approximation ratio for maximum plane multiflow problems and deduce bounds on the flow-cut-gap. Planarity means here that the union of the supply and demand graph is planar. We first prove that there exists a multiflow of value at least half of the capacity of a minimum multicut. We then show how to convert any multiflow into a half-integer one of value at least half of the original multiflow. Finally, we round any half-integer multiflow into an integer multiflow, losing again at most half of the value, in polynomial time, achieving a 1/4-approximation algorithm for maximum integer multiflows in the plane, and an integer-flow-cut gap of 8.

关键词： Multicommodity flow Multiflow Multicut Network design Planar graphs Flow-cut Integrality gap Approximation algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：