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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是241-250 订阅

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

详细简洁

排序：

Isolation Branching: A Branch and Bound Algorithm for the k-Terminal Cut Problem 12th

Isolation Branching: A Branch and Bound Algorithm for the k-...

引用

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

作者： Velednitsky, Mark Hochbaum, Dorit S. Univ Calif Berkeley Berkeley CA 94720 USA

ISBN: (纸本)9783030046514;9783030046507

In the k-terminal cut problem, we are given a graph with edge weights and k distinct vertices called "terminals." the goal is to remove a minimum weight collection of edges from the graph such that there is no path between any pair of terminals. the k-terminal cut problem is NP-hard. the k-terminal cut problem has been extensively studied and a number of algorithms have been devised for it. Most of the algorithms devised for the problem are approximation algorithms or heuristic algorithms. there are also fixed-parameter tractable algorithms that solve the problem optimally in time that is polynomial when the value of the optimum is fixed, but none have been shown empirically practical. It is possible to apply implicit enumeration using any integer programming formulation of the problem and solve it with a branch-and-bound algorithm. Here, we present a branch-and-bound algorithm for the k-terminal cut problem which does not rely on an integer programming formulation. Our algorithm employs "isolating cuts" and, for this reason, we call our branch-and-bound algorithm Isolation Branching. In an empirical experiment, we compare the performance of the Isolation Branching algorithm to that of a branch-and-bound applied to the strongest known integer programming formulation of k-terminal cut. the integer programming branch-and-bound procedure is implemented with Gurobi, a commercial mixed-integer programming solver. We compare the performance of the two approaches for real-world instances and synthetic data. the results on real data indicate that Isolation Branching, coded in Python, runs an order of magnitude faster than Gurobi for problems of sizes of up to tens of thousands of vertices and hundreds of thousands of edges. Our results on synthetic data also indicate that Isolation Branching scales more effectively. though we primarily focus on creating a practical tool for k-terminal cut, as a byproduct of our algorithm we prove that the complexity of Isolation Branching i

关键词： k-terminal cut optimization Branch-and-bound Isolating cut Clustering

来源：评论

学校读者我要写书评

暂无评论

A Comparison of optimization Methods for Multi-objective Constrained Bin Packing Problems 15th

引用

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

作者： Olivier, Philippe Lodi, Andrea Pesant, Gilles Ecole Polytech Montreal Montreal PQ Canada CERC Montreal PQ Canada

ISBN: (纸本)9783319930312;9783319930305

Despite the existence of efficient solution methods for bin packing problems, in practice these seldom occur in such a pure form but feature instead various considerations such as pairwise conflicts or profits between items, or aiming for balanced loads amongst the bins. the Wedding Seating Problem is a combinatorial optimization problem incorporating elements of bin packing with conflicts, bin packing with profits, and load balancing. We use this representative problem to present and compare constraint programming, integer programming, and met aheuristic approaches.

关键词： Profitability

来源：评论

学校读者我要写书评

暂无评论

Discrete optimization Model for Vehicle Routing Problem with Scheduling Side Cosntraints 4

Discrete Optimization Model for Vehicle Routing Problem with...

引用

4th international conference on Operational Research (InteriOR)

作者： Juliandri, Dedy Mawengkang, Herman Bu'ulolo, F. Univ Sumatera Utara Grad Sch Math Medan Indonesia Univ Sumatera Utara Dept Math Medan Indonesia

Vehicle Routing Problem (VRP) is an important element of many logistic systems which involve routing and scheduling of vehicles from a depot to a set of customers node. this is a hard combinatorial optimization problem with the objective to find an optimal set of routes used by a fleet of vehicles to serve the demands a set of customers It is required that these vehicles return to the depot after serving customers' demand. the problem incorporates time windows, fleet and driver scheduling, pick-up and delivery in the planning horizon. the goal is to determine the scheduling of fleet and driver and routing policies of the vehicles. the objective is to minimize the overall costs of all routes over the planning horizon. We model the problem as a linear mixed integer program. We develop a combination of heuristics and exact method for solving the model.

关键词： integer programming Transportation Scheduling Combined method

来源：评论

学校读者我要写书评

暂无评论

Scheduling for last-mile meal-delivery processes 9

Scheduling for last-mile meal-delivery processes

引用

9th IFAC/IFIP/IFORS/IISE/INFORMS conference on Manufacturing Modelling, Management and Control (IFAC MIM)

作者： Cosmi, Matteo Nicosia, Gaia Pacifici, Andrea Univ Roma Tre Dipartimento Ingn Via Vasca Navale 79 I-00146 Rome Italy Univ Roma Tor Vergata Dipartimento Ingn Civile & Ingn Informat Via Politecn 1 I-00133 Rome Italy

We address a single machine scheduling problem arising in a last mile delivery setting for a food company. the same problem finds obvious applications also in the context of internal manufacturing logistics. A set of food orders are placed by the customers and are to be fulfilled by the company. Each order comprises a delivery point and an ideal delivery time An order is considered on time if it is delivered within a certain given time interval around the ideal delivery time. All food is prepared in a single production facility (restaurant) and immediately carried to the customers by a single courier, who may dispatch one or two different orders in a single trip. Since late deliveries correspond to canceled orders and an economic loss for the company, it is of interest to schedule orders so that the number of late orders is minimized. We model the resulting decision problem as a special single machine scheduling problem and propose different mixed integer programs to solve it. their performance is assessed through a computational study on a set of test instances derived by our real-world application. (C) 2019, IFAC (international Federation of Automatic Control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Scheduling integer programming optimization Problems combinatorial Mathematics Internal Logistics Food Delivery

来源：评论

学校读者我要写书评

暂无评论

A New Approach for Optimal Implementation of Multi-core Reconfigurable Real-time Systems 13

A New Approach for Optimal Implementation of Multi-core Reco...

引用

13th international conference on Evaluation of Novel Approaches to Software Engineering

作者： Lakhdhar, Wafa Mzid, Rania Khalgui, Mohamed Frey, Georg Univ Carthage LISI Lab INSAT INSAT Ctr Urbain Nord BP 676 Tunis Tunisia Univ Tunis El Manar ISI 2 Rue Abourraihan Bayrouni Ariana Tunisia Univ Sfax CES Lab ENIS BP W3 Sfax Tunisia Xidian Univ SystemsControl Lab August Bebel Str 70 Halle Peoples R China Saarland Univ Automat & Energy Syst D-66123 Saarbrucken Germany

ISBN: (纸本)9789897583001

this paper deals with a multi-core reconfigurable real-time system specified with a set of implementations, each of which is raised under a predefined condition and executes multiple functions which are in turns executed by threads. the implementation as threads generates a complex system code. this is due to the huge number of threads and the redundancy between the different implementations which may lead to an increase in the energy consumption. thus we aim in this paper to optimize the system code by avoiding the redundancy between implementations and reducing the number of threads while meeting all related real-time constraints. the proposed approach adopts mixed integer linear programming (MILP) techniques in the exploration phase in order to provide a feasible task model. An optimal reconfigurable POSIX-based code of the system is manually generated as an output of this technique. An application to a case study and performance evaluation confirm and validate the expected results.

关键词： Real-time and Reconfiguration Multi-core POSIX Task and Function MILP and optimization

来源：评论

学校读者我要写书评

暂无评论

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 Bounds on Pebbling Numbers of Cartesian-Product Graphs 12th

Integer-Programming Bounds on Pebbling Numbers of Cartesian-...

引用

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

作者： Kenter, Franklin Skipper, Daphne US Naval Acad Annapolis MD 21402 USA

ISBN: (纸本)9783030046514;9783030046507

Graph pebbling, as introduced by Chung, is a two-player game on a graph G. Player one distributes "pebbles" to vertices and designates a root vertex. Player two attempts to move a pebble to the root vertex via a sequence of pebbling moves, in which two pebbles are removed from one vertex in order to place a single pebble on an adjacent vertex. the pebbling number of a simple graph G is the smallest number pi(G) such that if player one distributes pi(G) pebbles in any configuration, player two can always win. Computing pi(G) is provably difficult, and recent methods for bounding pi(G) have proved computationally intractable, even for moderately sized graphs. Graham conjectured that the pebbling number of the Cartesianproduct of two graphs G and H, denoted G square H, is no greater than pi(G)pi(H). Graham's conjecture has been verified for specific families of graphs;however, in general, the problem remains open. this study combines the focus of developing a computationally tractable method for generating good bounds on pi(G) square (H), with the goal of providing evidence for (or disproving) Graham's conjecture. In particular, we present a novel integer-programming (IP) approach to bounding pi(G) square (H) that results in significantly smaller problem instances compared with existing IP approaches to graph pebbling. Our approach leads to a sizable improvement on the best known bound for pi(L) square (L), where L is the Lemke graph. L square L is among the smallest known potential counterexamples to Graham's conjecture.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Proposed solutions to the tripper car positioning problem 20

Proposed solutions to the tripper car positioning problem

引用

20th international conference on Enterprise Information Systems, ICEIS 2018

作者： Caldas, Felipe Novaes Martins, Alexandre Xavier Gerência de Automação Vale São Gonçalo do Rio Abaixo MG Brazil Instituto de Ciências Exatas e Aplicadas Universidade Federal de Ouro Preto João Monlevade MG Brazil

ISBN: (纸本)9789897582981

the trippers are equipments often found in mineral processing plants. their role is to distribute ore coming from past stages of process in a silo with several hoppers. Positioning trippers is a scheduling problem defined by position determination of the equipment through the bins and along time. the system silo-tripper was modeled as a combinatorial linear optimization program aiming to get the optimal tripper positioning. Two paradigms were used to find out an exact solution: mixed integer linear programming and dynamic programming. Copyright © 2018 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Joint Dynamic User Pairing, Computation Offloading and Power Control for NOMA-based MEC System

Joint Dynamic User Pairing, Computation Offloading and Power...

引用

international conference on Wireless Communications and Signal Processing (WCSP)

作者： Jingui Li Fan Wu Ke Zhang Supeng Leng School of Information and Communication Engineering University of Electronic and Science Technology of China Chengdu China

To tackle the massive access and different computation offloading requirements of IoT devices in 5G MEC system, Dynamic User Pairing NOMA-based offloading is considered in this paper. An overall energy consumption minimization framework is established by joint optimizing user pairing, of-floading decision and uplink power control under the time and maximum multiplexing number of user constraints. Due to the combinatorial nature of the formulated mixed integer non-linear programming problem, we adapt two-phase approach to solve the challenging problem. First, a low-complexity heuristic algorithm is designed to solve the user pairing problem. After we get the sub-optimal user pairing scheme, the original problem is proved to be a convex problem, we then get the optimal offloading decision and transmission power of devices. Numerical results show that the proposed DUP NOMA-based offloading scheme can significantly improve system performance in terms of energy consumption comparing to OMA and Fixed User Pairing NOMA based offloading.

关键词： NOMA Energy consumption Task analysis Resource management Servers Schedules optimization

来源：评论

学校读者我要写书评

暂无评论

Algorithm Configuration Landscapes: More Benign than Expected? 15th

Algorithm Configuration Landscapes: More Benign Than Expecte...

引用

15th international conference on Parallel Problem Solving from Nature (PPSN)

作者： Pushak, Yasha Hoos, Holger Univ British Columbia Dept Comp Sci Vancouver BC Canada Leiden Univ LIACS Leiden Netherlands

ISBN: (纸本)9783319992594;9783319992587

Automated algorithm configuration procedures make use of powerful meta-heuristics to determine parameter settings that often substantially improve the performance of highly heuristic, state-of-the-art algorithms for prominent NP-hard problems, such as the TSP, SAT and mixed integer programming (MIP). these meta-heuristics were originally designed for combinatorial optimization problems with vast and challenging search landscapes. their use in automated algorithm configuration implies that algorithm configuration landscapes are assumed to be similarly complex;however, to the best of our knowledge no work has been done to support or reject this hypothesis. We address this gap by investigating the response of varying individual numerical parameters while fixing the remaining parameters at optimized values. We present evidence that most parameters exhibit uni-modal and often even convex responses, indicating that algorithm configuration landscapes are likely much more benign than previously believed.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：