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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

705 篇 会议
21 篇 期刊文献
17 册 图书

馆藏范围

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

日期分布

学科分类号

539 篇 工学
- 460 篇 计算机科学与技术...
- 123 篇 软件工程
- 84 篇 电气工程
- 44 篇 信息与通信工程
- 39 篇 控制科学与工程
- 13 篇 机械工程
- 9 篇 生物工程
- 8 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 交通运输工程
- 6 篇 环境科学与工程（可...
- 5 篇 仪器科学与技术
- 5 篇 冶金工程
- 5 篇 安全科学与工程
- 4 篇 光学工程
- 4 篇 动力工程及工程热...
- 4 篇 水利工程
- 4 篇 石油与天然气工程
341 篇 理学
- 322 篇 数学
- 43 篇 系统科学
- 14 篇 生物学
- 12 篇 物理学
- 11 篇 统计学（可授理学、...
- 4 篇 化学
165 篇 管理学
- 158 篇 管理科学与工程(可...
- 44 篇 工商管理
18 篇 经济学
- 16 篇 应用经济学
6 篇 医学
- 4 篇 基础医学(可授医学...
- 4 篇 临床医学
4 篇 法学
- 4 篇 社会学
2 篇 教育学
2 篇 文学
2 篇 农学

主题

195 篇 integer programm...
88 篇 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

语言

734 篇 英文
5 篇 其他
4 篇 中文

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

共 743 条记录，以下是271-280 订阅

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

详细简洁

排序：

An Improved Deterministic Rescaling for Linear programming Algorithms 19th

An Improved Deterministic Rescaling for Linear Programming A...

引用

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

作者： Hoberg, Rebecca Rothvoss, thomas Univ Washington Seattle WA 98105 USA

ISBN: (纸本)9783319592503;9783319592497

the perceptron algorithm for linear programming, arising from machine learning, has been around since the 1950s. While not a polynomial-time algorithm, it is useful in practice due to its simplicity and robustness. In 2004, Dunagan and Vempala showed that a randomized rescaling turns the perceptron method into a polynomial time algorithm, and later Pena and Soheili gave a deterministic rescaling. In this paper, we give a deterministic rescaling for the perceptron algorithm that improves upon the previous rescaling methods by making it possible to rescale much earlier. this results in a faster running time for the rescaled perceptron algorithm. We will also demonstrate that the same rescaling methods yield a polynomial time algorithm based on the multiplicative weights update method. this draws a connection to an area that has received a lot of recent attention in theoretical computer science.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Mixed-integer Linear Representability, Disjunctions, and Variable Elimination 1

引用

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

作者： Basu, Amitabh Martin, Kipp Ryan, Christopher thomas Wang, Guanyi Johns Hopkins Univ Dept Appl Math & Stat Baltimore MD 21218 USA Univ Chicago Booth Sch Business Chicago IL 60637 USA Georgia Inst Technol Ind & Syst Engn Atlanta GA 30332 USA

ISBN: (数字)9783319592503

ISBN: (纸本)9783319592503;9783319592497

Jeroslow and Lowe gave an exact geometric characterization of subsets of R-n that are projections of mixed-integer linear sets, a.k.a MILP-representable sets. We give an alternate algebraic characterization by showing that a set is MILP-representable if and only if the set can be described as the intersection of finitely many affine Chvatal inequalities. these inequalities are a modification of a concept introduced by Blair and Jeroslow. this gives a sequential variable elimination scheme that, when applied to the MILP representation of a set, explicitly gives the affine Chvatal inequalities characterizing the set. this is related to the elimination scheme of Wiliams and Williams-Hooker, who describe projections of integer sets using disjunctions of affine Chvatal systems. Our scheme extends their work in two ways. First, we show that disjunctions are unnecessary, by showing how to find the affine Chvatal inequalities that cannot be discovered by the Williams-Hooker scheme. Second, disjunctions of Chvatal systems can give sets that are not projections of mixed-integer linear sets;so the Williams-Hooker approach does not give an exact characterization of MILP representability.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

A mathematical programming- and simulation-based framework to evaluate cyberinfrastructure design choices 13

A mathematical programming- and simulation-based framework t...

引用

13th Annual IEEE international conference on e-Science (e-Science)

作者： Liu, Zhengchun Kettimuthu, Rajkumar Leyffer, Sven Palkar, Prashant Foster, Ian Argonne Natl Lab Math & Comp Sci Div 9700 Cass Ave Lemont IL 60439 USA Indian Inst Technol Ind Engn & Operat Res Bombay 400076 Maharashtra India Univ Chicago Dept Comp Sci Chicago IL 60637 USA

ISBN: (纸本)9781538626863

Modern scientific experimental facilities such as xray light sources increasingly require on-demand access to large-scale computing for data analysis, for example to detect experimental errors or to select the next experiment. As the number of such facilities, the number of instruments at each facility, and the scale of computational demands all grow, the question arises as to how to meet these demands most efficiently and cost-effectively. A single computer per instrument is unlikely to be cost-effective because of low utilization and high operating costs. A single national compute facility, on the other hand, introduces a single point of failure and perhaps excessive communication costs. We introduce here methods for evaluating these and other potential design points, such as per-facility computer systems and a distributed multisite "superfacility." We use the U.S. Department of Energy light sources as a use case and build a mixed-integer programming model and a customizable superfacility simulator to enable joint optimization of design choices and associated operational decisions. the methodology and tools provide new insights into design choices for on-demand computing facilities for real-time analysis of scientific experiment data. the simulator can also be used to support facility operations, for example by simulating the impact of events such as outages.

关键词： Mathematical model Light sources Computational modeling Real-time systems Detectors Mathematical programming

来源：评论

学校读者我要写书评

暂无评论

A dynamical constraint-generating algorithm for the Single-Vehicle Cyclic Inventory-Routing Problem

A dynamical constraint-generating algorithm for the Single-V...

引用

16th IFAC Symposium on Information Control Problems in Manufacturing (INCOM)

作者： Lefever, Wouter Aghezzaf, El-Houssaine Hadj-Hamou, Khaled Univ Ghent Dept Ind Syst Engn & Prod Design Technol Pk 903 B-9052 Zwijnaarde Belgium Univ Lyon INSA Lyon DISP F-69621 Villeurbanne France

the Single-Vehicle Cyclic Inventory-Routing Problem (SVCIRP) is a variant of the Inventory-Routing Problem (IRP) in which the replenishment decisions of a recurring distribution plan are optimized. In this paper, we investigate the current formulation of the SVCIRP and propose a number of improvements for it. First, we introduce a new binary variable in the model to distinguish tours in which only one retailer is visited. Additionally, we formulate three new sets of valid inequalities. Because one of the sets contains an exponential number of inequalities, we develop a procedure to insert only the violated inequalities. We present an algorithm, based on this procedure, to solve the SVCIRP effectively. Our computational results show that our algorithm outperforms the other exact methods in literature. We obtain 25 new best bounds and we find 13 improved solutions. (C) 2018, IFAC (international Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： combinatorial mathematics Mathematical models integer programming Convex optimization Bounding method

来源：评论

学校读者我要写书评

暂无评论

Discrete Newton's Algorithm for Parametric Submodular Function Minimization 1

引用

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

作者： Goemans, Michel X. Gupta, Swati Jaillet, Patrick MIT Cambridge MA 02139 USA

ISBN: (数字)9783319592503

ISBN: (纸本)9783319592503;9783319592497

We consider the line search problem in a submodular polyhedron P(f)subset of R-n : Given an arbitrary a is an element of R-n and x(0) is an element of P(f), compute max{delta : x(0) + delta a is an element of P(f)}. the use of the discrete Newton's algorithm for this line search problem is very natural, but no strongly polynomial bound on its number of iterations was known (Iwata 2008). We solve this open problem by providing a quadratic bound of n(2) + O(n log(2) n) on its number of iterations. Our result considerably improves upon the only other known strongly polynomial time algorithm, which is based on Megiddo's parametric search framework and which requires (O) over bar (n(8)) submodular function minimizations (Nagano 2007). As a by-product of our study, we prove (tight) bounds on the length of chains of ring families and geometrically increasing sequences of sets, which might be of independent interest.

关键词： Discrete Newton's algorithm Submodular functions Line search Ring families Geometrically increasing sequence of sets Fractional combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Downlink Scheduling in LTE: Challenges, Improvement, and Analysis 13

Downlink Scheduling in LTE: Challenges, Improvement, and Ana...

引用

13th international Wireless Communications and Mobile Computing conference (IWCMC)

作者： Kayali, Mohamad Omar Shmeiss, Zeinab Safa, Haidar El-Hajj, Wassim Amer Univ Beirut Dept Comp Sci Beirut Lebanon

ISBN: (纸本)9781509043729

Long Term Evolution (LTE) was developed by 3GPP to cope with the increasing demand for better Quality of service (QoS) and the emergence of bandwidth-consuming multimedia applications. Today's data transmission networks face extreme challenges in providing high data rate and low latency. Scheduling paradigms such as Round Robin, Best Channel Quality Condition and Proportional Fair are commonly adopted in current LTE downlink scheduling algorithms, but they are far from optimal for satisfying latency requirements. In this paper, we first survey the state of the art downlink scheduling algorithms in LTE and identify their main challenges. We then formulate the LTE downlink scheduling problem as an optimization problem in order to meet the flow deadlines, then incorporate the formulation within the surveyed scheduling algorithms, to produce better performance. We consider strict deadlines for different types of packets with the goal of maximizing resource distribution. Additionally, in our formulation the buffer state for each user is taken into consideration in order to minimize the packet loss. We evaluate the proposed formulation using LTE-Sim and study its positive impact on the existing LTE downlink scheduling algorithms;the performance in terms of QoS, packet loss and fairness is improved throughout all evaluations.

关键词： LTE QoS Downlink Scheduling integer Linear programming Buffer State

来源：评论

学校读者我要写书评

暂无评论

An Energy-constrained Makespan optimization Framework in Fine- to Coarse-grain Partitioned Multicore Systems 8

An Energy-constrained Makespan Optimization Framework in Fin...

引用

8th international Green and Sustainable Computing conference (IGSC)

作者： Hajiamini, Shervin Shirazi, Behrooz Cain, Chris Dong, Hongbo Washington State Univ Sch EECS Pullman WA 99164 USA Washington State Univ Dept Math Pullman WA 99164 USA

ISBN: (纸本)9781538634707

In today's multicore systems, depending on an application's computational demand, cores are either operated individually at different Voltage/Frequency (V/F) levels or grouped into multiple Voltage-Frequency Islands (VFIs) to reduce system energy consumption. this paper formulates a task scheduling and VFI partitioning problem whose optimization goal is to minimize the task set (application) execution time (makespan) for a given energy budget. First, the combinatorial optimization problem is formulated with integer Linear programming (ILP) to obtain per-core, per-task dynamic V/F levels in a fine-grain VFI-based system with single-core islands. Next, static task scheduling on coarse-grain VFI-based systems, where an island can contain several cores operated at the same V/F level, is formulated with Mixed integer Linear programming (MILP), considering the energy budget and task set's precedence constraints. the experimental results show that under different energy budget constraints, fine-grain, dynamic task allocations provide on average 1.35x speedup over static coarse grain scheduling and partitioning methods.

关键词： multicore fine/coarse-grain VFIs makespan energy budget ILP MILP

来源：评论

学校读者我要写书评

暂无评论

Optimal Topology Design of High Altitude Platform Based Maritime Broadband Communication Networks 11th

Optimal Topology Design of High Altitude Platform Based Mari...

引用

11th Annual international conference on combinatorial optimization and Applications (COCOA)

作者： Duan, Jianli Zhao, Tiange Lin, Bin Dalian Maritime Univ Dalian 116026 Peoples R China Qingdao Univ Technol Qingdao 266033 Peoples R China

ISBN: (纸本)9783319711508;9783319711492

To satisfy the increasing demand for various types of coastal wireless communication, the pursuit of fully functional and low cost means of maritime broadband communication is imminent. High Altitude Platform (HAP) based maritime communication is a promising solution to improve the quality of coverage on the sea. In this paper, we present Integrated HAP-Sea-Land Network (IHSL) architecture for maritime broadband communication. And then we focus on the problem of Optimal Topology Design (OTD) which is an important issue for the IHSL network deployment in practice. We formulate the OTD problem as a generic integer linear programming (ILP) model with the objective of minimizing the total deployment cost subject to coverage, reliability, and topology constraints of the network. the linear programming solver Gurobi is applied to solve the ILP model. A series of case studies are conducted to validate the optimization framework and demonstrated the solvability and scalability of the ILP model. the simulation results show the significant performance benefits of IHSL in terms of cost and reliability under 1-coverage and 2-coverage. the proposed optimization framework is expected to provide a guideline for the IHSL network deployment in practice.

关键词： High Altitude Platforms (HAP) Maritime broadband communication Topology optimization design (OTD) integer linear programming (ILP)

来源：评论

学校读者我要写书评

暂无评论

Local Guarantees in Graph Cuts and Clustering 1

引用

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

作者： Charikar, Moses Gupta, Neha Schwartz, Roy Stanford Univ Stanford CA 94305 USA Technion IL-3200003 Haifa Israel

ISBN: (数字)9783319592503

ISBN: (纸本)9783319592503;9783319592497

Correlation Clustering is an elegant model that captures fundamental graph cut problems such as Min s - t Cut, Multiway Cut, and Multicut, extensively studied in combinatorial optimization. Here, we are given a graph with edges labeled + or - and the goal is to produce a clustering that agrees with the labels as much as possible: + edges within clusters and - edges across clusters. the classical approach towards Correlation Clustering (and other graph cut problems) is to optimize a global objective. We depart from this and study local objectives: minimizing the maximum number of disagreements for edges incident on a single node, and the analogous max min agreements objective. this naturally gives rise to a family of basic min-max graph cut problems. A prototypical representative is Min Max s-t Cut: find an s-t cut minimizing the largest number of cut edges incident on any node. We present the following results: (1) an O(root n)-approximation for the problem of minimizing the maximum total weight of disagreement edges incident on any node (thus providing the first known approximation for the above family of min-max graph cut problems), (2) a remarkably simple 7-approximation for minimizing local disagreements in complete graphs (improving upon the previous best known approximation of 48), and (3) a 1/(2+epsilon)-approximation for maximizing the minimum total weight of agreement edges incident on any node, hence improving upon the 1/(4+epsilon)-approximation that follows from the study of approximate pure Nash equilibria in cut and party affiliation games.

关键词： Approximation algorithms Graph cuts Correlation clustering Linear programming

来源：评论

学校读者我要写书评

暂无评论

14th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming, CPAIOR 2017

14th International Conference on Integration of Artificial I...

引用

14th international conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming, CPAIOR 2017

ISBN: (纸本)9783319597751

the proceedings contain 32 papers. the special focus in this conference is on Integration of Artificial Intelligence and Operations Research Techniques in Constraint programming. the topics include: Sharpening constraint programming approaches for bit-vector theory;on finding the optimal BDD relaxation;design and implementation of bounded-length sequence variables;debugging unsatisfiable constraint models;learning decision trees with flexible constraints and objectives using integer optimization;minimizing landscape resistance for habitat conservation;a hybrid approach for stator winding design optimization;a distributed optimization method for the geographically distributed data centres problem;explanation-based weighted degree;counting weighted spanning trees to solve constrained minimum spanning tree problems;the weighted arborescence constraint;learning when to use a decomposition;experiments with conflict analysis in mixed integer programming;a first look at picking dual variables for maximizing reduced cost fixing;minimum makespan vehicle routing problem with compatibility constraints;solving the traveling salesman problem with time windows through dynamically generated time-expanded networks;scenario-based learning for stochastic combinatorial optimisation;optimal stock sizing in a cutting stock problem with stochastic demands;rescheduling railway traffic on real time situations using time interval variables;dynamic temporal decoupling and a local search approach for incomplete soft constraint problems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：