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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

219 篇 会议
7 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

153 篇 工学
- 139 篇 计算机科学与技术...
- 22 篇 软件工程
- 18 篇 电气工程
- 11 篇 信息与通信工程
- 2 篇 机械工程
- 2 篇 控制科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 土木工程
- 1 篇 化学工程与技术
- 1 篇 交通运输工程
- 1 篇 农业工程
- 1 篇 生物工程
- 1 篇 安全科学与工程
138 篇 理学
- 137 篇 数学
- 10 篇 系统科学
- 3 篇 物理学
- 2 篇 统计学（可授理学、...
- 1 篇 化学
- 1 篇 生物学
28 篇 管理学
- 25 篇 管理科学与工程(可...
- 14 篇 工商管理
8 篇 经济学
- 8 篇 应用经济学
- 1 篇 理论经济学
2 篇 法学
- 2 篇 社会学
1 篇 农学
- 1 篇 作物学

主题

66 篇 integer programm...
32 篇 linear programmi...
23 篇 combinatorial op...
10 篇 approximation al...
6 篇 semidefinite pro...
5 篇 graph theory
5 篇 cutting planes
4 篇 mixed-integer pr...
4 篇 optimization
4 篇 combinatorial ma...
4 篇 dynamic programm...
4 篇 cost functions
3 篇 integer programs
2 篇 assortment optim...
2 篇 stable set
2 篇 mixed integer no...
2 篇 computational co...
2 篇 maximum coverage...
2 篇 polynomial appro...
2 篇 energy consumpti...

机构

5 篇 department of co...
4 篇 department of co...
3 篇 univ bologna dei...
3 篇 school of indust...
3 篇 mit 77 massachus...
3 篇 georgia inst tec...
2 篇 london sch econ ...
2 篇 columbia univ gr...
2 篇 cwi
2 篇 rhein westfal th...
2 篇 school of indust...
2 篇 carnegie mellon ...
2 篇 shandong normal ...
2 篇 univ twente dept...
2 篇 univ british col...
2 篇 max planck inst ...
2 篇 mit cambridge ma...
2 篇 isi institute me...
2 篇 univ padua dei i...
2 篇 zuse inst berlin

作者

7 篇 nemhauser george...
5 篇 woeginger gerhar...
5 篇 cornuéjols gérar...
5 篇 basu amitabh
4 篇 munoz gonzalo
4 篇 lodi andrea
4 篇 kaibel volker
4 篇 dey santanu s.
4 篇 fischetti matteo
4 篇 guenin bertrand
4 篇 paat joseph
3 篇 oertel timm
3 篇 li yanjun
3 篇 aliev iskander
3 篇 monaci michele
3 篇 weltge stefan
3 篇 weismantel rober...
3 篇 dadush daniel
3 篇 vielma juan pabl...
3 篇 burkard rainer e...

语言

228 篇 英文
3 篇 中文

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

共 231 条记录，以下是41-50 订阅

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

详细简洁

排序：

Latency-Constrained Task Distribution in Multi-Access Edge Computing Systems 11

Latency-Constrained Task Distribution in Multi-Access Edge C...

引用

11th IEEE international conference on Cloud Networking (CloudNet)

作者： Ricardo, Guilherme Iecker Benhamiche, Amal Perrot, Nancy Carlinet, Yannick Orange Labs Chatillon France

ISBN: (数字)9781665486279

ISBN: (纸本)9781665486279

Multi-Access Edge Computing (MEC) paradigm has been widely studied as a potential solution to cope with the challenges emerging from new generations of mobile networks. By processing applications' data closer to the users, service providers are able to offload origin servers and their underlying network infrastructure, which consequently reduces users' experienced latency. In this paper, we consider internet-based applications with strict latency tolerance which are primarily enabled by the MEC architecture, e.g., Virtual Reality (VR) control systems, cloud gaming, and smart healthcare. Moreover, nodes at the edge may host application-related tasks as well as assist in their provision. We introduce the Task Distribution (TD) problem, where the objective is to maximize the overall Quality of Service (QoS) while ensuring that tasks' latency requirements are satisfied. the TD problem is modeled as an integer programming problem, taking into account three components: (i) tasks' priority assignment, (ii) placement and (iii) routing through the MEC network. We propose to approach the TD problem through an approximation scheme, called Shortest-Flow Approximation (SFA), which considers pre-determined network flows selected according to a Betweenness-based criterion. In our experiments, we first extract useful insights on the TD problem that help characterize its solution. then, we evaluate SFA's performance empirically across different experimental settings, showing numerical results confirming its proximity to the optimal solution.

关键词： Edge Computing Resource Allocation Quality of Service Operations Research combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A New Approach to Finding 2 x n Partially Spatially Balanced Latin Rectangles 29

A New Approach to Finding 2 x n Partially Spatially Balanced...

引用

29th international conference on Principles and Practice of Constraint programming, CP 2023

作者： Mirka, Renee Greenstreet, Laura Grimson, Marc Gomes, Carla P. Cornell University IthacaNY United States

ISBN: (纸本)9783959773003

Partially spatially balanced Latin rectangles are combinatorial structures that are important for experimental design. However, it is computationally challenging to find even small optimally balanced rectangles, where previous work has not been able to prove optimality for any rectangle with a dimension above size 11. Here we introduce a graph-based encoding for the 2 × n case based on finding the minimum-cost clique of size n. this encoding inspires a new mixed-integer programming (MIP) formulation, which finds exact solutions for the 2 × 12 and 2 × 13 cases and provides improved bounds up to n = 20. Compared to three other methods, the new formulation establishes the best lower bound in all cases and establishes the best upper bound in five out of seven cases. © Renee Mirka, Laura Greenstreet, Marc Grimson, and Carla P. Gomes.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Beyond Optimal Solutions for Real-World Problems 29

Beyond Optimal Solutions for Real-World Problems

引用

29th international conference on Principles and Practice of Constraint programming, CP 2023

作者： de la Banda, Maria Garcia Department of Data Science and AI Faculty of IT Monash University ClaytonVIC Australia ARC Industrial Training and Transformation Centre OPTIMA CarltonVIC Australia

ISBN: (纸本)9783959773003

combinatorial optimisation technology has come a long way. We now have mature high-level modelling languages in which to specify a model of the particular problem of interest [18, 7, 24, 6];robust complete solvers in each major constraint paradigm, including Constraint programming (CP) [1, 19], MaxSAT [5, 11], and Mixed integer programming (MIP) [2, 3];effective incomplete search techniques that can easily be combined with complete solvers to speed up the search such as Large Neighbourhood Search [23];and enough general knowledge about modelling techniques to understand the need for our models to incorporate components such as global constraints [25], symmetry constraints [8], and more. All this has significantly reduced the amount of knowledge required to apply this technology successfully to the many different combinatorial optimisation problems that permeate our society. And yet, not many organisations use such advanced optimisation technology;instead, they often rely on the solutions provided by problem-specific algorithms that are implemented in traditional imperative languages and lack any of the above advances. Further, while advanced optimisation technology is particularly suitable for the kind of complex human-in-the-loop decision-making problems that occur in critical sectors of our society, including health, transport, energy, disaster management, environment and finance, these decisions are often still made by people with little or no technological support. In this extended abstract I argue that to change this state of affairs, our research focus needs to change from improving the technology on its own, to improving it so that users can better trust, use, and maintain the optimisation systems that we develop with it. the rest of this extended abstract discusses my personal experiences and opinion on these three points. © Maria Garcia de la Banda.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

18th international conference on integer programming and combinatorial optimization, ipco 2016

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

引用

18th international conference on integer programming and combinatorial optimization, ipco 2016

ISBN: (纸本)9783319334608

the proceedings contain 33 papers. the special focus in this conference is on integer programming and combinatorial optimization. the topics include: On approximation algorithms for concave mixed-integer quadratic programming;a link between optimization and convex geometry;rescaled coordinate descent methods for linear programming;approximating min-cost chain-constrained spanning trees;max-cut under graph constraints;sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem;intersection cuts for bilevel optimization;exact algorithms for the chance-constrained vehicle routing problem;extended formulations in mixed-integer convex programming;popular edges and dominant matchings;semidefinite and linear programming integrality gaps for scheduling identical machines;stabilizing network bargaining games by blocking players;round-robin tournaments generated by the circle method have maximum carry-over;extreme functions with an arbitrary number of slopes;minimal cut-generating functions are nearly extreme;on the mixed binary representability of ellipsoidal regions;constant factor approximation for ATSP with two edge weights;improved approximation algorithms for hitting 3-vertex paths;improved approximations for cubic bipartite and cubic TSP;valid inequalities for separable concave constraints with indicator variables;a polyhedral approach to online bipartite matching;robust monotone submodular function maximization;maximizing monotone submodular functions over the integer lattice;submodular unsplittable flow on trees;strong reductions for extended formulations;sum-of-squares hierarchy lower bounds for symmetric formulations;approximation-friendly discrepancy rounding and on the quantile cut closure of chance-constrained problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Continuous Facility Location on Graphs 1

引用

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

作者： Hartmann, Tim A. Lendl, Stefan Woeginger, Gerhard J. Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany Graz Univ Technol Dept Math Graz Austria

ISBN: (数字)9783030457716

ISBN: (纸本)9783030457716;9783030457709

We study a continuous facility location problem on undirected graphs where all edges have unit length and where the facilities may be positioned at the vertices as well as at interior points of the edges. the goal is to cover the entire graph with a minimum number of facilities with covering range (delta > 0. In other words, we want to position as few facilities as possible subject to the condition that every point on every edge is at distance at most delta from one of these facilities. We investigate this covering problem in terms of the rational parameter delta. We prove that the problem is polynomially solvable whenever delta is a unit fraction, and that the problem is NP-hard for all non unit fractions delta. We also analyze the parametrized complexity with the solution size as parameter: the resulting problem is fixed parameter tractable for all delta < 3/2, and it is W[2]-hard for all delta >= 3/2.

关键词： Location theory Graph theory Parametrized complexity

来源：评论

学校读者我要写书评

暂无评论

Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time 20th

Computing the Nucleolus of Weighted Cooperative Matching Gam...

引用

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

作者： Konemann, Jochen Pashkovich, Kanstantsin Toth, Justin Univ Waterloo Waterloo ON N2L 3G1 Canada Univ Ottawa Ottawa ON K1N 6N5 Canada

We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. this resolves a long-standing open question posed in [Faigle, Kern, Fekete, Hochstattler, Mathemat... 详细信息

ISBN: (纸本)9783030179533;9783030179526

关键词： combinatorial optimization Algorithmic game theory Matchings

来源：评论

学校读者我要写书评

暂无评论

An Approximate Solution of a GNSS Satellite Selection Problem Using Semidefinite programming 1

引用

10th international conference on optimization and Applications (OPTIMA)

作者： Rapoport, Lev Tormagov, Timofey Russian Acad Sci VA Trapeznikov Inst Control Sci Moscow Russia Moscow Inst Phys & Technol Dolgoprudnyi Moscow Region Russia

ISBN: (数字)9783030386030

ISBN: (纸本)9783030386030;9783030386023

When processing multiple navigation satellite systems, including GPS, GLONASS, Galileo, Beidou, QZSS, the overall number of the pseudorange and carrier phase signals can exceed several tens. On the other hand, a much smaller number of them is usually sufficient to achieve necessary precision of positioning. Also, some parts of precise positioning algorithms, like carrier phase ambiguity resolution, are very sensitive to the problem dimension as they include the integer search. To reduce computational cost of positioning, the optimal choice of signals involved in computations should be performed. optimization is constrained by a given number of satellite signals to be chosen for processing. this optimization problem falls into the class of binary optimization problems which are hard for precise solution. In this paper, we present approaches to an approximate solution of the optimal selection problem. After the linear relaxation of binary constraints, the relaxed problem is convex and can be transformed to semidefinite programming or second-order cone programming problems. the optimal solution of the relaxed problem can be considered as a lower bound of a combinatorial optimization problem. After rounding non-integer variables the approximate solution is obtained. As a result, two-sided bounds of the optimum are obtained. In practice, the approximate solution is very close to precise solution for most real world cases. Because the relaxed problem is convex, it can be solved efficiently.

关键词： GNSS navigation Second-order cone programming Semidefinite programming Satellite selection GDOP

来源：评论

学校读者我要写书评

暂无评论

Identically Self-blocking Clutters 1

引用

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

作者： Abdi, Ahmad Cornuejols, Gerard Lee, Dabeen Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA

A clutter is identically self-blocking if it is equal to its blocker. We prove that every identically self-blocking clutter different from {{a}} is nonideal. Our proofs borrow tools from Gauge Duality and Quadratic Pr... 详细信息

ISBN: (数字)9783030179533

ISBN: (纸本)9783030179533;9783030179526

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：