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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

28 篇 会议
4 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

25 篇 工学
- 23 篇 计算机科学与技术...
- 5 篇 软件工程
- 2 篇 电气工程
- 1 篇 机械工程
- 1 篇 信息与通信工程
- 1 篇 轻工技术与工程
12 篇 理学
- 12 篇 数学
- 1 篇 系统科学
6 篇 管理学
- 6 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 经济学
- 1 篇 应用经济学

主题

10 篇 integer programm...
5 篇 linear programmi...
5 篇 combinatorial op...
2 篇 optimization
2 篇 congresses.
1 篇 ring families
1 篇 submodular funct...
1 篇 infeasibility
1 篇 approximation al...
1 篇 computational co...
1 篇 voltage frequenc...
1 篇 combinatorial pa...
1 篇 degeneracy
1 篇 engineering opti...
1 篇 correlation clus...
1 篇 discrete newton'...
1 篇 gaifman graph
1 篇 line search
1 篇 computer communi...
1 篇 mixed-integer li...

机构

1 篇 univ chicago boo...
1 篇 university of wa...
1 篇 univ southern ca...
1 篇 department of ma...
1 篇 univ warsaw inst...
1 篇 zuse inst berlin...
1 篇 amazon modeling ...
1 篇 univ padua dipar...
1 篇 univ oxford oxfo...
1 篇 otto von guerick...
1 篇 delft univ techn...
1 篇 bocconi univ mil...
1 篇 washington state...
1 篇 washington univ ...
1 篇 univ kentucky de...
1 篇 oakland univ dep...
1 篇 uhasselt researc...
1 篇 tu berlin fac 4 ...
1 篇 univ bergen dept...
1 篇 linkoping univ d...

作者

2 篇 zadik ilias
2 篇 lubin miles
2 篇 basu amitabh
2 篇 vielma juan pabl...
1 篇 telha claudio
1 篇 ordyniak sebasti...
1 篇 oertel timm
1 篇 pilipczuk michal
1 篇 goemans michel x...
1 篇 rinaldi franca
1 篇 daniel bienstock...
1 篇 pak igor
1 篇 moseley benjamin
1 篇 eiben eduard
1 篇 stadler michael
1 篇 koenemann jochen
1 篇 ganian robert
1 篇 dilkina bistra
1 篇 bert gerards (ed...
1 篇 ryan christopher...

语言

31 篇 英文
2 篇 中文

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

共 33 条记录，以下是21-30 订阅

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

详细简洁

排序：

A multistart local search heuristic for knapsack problem

A multistart local search heuristic for knapsack problem

引用

19th international conference on Industrial Engineering and Engineering Management: Assistive Technology of Industrial Engineering

作者： Lin, Geng Department of Mathematics Minjiang University Fuzhou China

ISBN: (纸本)9783642383908

Knapsack problem is one of classical combinatorial optimization problems, and has a lot of applications. It is known to be NP-hard. In this paper we propose a multistart local search heuristic for solving the knapsack problem. Firstly, knapsack problem is converted into an unconstrained integer programming by penalty method. then an iterative local search method is presented to solve the resulting unconstrained integer programming. the computational results on three benchmarks show that the proposed algorithm can find high quality solutions in an effective manner. © 2013 Springer-Verlag Berlin Heidelberg.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Jump Number of Two-Directional Orthogonal Ray Graphs

引用

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

作者： Soto, Jose A. Telha, Claudio MIT Dept Math Cambridge MA 02139 USA MIT Ctr Operat Res Cambridge MA USA

ISBN: (纸本)9783642208072

We model maximum cross-free matchings and minimum biclique covers of two-directional orthogonal ray graphs (2-dorgs) as maximum independent sets and minimum hitting sets of an associated family of rectangles in the plane, respectively. We then compute the corresponding maximum independent set using linear programming and uncrossing techniques. this procedure motivates an efficient combinatorial algorithm to find a cross-free matching and a biclique cover of the same cardinality, proving the corresponding min-max relation. We connect this min-max relation with thework ofGyori [19], Lubiw[23], and Frank and Jordan [16] on seemingly unrelated problems. Our result can be seen as a non-trivial application of Frank and Jord ' an's theorem. As a direct consequence, we obtain the first polynomial algorithm for the jump number problem on 2-dorgs. For the subclass of convex graphs, our approach is a vast improvement over previous algorithms. Additionally, we prove that the weighted maximum cross-free matching problem is NP-complete for 2-dorgs and give polynomial algorithms for some subclasses.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

A submodular optimization problem with side constraints 5th

A submodular optimization problem with side constraints

引用

5th international conference integer programming and combinatorial optimization, ipco 1996

作者： Hartvigsen, David Department of Management College of Business Administration University of Notre Dame Notre DameIN46556-0399 United States

ISBN: (纸本)3540613102

In this paper we consider the general problem of optimizing over the intersection of a submodular base polyhedron and an affine space. An example is the following flow problem defined on a capacitated network: we wish to send a commodity from locations in a producing country to locations in a number of client countries so as to simultaneously maximize profits and send to each client country a prescribed proportion of the total sent. We present an algorithm for the general problem and analyze its complexity. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Computers

来源：评论

学校读者我要写书评

暂无评论

Optimal Sizing and Placement of Distributed Generation: MILP vs PSO Comparison in a Real Microgrid Application 19

Optimal Sizing and Placement of Distributed Generation: MILP...

引用

19th international conference on Intelligent System Application to Power Systems (ISAP)

作者： Heleno, Miguel Mashayekh, Salman Stadler, Michael Cardoso, Goncalo De Luis, Rodrigo Ernest Orlando Lawrence Berkeley Natl Lab Berkeley CA 94720 USA Delft Univ Technol Delft Netherlands Univ Pontificia Comillas Madrid Spain

this paper provides a practical comparison between Mixed integer Linear programming and Particle Swarm optimization when applied to the Optimal Sizing and Placement of Distributed Generation in Microgrids. the two for... 详细信息

ISBN: (纸本)9781509040001

关键词： optimization Distributed Generation Planning MILP PSO

来源：评论

学校读者我要写书评

暂无评论

Optimal Energy-Aware Scheduling in VFI-enabled Multicore Systems 19

Optimal Energy-Aware Scheduling in VFI-enabled Multicore Sys...

引用

19th IEEE international conference on High Performance Computing and Communications (HPCC) / 15th IEEE international conference on Smart City (SmartCity) / 3rd IEEE international conference on Data Science and Systems (DSS)

作者： 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: (纸本)9781538625880

Energy efficiency is considered a challenging problem in modern multicore systems. Partitioning the cores into multiple voltage and frequency islands (VFI) provides a compromise between simple global Dynamic Voltage Frequency Scaling (DVFS) and fine-grain per-core, per-task DVFS. this paper formulates the optimization problem of scheduling tasks statically on multiple VFIs as a Mixed integer Linear programming (MILP) such that for a given energy budget, the program execution time (makespan) is minimized. Our proposed solution consists of two steps. In the first step, we use an integer Linear programming (ILP)-based algorithm, from our previous work, to assign per-core fine-grain dynamic Voltage/Frequency (V/F) levels to each task in a task set (program) to minimize the makespan for a given energy budget. In the second step, which is the focus of this paper, we use the MILP framework to schedule this task set, with the given V/F levels provided in step one, on the islands of a VFI-enabled multicore system to again minimize the makespan subject to (1) the energy budget and (2) the task set's precedence (dependency) constraints. Together with the solutions obtained by MILP, a round-robin algorithm is used to compare these two methodologies to ILP that provides the best solution. Our experimental results show that across all the benchmarks considered, the MILP-based and round-robin makespan solutions are on average 1.2 and 2.28 times slower than the ILP based makespan solutions, respectively.

关键词： Multicore Voltage Frequency Islands Mixed integer Linear programming Makespan Energy budget

来源：评论

学校读者我要写书评

暂无评论

Pseudo-polynomial Time Algorithms for Producing Cardinality Constrained Packages by Multi-head Weighers 10

Pseudo-polynomial Time Algorithms for Producing Cardinality ...

引用

Joint 10th international conference on Soft Computing and Intelligent Systems (SCIS) / 19th international Symposium on Advanced Intelligent Systems (ISIS)

作者： Karuno, Yoshiyuki Nakahama, Oki Kyoto Inst Technol Fac Mech Engn Kyoto Japan Kyoto Inst Technol Grad Sch Sci & Technol Kyoto Japan

ISBN: (纸本)9781538626337

A subset selection problem from a finite set of items is considered, where a constraint is imposed on the cardinality of a selected subset. the subset selection problem is motivated by automated packaging systems, so-called multi-head weighers. Given a set of n items with their integral weights, a positive integer target weight t and a positive integer k, the subset selection problem asks to find a subset of the items so that the total weight of chosen items is no less than the target weight, and the number of the chosen items is exactly k, and further the total weight of them is as close to the target weight as possible. In this paper, an O(knt) time algorithm is presented to solve the subset selection problem. Numerical experiments are also conducted to demonstrate the performance of the pseudo-polynomial time algorithm on certain test instances having a feasible solution, and the results are reported.

关键词： engineering optimization combinatorial packing operation subset selection dynamic programming pseudo-polynomial time algorithms

来源：评论

学校读者我要写书评

暂无评论

integer programming and combinatorial optimization 2005

引用

丛书名： Lecture Notes in Computer Science

2005年

作者： Michael Jünger Volker Kaibel

来源：评论

学校读者我要写书评

暂无评论

Co-optimizing Core Allocation, Mapping and DVFS in Streaming Programs with Moldable Tasks for Energy Efficient Execution on Manycore Architectures 19

Co-optimizing Core Allocation, Mapping and DVFS in Streaming...

引用

19th international conference on Application of Concurrency to System Design (ACSD)

作者： Melot, Nicolas Kessler, Christoph Eitschberger, Patrick Keller, Joerg Linkoping Univ Dept Comp & Informat Sci IDA Linkoping Sweden Fernuniv Fac Math & Comp Sci Hagen Germany

ISBN: (纸本)9781728138435

Stream programming abstracts parallelism complexity by modeling a program as a set of streaming tasks. Tasks run repeatedly and can even be internally parallel, i.e., use one or multiple cores simultaneously (moldable). the throughput of the streaming application, as well as its energy consumption, depends strongly on scheduling, i.e., on how tasks are mapped to cores, and on the frequency at which they run. Crown scheduling is a scheduling method that reduces this problem's combinatorial complexity considerably by introducing a few additional restrictions especially on tasks' core allocation sizes and mapping. While it has previously been shown to outperform competing methods, the impact of these restrictions on the schedule quality has, up to now, never been analyzed quantitatively. In this paper, we first propose several crown scheduler improvements toward fewer restrictions. Also, we provide an integer Linear programming formulation that solves the same optimization problem without the inherent restrictions of crown scheduling. While in an extreme case an unrestricted schedule might use 3.7 times less energy than a crown schedule for a realistic execution platform model, we show that in practical benchmarks the difference is small while crown schedulers are significantly faster than unrestricted scheduling. We experimentally confirm this with benchmarks derived from random task collections, classic parallel algorithms as well as the Streamit benchmark suite.

关键词： scheduling energy many-core optimization scaling

来源：评论

学校读者我要写书评

暂无评论

19th international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research, CPAIOR 2022

19th International Conference on the Integration of Constrai...

引用

19th international conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research, CPAIOR 2022

ISBN: (纸本)9783031080104

the proceedings contain 28 papers. the special focus in this conference is on Integration of Constraint programming, Artificial Intelligence, and Operations Research. the topics include: Solving the Extended Job Shop Scheduling Problem with AGVs – Classical and Quantum Approaches;stochastic Decision Diagrams;Improving the Robustness of EPS to Solve the TSP;Efficient Operations Between MDDs and Constraints;deep Policy Dynamic programming for Vehicle Routing Problems;learning a Propagation Complete Formula;a FastMap-Based Algorithm for Block Modeling;packing by Scheduling: Using Constraint programming to Solve a Complex 2D Cutting Stock Problem;dealing with the Product Constraint;multiple-choice Knapsack Constraint in Graphical Models;A SAT Encoding to Compute Aperiodic Tiling Rhythmic Canons;a Learning Large Neighborhood Search for the Staff Rerostering Problem;a MinCumulative Resource Constraint;practically Uniform Solution Sampling in Constraint programming;training thinner and Deeper Neural Networks: Jumpstart Regularization;hybrid Offline/Online optimization for Energy Management via Reinforcement Learning;enumerated Types and Type Extensions for MiniZinc;A Parallel Algorithm for GAC Filtering of the Alldifferent Constraint;analyzing the Reachability Problem in Choice Networks;model-Based Approaches to Multi-attribute Diverse Matching;Transferring Information Across Restarts in MIP;towards Copeland optimization in combinatorial Problems;Coupling Different integer Encodings for SAT;model-Based Algorithm Configuration with Adaptive Capping and Prior Distributions;shattering Inequalities for Learning Optimal Decision Trees;learning Pseudo-Backdoors for Mixed integer Programs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reducing workload imbalance in parallel zone order picking systems 19th

Reducing workload imbalance in parallel zone order picking s...

引用

19th international conference on Harbor, Maritime and Multimodal Logistics Modeling and Simulation, HMS 2017

作者： Vanheusden, Sarah Van Gils, Teun Ramaekers, Katrien Caris, An UHasselt Research Group Logistics Agoralaan Diepenbeek3590 Belgium

ISBN: (纸本)9781510847675

To stay competitive and preserve high service levels for their customers, the focus of warehouses in today's supply chain is on timely and faster delivery of smaller and more frequent orders. To keep up with competitors, companies accept late orders from customers, which results in additional pressure for order picking operations. Specifically, more orders need to be picked and sorted in shorter and more flexible time windows, which often results in workload peaks during the day. the objective of this study is to balance the workload across the day in parallel zone order picking systems. A real-life case-study demonstrates the value of balancing the workload for European order lines in a large international warehouse system located in Belgium, engaged in the distribution of spare parts. Solving the operational workload imbalance problem results in a more stable order picking process and overall productivity improvements for the total warehouse operations.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：