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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 石油与天然气工程
340 篇 理学
- 321 篇 数学
- 43 篇 系统科学
- 14 篇 生物学
- 12 篇 物理学
- 11 篇 统计学（可授理学、...
- 4 篇 化学
165 篇 管理学
- 158 篇 管理科学与工程(可...
- 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 条记录，以下是201-210 订阅

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

详细简洁

排序：

the Collaborative Scheduling optimization of External Truck at Container Terminals Based on Mixed integer programming under Appointments System 22

The Collaborative Scheduling Optimization of External Truck ...

引用

22nd COTA international conference of Transportation Professionals (CICTP) - Intelligence, Connectivity, and Mobility

作者： Xia, Xinhai Peng, Zhimin Yang, Shuying Yang, Jingshan Guangzhou Maritime Univ Sch Port & Shipping Management Guangzhou Peoples R China Guangzhou Univ Sch Mech & Elect Engn Guangzhou Peoples R China Guangzhou Maritime Univ Sch Civil & Engn Management Guangzhou Peoples R China

ISBN: (数字)9780784484265

ISBN: (纸本)9780784484265

Appointments at container terminals are an effective way to relieve congestion. In order to adjust the truck's arrival time at the gate, concerning the cooperation and the time window adjustment mode among external trucking companies and terminal operators in the truck appointment system (TAS), the centralized and decentralized dynamic collaborative TAS model are established respectively by mixed integer programming (MIP). Numerical experiments are performed to validate the approach in this study. the results show that the dynamic collaborative TAS can significantly reduce the waiting and congestion costs of the external trucking companies, and better stagger the peak time windows, so as to maximize the synergy between terminal operators and trucking companies. Finally, optimization measures for the scheduled arrival of external trucks outside the container terminal are put forward.

关键词： Trucks

来源：评论

学校读者我要写书评

暂无评论

the Multi-State Perfect Phylogeny Problem with Missing and Removable Data: Solutions via integer-programming and Chordal Graph theory

引用

13th Annual international conference on Research Computational Molecular Biology

作者： Gusfield, Dan Univ Calif Davis Dept Comp Sci Davis CA 95616 USA

ISBN: (纸本)9783642020070

the Multi-State Perfect Phylogeny Problem is all extension of the Binary Perfect Phylogeny Problem, allowing characters to take oil more than two states. In this paper we consider three problems that extend the utility of the multi-state perfect phylogeny model: the Missing Data (MD) Problem where some entries ill the input are missing and the question is whether (bounded) values for the missing data call be imputed so that the resulting data has a multi-state perfect phylogeny;the Character-Removal (CR) Problem where we want to minimize the number of characters to remove from the data so that the resulting data has a multi-state perfect phylogeny;and the Missing-Data Character-Removal (MDCR) Problem where the input has missing data and we want to impute values for the missing data to minimize the solution to the resulting Character-Removal Problem. We detail integer Linear programming (ILP) solutions to these problems for the special case of three permitted states per character and report oil extensive empirical testing of these solutions. then we, develop a general theory to solve the MD problem for all arbitrary number of permitted states, using chordal graph theory and results oil minimal triangulation of non-chordal graphs. this establishes new necessary and sufficient conditions for the existence of a perfect phlylogeny with (or without) missing data. We implement the general theory using integer linear programming, although other optimization methods are possible. We extensively explore the empirical behavior of the general solution, showing that the methods are very practical for data of size and complexity that is characteristic of many Current applications, in phylogenetics. Some of the empirical results for the MD problem with in arbitrary number of permitted states are very surprising, suggesting the existence of additional combinatorial structure in multi-state perfect phylogenies.

关键词： computational biology phylogenetics perfect phylogeny integer programming chordal graphs graph triangulation

来源：评论

学校读者我要写书评

暂无评论

Hypergraphic LP Relaxations for Steiner Trees

Hypergraphic LP Relaxations for Steiner Trees

引用

14th international conference integer programming and combinatorial optimization

作者： Chakrabarty, Deeparnab Konemann, Jochen Pritchard, David Univ Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9783642130359

We investigate hypergraphic LP relaxations for the Steiner tree problem, primarily the partition LP relaxation introduced by Konemann et al. [Math. programming, 2009]. Specifically, we are interested in proving upper bounds on the integrality gap of this LP, and studying its relation to other linear relaxations. Our results are the following. Structural results: We extend the technique of uncrossing, usually applied to families of sets, to families of partitions. As a consequence we show that any basic feasible solution to the partition LP formulation has sparse support. Although the number of variables could be exponential, the number of positive variables is at most the number of terminals. Relations with other relaxations: We show the equivalence of the partition LP relaxation with other known hypergraphic relaxations. We also show that these hypergraphic relaxations are equivalent to the well studied bidirected cut relaxation, if the instance is quasibipartite. Integrality gap upper bounds: We show an upper bound of root 3 = 1.729 on the integrality gap of these hypergraph relaxations in general graphs. In the special case of uniformly qmisibipartite instances, we show an improved upper bound of 73/60 = 1.216. By our equivalence theorem, the latter result implies an improved upper bound for the bidirected cut relaxation as well.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A Constraint integer programming Approach for Resource-Constrained Project Scheduling

A Constraint Integer Programming Approach for Resource-Const...

引用

7th international conference Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems

作者： Berthold, Timo Heinz, Stefan Luebbecke, Marco E. Moehring, Rolf H. Schulz, Jens Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany Tech Univ Darmstadt Fachbereich Math D-64293 Darmstadt Germany Tech Univ Berlin Math Inst D-10623 Berlin Germany

ISBN: (纸本)9783642135194

We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of practical relevance. Jobs have to be scheduled on (renewable) resources subject to precedence constraints such that the resource capacities are never exceeded and the latest completion time of all jobs is minimized. the problem has challenged researchers from different communities, such as integer programming (IP), constraint programming (CP), and satisfiability testing (SAT). Still, there are instances with 60 jobs which have not been solved for many years. the currently best known approach, LAZYFD, is a hybrid between CP and SAT techniques. In this paper we propose an even stronger hybridization by integrating all the three areas, IP, CP, and SAT, into a single branch-and-bound scheme. We show that lower bounds from the linear relaxation of the IP formulation and conflict analysis are key ingredients for pruning the search tree. First computational experiments show very promising results. For five instances of the well-known PSPLIB we report an improvement of lower bounds. Our implementation is generic, thus it can be potentially applied to similar problems as well.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Zero-Coefficient Cuts

Zero-Coefficient Cuts

引用

14th international conference integer programming and combinatorial optimization

作者： Andersen, Kent Weismantel, Robert Otto von Guericke Univ Dept Math IMO D-39106 Magdeburg Germany

ISBN: (纸本)9783642130359

Many cuts used in practice to solve mixed integer programs are derived from a basis of the linear relaxation. Every such cut is of the form alpha(T) x >= 1 where x >= 0 is the vector of non-basic variables and alpha >= 0. For a point (x) over bar of the linear relaxation, we call alpha(T) x >= 1 a zero-coefficient cut wrt. (x) over bar if alpha(T)(x) over bar = 0, since this implies alpha(j) = 0 when (x) over bar (j) > 0. We consider the following problem: Given a point (x) over bar of the linear relaxation, find a basis, and a zero-coefficient cut wrt. (x) over bar derived from this basis, or provide a certificate that shows no such cut exists. We show that this problem can be solved in polynomial time. We also test the performance of zero-coefficient cuts on a number of test problems. For several instances zero-coefficient cuts provide a substantial strengthening of the linear relaxation.

关键词： Mixed integer program Lattice basis Cutting plane Split cut

来源：评论

学校读者我要写书评

暂无评论

Manipulating MDD Relaxations for combinatorial optimization

Manipulating MDD Relaxations for Combinatorial Optimization

引用

8th international conference on Integration of AI and OR Techniques in Constraint programming for combinatorial optimization Problems (CPAIOR)

作者： Bergman, David van Hoeve, Willem-Jan Hooker, John N. Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA

ISBN: (纸本)9783642213113

We study the application of limited-width MDDs (multi-valued decision diagrams) as discrete relaxations for combinatorial optimization problems. these relaxations are used for the purpose of generating lower bounds. We introduce a new compilation method for constructing such MDDs, as well as algorithms that manipulate the MDDs to obtain stronger relaxations and hence provide stronger lower bounds. We apply our methodology to set covering problems, and evaluate the strength of MDD relaxations to relaxations based on linear programming. Our experimental results indicate that the MDD relaxation is particularly effective on structured problems, being able to outperform state-of-the-art integer programming technology by several orders of magnitude.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

A branch and bound algorithm for max-cut based on combining semidefinite and polyhedral relaxations

引用

12th international integer programming and combinatorial optimization conference

作者： Rendl, Franz Rinaldi, Giovanni Wiegele, Angelika Alpen Adria Univ Klagenfurt Math Inst Univ Str 65-67 A-9020 Klagenfurt Austria Inst Syst & Comp Anal CNR I-00185 Rome Italy

ISBN: (纸本)9783540727910

In this paper we present a method for finding exact solutions of the Max-Cut problem maxx(T)Lx such that x is an element of {-1, 1}(n). We use a semidefinite relaxation combined with triangle inequalities, which we solve with the bundle method. this approach is due to Fischer, Gruber, Rendl, and Sotirov [12] and uses Lagrangian duality to get upper bounds with reasonable computational effort. the expensive part of our bounding procedure is solving the basic semidefinite programming relaxation of the Max-Cut problem. We review other solution approaches and compare the numerical results with our method. We also extend our experiments to unconstrained quadratic 0-1 problems and to instances of the graph bisection problem. the experiments show, that our method nearly always outperforms all other approaches. Our algorithm, which is publicly accessible through the Internet, can solve virtually any instance with about 100 variables in a routine way.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

the Effect of Economic Objective Function on Economic, Operational and Environmental Performance of Optimal Chemical Processes

The Effect of Economic Objective Function on Economic, Opera...

引用

13th conference on Process Integration, Modelling and Optimisation for Energy Saving and Pollution Reduction

作者： Kasas, Mihael Kravanja, Zdravko Pintaric, Zorka Novak Univ Maribor Fac Chem & Chem Engn SLO-2000 Maribor Slovenia

ISBN: (纸本)9788895608051

In this work, three of the more used economic criteria were applied in the economic objective function when synthesizing chemical processes using mathematical programming approach: the profit before taxes (PB), the net present value (NPV), and the internal rate of return (IRR). the effects on the economic, operational, and environmental performances of optimal process flow sheets were studied since different criteria, in general, produce different optimal solutions. Mixed integer nonlinear programming (MINLP) syntheses of three processes, methanol, dimethyl ether and HDA were performed as case-studies together with simultaneous heat integration. It was observed that optimal process flow sheets obtained by three distinct criteria differ not only in process topology and capacities but also in operating and economic figures, efficiency of feed and utility utilization, as well as the sustainability measurements, e. g. toxicological and ecological indices, and total potential environmental impact of the process. In particular, it was shown that the main cause of these differences is the shape of the cash flow function vs. investment level, which is strongly dependent on the level of details incorporated in the mathematical model. Only those models with sufficient trade-offs between investment and cash flow generate proper optimal solutions with the correct economic criterion. the consequences of decision-making based on wrong optimization criteria are discussed.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Off-line Algorithms for Routing, Modulation Level, and Spectrum Assignment in Elastic Optical Networks

Off-line Algorithms for Routing, Modulation Level, and Spect...

引用

13th international conference on Transparent Optical Networks (ICTON)

作者： Klinkowski, Miroslaw Walkowiak, Krzysztof Jaworski, Marek Inst Natl Telecommun Dept Transmiss & Opt Technol Warsaw Poland Wroclaw Univ Technol Dept Syst & Comp Networks Wroclaw Poland

ISBN: (纸本)9781457708800

Optical network architectures with elastic bandwidth provisioning are a very promising approach for next generation optical networks. Such elastic optical networks will enable efficient resource utilization and flexible sub-wavelength and super-channel connection provisioning to support heterogeneous and immense bandwidth demands. In this paper, we focus on the problem of Routing, Modulation Level, and Spectrum Allocation/Assignment (RMLSA) which emerges in such networks. We both formulate RMLSA as an integer Linear programming (ILP) problem and propose an effective heuristic method called Adaptive Frequency Assignment - Division and Collision Avoidance (AFA-DCA) to be used if the solution of ILP is not attainable.

关键词： Elastic Optical Networks Network optimization RMLSA

来源：评论

学校读者我要写书评

暂无评论

Genetic Algorithm for Multi-choice integer Linear programming Problems 7th

Genetic Algorithm for Multi-choice Integer Linear Programmin...

引用

international conference on Soft Computing for Problem Solving (SocProS)

作者： Mohanty, D. K. Jana, R. K. Biswal, M. P. Indian Inst Technol Kharagpur Dept Math Kharagpur 721302 W Bengal India Indian Inst Management Raipur GEC Campus Sejbahar 492015 India

ISBN: (纸本)9789811315923;9789811315916

Genetic algorithms (GAs) are very powerful techniques to solve difficult combinatorial optimization problems. Multi-choice programming (MCP) belongs to a class of combinatorial optimization problems where the decision maker (DM) has to choose a value from a number of alternative choices and to find a combination which optimizes an objective function subject to a given set of constraints. In many of the real-life optimization problems, the solution of some problems cannot be fractions and must be specified as integers, and solving of such types of problems is called integer programming (IP). In this paper, a genetic algorithm (GA) for nonlinear integer programming (NLIP) to solve a multi-choice integer linear programming (MCILP) problem is proposed. Here, we consider an MCILP problem where some or all right-hand side parameters of the constraints may have multiple choices. the multi-choice parameters in the problem are handled using the interpolating polynomials. After constituting interpolating polynomials corresponding to all multi-choice parameters, an NLIP model is formulated. Using our proposed GA, optimal integer solution of the NLIP model is obtained. Lastly, some illustrative examples are presented to support the solution procedure.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 17 18 19 20 21 22 23 24 25 26 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：