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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

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

主题

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

语言

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

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

共 741 条记录，以下是701-710 订阅

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

详细简洁

排序：

Performance Comparison of Unbounded Knapsack Problem Formulations 7

Performance Comparison of Unbounded Knapsack Problem Formula...

引用

7th international conference on Computational Linguistics and Intelligent Systems. Volume III: Intelligent Systems Workshop, CoLInS 2023

作者： Pichugina, Oksana Matsiy, Olha Skob, Yuriy University of Toronto 27 King's College Circle TorontoM5S 1A1 Canada National Aerospace University "Kharkiv Aviation Institute" 17 Chkalova Street Kharkiv61070 Ukraine V. N. Karazin Kharkiv National University 4 Svobody Sq. Kharkiv61022 Ukraine

this study investigates various linear discrete formulations of the unbounded knapsack problem, including binary and bounded forms. Two variations of binary knapsack problem reformulations are examined, each with distinct linear constraints. Gurobi and CPLEX solvers are used to compare the performance of these models. the computational experiments are conducted on randomly generated instances of sizes 10-100. the results revealed that, on average, Gurobi was 20% faster than CPLEX. integer, bounded, and 0/1 knapsack problem formulations had comparable mean run times. Incorporating specific constraints in the 0/1 formulation yielded superior results compared to the basic 0/1 knapsack problem model. Overall, this research contributes to understanding efficient and effective formulations for solving the unbounded knapsack problem and choosing a better solver. © 2023 Copyright for this paper by its authors.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

An improved ACO algorithm for the bin packing problem with conflicts based on graph coloring model

An improved ACO algorithm for the bin packing problem with c...

引用

international conference on Management Science and Engineering (ICMSE)

作者： Ye Yuan Yi-jun Li Yan-qing Wang School of Management Harbin Institute of Technology Harbin Heilongjiang CN

Bin packing problem with conflicts(BPPC) is a complex combinatorial optimization problem originated from logistics, whose objective is packing all the items with the least number of bins and satisfying the conflict constraints among the items. In this paper, we firstly give the description and 0-1 integer programming model of BPPC, and then transform the model into the representation of conflict graph structure. After that, an ant colony optimization(ACO) algorithm framework is proposed for solving the conflict elimination procedure of BPPC based on a graph coloring heuristic, according to the results of conflict elimination, an improved first-fit decreasing algorithm is used to finish the packing operations of the subsets of items without conflicts. the experiments show that the improve ACO algorithm in this paper is valid and could provide a feasible and high-quality solutions of BPPC efficiently.

关键词： Algorithm design and analysis Heuristic algorithms Image color analysis Color optimization Graph theory Linear programming

来源：评论

学校读者我要写书评

暂无评论

Optimal Flow User Connectivity through Switches to Destiny Nodes in a Software-Defined Network 26

Optimal Flow User Connectivity Through Switches to Destiny N...

引用

2024 IEEE international conference on Automation/26th Congress of the Chilean Association of Automatic Control, ICA-ACCA 2024

作者： Viveros, Andŕes Adasme, Pablo Cordero, Sergio Juan, Enrique San Universidad de Santiago de Chile Chile Department of Electrical Engineering Santiago Chile

ISBN: (纸本)9798350378115

this article examines the management of user traffic to the network access point and within the network, from the user's access point to the destination server containing the required information. this study is conducted within the architecture of Software-Defined Networks (SDN). Two models are analyzed. the first model aims to minimize latency from the user to the network access point and within the network to retrieve information from the server while also minimizing the number of controllers. this model has a quadratic relationship between switches and controllers, which could affect performance. Subsequently, the second model linearizes the quadratic relationship. the goal is to manage the network by minimizing user access latency, considering that users will select the connection point with the minimum distance from the network access points to the destination server. For our research, we used 13 real Benchmark networks subject to extensive tests using our models and the computational power of the Gurobi software to find solutions. this work represents a pioneering effort in mathematical optimization related to the problem of how to manage the flow of user data from the point where the user connects to the network. the study focuses on doing this within a network that uses SDN technology. Detailed analysis of the test results shows that the models' effectiveness is closely linked to the network's scale. Additionally, compared to the first, the second model's performance generally performs worse in larger networks. these insights offer a deep understanding of the models' functionalities and optimization dynamics. they are finally, enhancing network efficiency and performance in SDNs. © 2024 IEEE.

关键词： Mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Multiobjective optimization for forward and Reverse Logistics Network Design in Rural Areas

Multiobjective Optimization for forward and Reverse Logistic...

引用

IEEE international conference on e-Business Engineering (ICEBE)

作者： Yufeng Zhuang Hang Zhao Chi Zhang School of Automation Beijing University of Posts and Telecommunications Beijing China

ISBN: (纸本)9781509061204

Nowadays, we're all familiar with the speed of e-commerce development, but we have to admit that logistics industry in rural areas is still in its infancy. As deficient rural logistics network has restricted the rural development to a certain extent, this research field becomes a hot topic. However, most existing papers on forward and reverse logistics network design were primarily concerned with minimizing the total cost, neglecting the time sensitivity. In this paper, we propose a rural forward and reverse logistics network mode of e-commerce platform and a multiobjective mixed-integer linear programming model for logistics network design. To solve the NP-hard problem of the model, the nondominated sorting genetic algorithm II (NSGA-II) has been used. At last, the model has been used to design forward and reverse rural logistics network in Pinggu district of Beijing as an example, and the result show that the model is efficient for establishing virtuous rural logistics network.

关键词： Agricultural products Sociology Statistics Reverse logistics Euclidean distance Rural areas

来源：评论

学校读者我要写书评

暂无评论

Identification methods of critical combination of vulnerable links in transportation networks 8th

Identification methods of critical combination of vulnerable...

引用

8th international conference on Green Intelligent Transportation Systems and Safety, 2017

作者： Li, Lin Ma, Jie Li, Dawei Branch of Intelligent Equipment and Information Engineering ChangZhou Vocational Institute of Engineering ChangZhouJiangsu213164 China School of Transportation Southeast University Nanjing210096 China

ISBN: (纸本)9789811303012

this chapter presents two global optimization approaches for identifying the most critical combination of vulnerable links in a transportation network. the first approach is formulated with a bi-level framework. It can be applied to small-scale networks. the second proposed approach formulates this problem as a Mixed-integer Nonlinear programming (MINLP). We revised the [MINLP] into a nicer form [RMINLP] to simplify the vulnerability problem into a discrete Network Design Problem (DNDP), so that it can be solved by many existing algorithms for DNDPs, and expand its scope of application. A numerical example of Sioux-Falls network is used to illustrate the two proposed approaches. the test results show that both approaches can provide a global optimization solution, while the second approach has a better property in computing efficiency. © Springer Nature Singapore Pte Ltd. 2019.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

A new algorithm for dynamic scheduling with partially substitutability constrained resource on critical chain 8

引用

8th international conference on Management Science and Engineering Management, ICMSEM 2014

作者： Yang, Qin Wang, Yushi Wu, S. Wang, Wenke Wang, Tingting Business School Sichuan Normal University Chengdu610064 China

ISBN: (纸本)9783642551215

A dynamic scheduling for the constrained resource with partially substitutability based on the critical chain can not only improve the work efficiency of the system, but also achieve the replacement of resources and reduce the utilization of the core resources. this problem is influenced by operating time and setup time of jobs and aims at minimizing total tardiness. Plant growth simulation algorithm is inspired by the photostrophism mechanism and mainly be utilized to solve the global optimization of integer programming problem in the beginning. It possesses the convenience to determine the parameters, stability and accuracy to solve the problem and excellent global optimization ability which make it get extensive and effective application and promotion inmany engineering and technical fields. Firstly, describe the problem as a dynamic scheduling problem with machine eligibility restrictions who has machines in parallel with different speeds and jobs with different release date and due date. Secondlymodel the scheduling problem and design the rescheduling rule according to the time series of jobs. thirdly, adopt and optimize the new algorithm-plant growth simulation algorithm to get optimization by iterating. Finally, conduct simulation experiment and test the feasibility and superiority of the method by comparing with PSO and GA. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Global optimization

来源：评论

学校读者我要写书评

暂无评论

Resource provisioning for IoT application services in smart cities

Resource provisioning for IoT application services in smart ...

引用

international conference on Network and Service Management

作者： José Santos Tim Wauters Bruno Volckaert Filip De Turck Department of Information Technology IDLab Gent Belgium

In the last years, traffic over wireless networks has been increasing exponentially, due to the impact of Internet of things (IoT) and Smart Cities. Current networks must adapt to and cope with the specific requirements of IoT applications since resources can be requested on-demand simultaneously by multiple devices on different locations. One of these requirements is low latency, since even a small delay for an IoT application such as health monitoring or emergency service can drastically impact their performance. To deal with this limitation, the Fog computing paradigm has been introduced, placing cloud resources on the edges of the network to decrease the latency. However, deciding which edge cloud location and which physical hardware will be used to allocate a specific resource related to an IoT application is not an easy task. therefore, in this paper, an integer Linear programming (ILP) formulation for the IoT application service placement problem is proposed, which considers multiple optimization objectives such as low latency and energy efficiency. Solutions for the resource provisioning of IoT applications within the scope of Antwerp's City of things testbed have been obtained. the result of this work can serve as a benchmark in future research related to placement issues of IoT application services in Fog Computing environments since the model approach is generic and applies to a wide range of IoT use cases.

关键词： Logic gates Cloud computing Smart cities Bandwidth Wireless communication Edge computing optimization

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithms for the multiple container packing problem

Genetic algorithms for the multiple container packing proble...

引用

5th international conference on Parallel Problem Solving from Nature, PPSN 1998

作者： Raidl, Günther R. Kodydek, Gabriele Department of Computer Graphics Vienna University of Technology Karlsplatz 13/1861 1040 Vienna Austria

ISBN: (纸本)3540650784

this paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising similarities to the Knapsack Problem and the Bin Packing Problem. Two different representation schemes are suggested, namely direct encoding and order based encoding. While order based encoded solutions are always feasible, a repair algorithm is used in case of direct encoding to ensure feasibility. Additionally, local improvement operators have been applied to both GA variants. the proposed algorithms were empirically compared by using various sets of differently sized test data. Order based encoding performed better for problems with fewer items, whereas direct encoding exhibited advantages when dealing with larger problems. the local improvement operators lead in many cases not only to better final results but also to shorter running times because of higher convergence rates.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering

On the Use of Equivalence Classes for Optimal and Sub-Optima...

引用

IEEE international conference on Automation Science and Engineering (CASE)

作者： Sabino Roselli Fredrik Hagebring Sarmad Riazi Martin Fabian Knut Åkesson Department of Electrical Engineering Chalmers University of Technology Göteborg Sweden

Bin covering is an important optimization problem in many industrial fields, such as packaging, recycling, and food processing. the problem concerns a set of items, each with its own value, that are to be collected into bins in such a way that the total value of each bin, as measured by the sum of its item values, is not lower than a target value. the optimization problem concerns maximizing the number of bins. this is a combinatorial NP-hard problem, for which true optimal solutions can only be calculated in specific cases, such as when restricted to a small number of items. To get around this problem, many suboptimal approaches exist. this paper describes a formulation of the bin covering that allows to find the true optimum for a rather large number of items, over 1000. Also presented is a suboptimal solution, which is compared to the true optimum and found to come within less than 10% of the optimum.

关键词： optimization Computational complexity Mixed integer linear programming Set theory NP-hard problem combinatorial mathematics

来源：评论

学校读者我要写书评

暂无评论

optimization of Saleman Travelling Problem Using Genetic Algorithm with Combination of Order and Random Crossover

Optimization of Saleman Travelling Problem Using Genetic Alg...

引用

IEEE international conference on Control System, Computing and Engineering (ICCSCE)

作者： Muhammad Firdaus Shafie Fadzil Ahmad Muhammad Khusairi Osman Ahmad Puad Ismail Khairul Azman Ahmad Saiful Zaimy Yahaya Mohaiyedin Idris Anwar Hassan Ibrahim School of Electrical Engineering College of Engineering University Teknologi Mara Cawangan Pulau Pinang Permatang Pauh Pulau Pinang Malaysia Department of Electrical Engineering College of Engineering Qassim University Buraydah Saudi Arabia

Traveling salesman problem (TSP) is a problem of determining the shortest path for a salesman to take to visit all cities. Although a small number of cities is easy to solve, as the number of cities increases, it’s not possible to solve in polynomial time as it was a combinatorial nondeterministic polynomial (NP-hard) problem. Hence, this project is implementing a genetic algorithm (GA) to solve TSP using Python programming. the focus of this paper is to analyze the GA using order crossover (OX) and random crossover (RX) and propose a combination mechanism, direct combination (OX-RX) and Dynamic Linear combination (OXRX-Linear) to optimize TSP. We test GA for OX and RX in a random set of cities, up to 75 total cities. then compare the result of the proposed combination OX-RX and OX-RXLinear. the result shows that both proposed combined mechanisms OX-RX and OX-RX-Linear improve the performance of GA in solving TSP.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 66 67 68 69 70 71 72 73 74 75 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：