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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

RFID Network Planning for Flexible Manufacturing Workshop with Multiple Coverage Requirements 8

RFID Network Planning for Flexible Manufacturing Workshop wi...

引用

8th IEEE international conference on Computer Science and Network Technology (ICCSNT)

作者： Wu, Lihui Ren, Junfei Li, Yuansheng Dai, Zhengzheng Zhang, Zhongwei Wu, Zhaoyun Henan Univ Technol Sch Mech & Elect Engn Zhengzhou Peoples R China

ISBN: (纸本)9781728181233

Flexible manufacturing workshops (FMWs) are important part of modern manufacturing enterprises. An optimized layout of radio frequency identifications (RFIDs) in an FMW is of great significance to improve information perception quality and reduce RFID deployment cost. therefore, the RFID network planning for an FMW is studied in this paper. Firstly, three common coverage requirements are analyzed, and a RFID reader radiation model and an FMW discrete grids model are constructed. Secondly, a 0-1 integer programming-based RFID network planning model is established with the optimization objectives of the RFID deployment cost, reader interference, and reading efficiency. thirdly, a hierarchical clustering and gradient descent-based network planning approach is proposed to solve the network planning model. An FMW case in a flexible manufacturing enterprise is taken to verify the RFID network planning model and the hierarchical clustering approach. the results show that the proposed model and approach are effective.

关键词： Flexible manufacturing workshop multiple coverage requirements RFID network planning integer programming multi-objective optimization

来源：评论

学校读者我要写书评

暂无评论

A Simple Dual-RAMP Algorithm for the Capacitated Facility Location Problem 13th

A Simple Dual-RAMP Algorithm for the Capacitated Facility Lo...

引用

13th international conference on Learning and Intelligent optimization (LION)

作者： Matos, Telmo Oliveira, Oscar Gamboa, Dorabela Polytech Porto Sch Technol & Management CIICESI Ctr Res & Innovat Business Sci & Informat Porto Portugal

ISBN: (纸本)9783030386290;9783030386283

Facility Location embodies a class of problems concerned with locating a set of facilities to serve a geographically distributed population of customers at minimum cost. We address the classical Capacitated Facility Location Problem (CFLP) in which the assignment of facilities to customers must ensure enough facility capacity and all the customers must be served. this is a well-known NP-hard problem in combinatorial optimization that has been extensively studied in the literature. Due to the difficulty of the problem, significant research efforts have been devoted to developing advanced heuristic methods aimed at finding high-quality solutions in reasonable computational times. We propose a Relaxation AdaptiveMemory programming (RAMP) approach for the CFLP. Our method combines lagrangean subgradient search with an improvement method to explore primal-dual relationships to create advanced memory structures that integrate information from both primal and dual solution spaces. the algorithm was tested on the standard ORLIB dataset and on other very large-scale instances for the CFLP. Our approach efficiently found the optimal solution for all ORLIB instances and very competitive results for the large-scale ones. Comparisons with current best-performing algorithms for the CFLP show that our RAMP algorithm exhibits excellent results.

关键词： RAMP Facility Location Adaptive memory programming Lagrangean Relaxation

来源：评论

学校读者我要写书评

暂无评论

Minimum Cycle Partition with Length Requirements 17th

Minimum Cycle Partition with Length Requirements

引用

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

作者： Hoppmann, Kai Mexi, Gioni Burdakov, Oleg Casselgren, Carl Johan Koch, thorsten Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany TU Berlin Chair Software & Algorithms Discrete Optimizat Str 17 Juni 135 D-106230 Berlin Germany Linkoping Univ Dept Math S-58183 Linkoping Sweden

ISBN: (纸本)9783030589424;9783030589417

In this article we introduce a Minimum Cycle Partition Problem with Length Requirements (CPLR). this generalization of the Travelling Salesman Problem (TSP) originates from routing Unmanned Aerial Vehicles (UAVs). Apart from nonnegative edge weights, CPLR has an individual critical weight value associated with each vertex. A cycle partition, i.e., a vertex disjoint cycle cover, is regarded as a feasible solution if the length of each cycle, which is the sum of the weights of its edges, is not greater than the critical weight of each of its vertices. the goal is to find a feasible partition, which minimizes the number of cycles. In this article, a heuristic algorithm is presented together with a Mixed integer programming (MIP) formulation of CPLR. We furthermore introduce a conflict graph, whose cliques yield valid constraints for the MIP model. Finally, we report on computational experiments conducted on TSPLIB-based test instances.

关键词： Travelling salesman problem combinatorial optimization Mixed integer linear programming Conflict graph Unmanned Aerial Vehicles

来源：评论

学校读者我要写书评

暂无评论

Using integer programming to Search for Counterexamples: A Case Study 19th

Using Integer Programming to Search for Counterexamples: A C...

引用

19th international conference on Mathematical optimization theory and Operations Research, MOTOR 2020

作者： Lancia, Giuseppe Pippia, Eleonora Rinaldi, Franca Dipartimento di Scienze Matematiche Informatiche e Fisiche University of Udine Via delle Scienze 206 Udine33100 Italy The Research Hub by Electrolux Professional Viale Treviso 15 PordenonePN33170 Italy

ISBN: (纸本)9783030499877

It is known that there exist 4-regular, 1-tough graphs which are non-hamiltonian. the smallest such graph known has$$n=18$$ nodes and was found by Bauer et al., who conjectured that all 4-regular, 1-tough graphs with$$n\le 17$$ are hamiltonian. they in fact proved that this is true for$$n\le 15$$, but left open the possibility of non-hamiltonian graphs of 16 or 17 nodes. By using ILP for modeling a counterexample, and then finding out that the model has no solutions, we give an algorithmic proof that their conjecture was indeed correct. © 2020, Springer Nature Switzerland AG.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Robust optimization of Flow Shop Scheduling with Uncertain Processing Time 17

Robust optimization of Flow Shop Scheduling with Uncertain P...

引用

17th IEEE international conference on Mechatronics and Automation, ICMA 2020

作者： Sun, Qi Dou, Jianping Zhang, Canran Southeast University School of Mechanical Engineering Nanjing Jiangsu Province China Engineering Research Center of New Light Sources Technology and Equipment Ministry of Education Nanjing Jiangsu Province China

ISBN: (纸本)9781728164151

the flow shop scheduling (FSS) problem is a classic NP-hard combinatorial problem. Owing to the processing time of an operation is usually uncertain in practice, a scenario-based robust optimization model is established for the FSS problem with uncertain processing time. the optimization goal of this model is to minimize the combination of expected processing time and the deviation of makespan for all scenarios. then, a mixed integer linear programming (MILP) model is derived to minimize the objective, and two more constraints are added to ensure the validation of the model. Based on this model, the global best solutions of the small sized cases are obtained by LINGO. To solve the mid-to-large sized cases, a new algorithm called master-apprentice evolutionary algorithm (MAE) is adopted. the comparison between MAE and state-of-the-art metaheuristics illustrates the effectiveness of the MAE. © 2020 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

19th international conference on integer programming and combinatorial optimization, IPCO 2017

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

引用

19th international conference on integer programming and combinatorial optimization, IPCO 2017

ISBN: (纸本)9783319592497

the proceedings contain 36 papers. the special focus in this conference is on integer programming and combinatorial optimization. the topics include: On scheduling coflows;integrality gaps of integer knapsack problems;approximation of corner polyhedra with families of intersection cuts;the structure of the infinite models in integer programming;mixed-integer linear representability, disjunctions, and variable elimination;cutting planes from wide split disjunctions;the heterogeneous capacitated k-center problem;local guarantees in graph cuts and clustering;verifying integer programming results;long term behavior of dynamic equilibria in fluid queuing networks;approximation algorithm for the maximum traveling salesman problem;minimizing multimodular functions and allocating capacity in bike-sharing systems;stochastic online scheduling on unrelated machines;beating half for random arrival;an improved deterministic rescaling for linear programming algorithms;a quasi-polynomial approximation for the restricted assignment problem;adaptive submodular ranking;minimum birkhoff-von Neumann decomposition;maximum matching in the online batch-arrival model;budget feasible mechanisms on matroids;deterministic discrepancy minimization via the multiplicative weight update method;mixed-integer convex representability;high degree sum of squares proofs, bienstock-zuckerberg hierarchy and cg cuts;enumeration of integer points in projections of unbounded polyhedra and equilibrium computation in atomic splittable singleton congestion games.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Computation Task Scheduling and Offloading optimization for Collaborative Mobile Edge Computing 26

Computation Task Scheduling and Offloading Optimization for ...

引用

26th IEEE international conference on Parallel and Distributed Systems (IEEE ICPADS)

作者： Lin, Bin Lin, Xiaohui Zhang, Shengli Wang, Hui Bi, Suzhi Shenzhen Univ Coll Elect & Informat Engn Shenzhen 518060 Peoples R China Peng Cheng Lab Shenzhen 518066 Peoples R China

ISBN: (纸本)9781728190747

Mobile edge computing (MEC) platform allows its subscribers to utilize computational resource in close proximity to reduce the computation latency. In this paper, we consider two users each has a set of computation tasks to execute. In particular, one user is a registered subscriber that can access the computation service of MEC platform, while the other unregistered user cannot directly access the MEC service. In this case, we allow the registered user to receive computation offloading from the unregistered user, compute the received task(s) locally or further offload to the MEC platform, and charge a fee that is proportional to the computation workload. We study from the registered user's perspective to maximize its total utility that balances the monetary income and the cost on execution delay and energy consumption. We formulate a mixed integer non-linear programming (MINLP) problem that jointly decides the execution scheduling of the computation tasks (i.e., the device where each task is executed) and the computation/communication resource allocation. To tackle the problem, we first derive the closed-form solution of the optimal resource allocation given the integer task scheduling decisions. We then propose a reduced-complexity approximate algorithm to optimize the combinatorial computation scheduling decisions. Simulation results show that the proposed collaborative computation scheme effectively improves the utility of the helper user compared with other benchmark methods, and the proposed solution method approaches the optimal solution within 0.1% average performance gap with significantly reduced complexity.

关键词： Mobile edge computing resource allocation user cooperation convex optimization

来源：评论

学校读者我要写书评

暂无评论

Two Reformulation Approaches to Maximum-A-Posteriori Inference in Sum-Product Networks 10

Two Reformulation Approaches to Maximum-A-Posteriori Inferen...

引用

10th international conference on Probabilistic Graphical Models (PGM)

作者： Maua, Denis Deratani Ribeiro, Heitor Reis Katague, Gustavo Perez Antonucci, Alessandro Univ Sao Paulo Inst Math & Stat Sao Paulo Brazil Ist Dalle Molle Studi Intelligenza Artificiale Lugano Switzerland

Sum-product networks are expressive efficient probabilistic graphical models that allow for tractable marginal inference. Many tasks however require the computation of maximum-a-posteriori configurations, an NP-hard problem for such models. To date there have been very few proposals for computing maximum-a-posteriori configurations in sum-product networks. this is in sharp difference with other probabilistic frameworks such as Bayesian networks and random Markov fields, where the problem is also NP-hard. In this work we propose two approaches to reformulate maximuma-posteriori inference as other combinatorial optimization problems with widely available solvers. the first approach casts the problem as a similar inference problem in Bayesian networks, overcoming some limitations of previous similar translations. In addition to making available the toolset of maximum-a-posteriori inference on Bayesian networks to sum-product networks, our reformulation also provides further insight into the connections of these two classes of models. the second approach casts the problem as a mixed-integer linear program, for which there exists very efficient solvers. this allows such inferences to be enriched with integer-linear constraints, increasing the expressivity of the models. We compare our reformulation approaches in a large collection of problems, and against state-of-the-art approaches. the results show that reformulation approaches are competitive.

关键词： Tractable Probabilistic Models Sum-Product Networks Probabilistic Circuits Maximuma-Posteriori Inference Mixed-integer Linear programming Bayesian Networks

来源：评论

学校读者我要写书评

暂无评论

Efficient Traffic Coordination Strategies at Intersections Using Multiple Collision Sets

Efficient Traffic Coordination Strategies at Intersections U...

引用

7th international conference on Communications, Signal Processing, and Systems (CSPS)

作者： Mo, Yangan Wang, Mengqi Zhang, Tingting Xu, Hongguang Harbin Inst Technol Shenzhen Grad Sch Commun Engn Res Ctr Shenzhen Peoples R China

ISBN: (纸本)9789811365089;9789811365072

Appropriate traffic coordination at intersections where multiple roads merge plays an important role in modern intelligent transportations systems. In this paper, we try to propose an efficient traffic coordination framework using multiple collision sets. Aiming at the essentially non-convex problem, we try to reformulate the original problem into a mixed binary integer quadratic programming one by proper relaxations. Low complexity solutions are also given afterwards. Numeric results show that the traffic throughput at intersections can be significantly improved compared to the existing investigations.

关键词： Intelligent transportations Intersection coordination Traffic optimization Mixed binary integer programming

来源：评论

学校读者我要写书评

暂无评论

optimization in the construction of nearly cardinal and nearly symmetric wavelets 13

Optimization in the construction of nearly cardinal and near...

引用

13th international conference on Sampling theory and Applications (SampTA)

作者： Dizon, Neil D. Hogan, Jeffrey A. Lakey, Joseph D. Univ Newcastle Sch Maths & Phys Sci Callaghan NSW 2308 Australia New Mexico State Univ Dept Math Sci Las Cruces NM 88003 USA

ISBN: (纸本)9781728137414

We present two approaches to the construction of scaling functions and wavelets that generate nearly cardinal and nearly symmetric wavelets on the line. the first approach casts wavelet construction as an optimization problem by imposing constraints on the integer samples of the scaling function and its associated wavelet and with an objective function that minimizes deviation from cardinality or symmetry. the second method is an extension of the feasibility approach by Franklin, Hogan, and Tam to allow for symmetry by considering variables generated from uniform samples of the quadrature mirror filter, and is solved via the Douglas-Rachford algorithm.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：