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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Form follows availability - Designing structures through reuse 60

Form follows availability - Designing structures through reu...

引用

60th Anniversary Symposium of the international-Association-for-Shell-and-Spatial-Structures (IASS SYMPOSIUM) / 9th international conference on Textile Composites and Inflatable Structures (STRUCTURAL MEMBRANES)

作者： Brutting, Jan Senatore, Gennaro Fivet, Corentin EPFL Lausanne Struct Xplorat Lab Passage Cardinal 13b Fribourg Switzerland EPFL Lausanne Appl Comp & Mech Lab IMAC Fribourg Switzerland

ISBN: (纸本)9788412110104

this work proposes a new direction in structural design: the synthesis of structures through the reuse of elements. Reusing structural elements reduces the environmental impacts of building structures because it avoids sourcing new material, it reduces waste and it requires little energy. Designing structures from reused elements is unlike conventional structural design because stock element availability is a design input. In other words, structures must be designed to fit given element characteristics, e.g. cross-sections and lengths. Stock constraints such as number of elements and element lengths, have a major influence on the optimal structure layout and form. In this new paradigm structural form follows availability. this work formulates new computational methods for the synthesis of reticular structures through reuse. Two scenarios are presented: a) reuse of reclaimed elements from a given stock, and b) design of a common stock which is used as a kit-of-parts to build diverse structures. Case studies are presented to demonstrate the potential of the proposed methods. It is shown that structures produced by these methods have a significantly lower environmental impact than minimum weight structures made of new elements.

关键词： Structural design discrete optimization geometry optimization mixed-integer linear programming reuse stock Life Cycle Assessment environmental impact

来源：评论

学校读者我要写书评

暂无评论

Generating cuts from multiple-term disjunctions

引用

8th international integer programming and combinatorial optimization conference, IPCO 2001

作者： Perregaard, Michael Balas, Egon Carnegie Mellon University PittsburghPA United States

ISBN: (纸本)3540422250

the traditional approach towards generating lift-and-project cuts involves solving a cut generating linear program (CGLP) that grows prohibitively large if a multiple-term disjunction is used instead of the classical dichotomy. In this paper we present an alternative approach towards generating lift-and-project cuts that solves the cut generation problem in the original space (i.e. does not introduce any extra variables). We present computational results that show our method to be superior to the classical approach. As soon as the number of terms in the disjunction grows larger than 4, the benefit of not solving the large CGLP directly is clear, and the gap grows larger as more terms are included in the disjunction. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Valid inequalities for problems with additive variable upper bounds 1

引用

7th international conference on integer programming and combinatorial optimization, IPCO 1999

作者： Atamtürk, Alper Nemhauser, George L. Savelsbergh, Martin W. P. Department of Industrial Engineering and Operations Research University of California BerkeleyCA94720-1777 United States School of Industrial and Systems Engineering Georgia Institute of Technology AtlantaGA30332-0205 United States

ISBN: (数字)9783540487777

ISBN: (纸本)3540660194

We study the facial structure of a polyhedron associated with the single node relaxation of network flow problems with additive variable upper bounds. this type of structure arises, for example, in network design/expansion problems and in production planning problems with setup times. We first derive two classes of valid inequalities for this polyhedron and give the conditions under which they are facet-defining. then we generalize our results through sequence independent lifting of valid inequalities for lower-dimensional projections. Our computational experience with large network expansion problems indicates that these inequalities are very effective in improving the quality of the linear programming relaxations. © Springer-Verlag Berlin Heidelberg 1999.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Separable concave optimization approximately equals piecewise linear optimization

引用

10th international conference on integer programming and combinatorial optimization, IPCO 2004

作者： Magnanti, thomas L. Stratila, Dan School of Engineering and Sloan School of Management Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139-4307 United States Operations Research Center Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139-1309 United States

ISBN: (纸本)3540221131

We show how to approximate a separable concave minimization problem over a general closed ground set by a single piecewise linear minimization problem. the approximation is to arbitrary 1+ϵ precision in optimal cost. For polyhedral ground sets in n+ and nondecreasing cost functions, the number of pieces is polynomial in the input size and proportional to 1/ log(1+ ϵ). For general polyhedra, the number of pieces is polynomial in the input size and the size of the zeroes of the concave objective components. We illustrate our approach on the concave-cost uncapacitated multicommodity flow problem. By formulating the resulting piecewise linear approximation problem as a fixed charge, mixed integer model and using a dual ascent solution procedure, we solve randomly generated instances to within five to twenty percent of guaranteed optimality. the problem instances contain up to 50 nodes, 500 edges, 1,225 commodities, and 1,250,000 flow variables. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

integer programming Approach for a Class of Staff Scheduling Problems - Schedule optimization and Parameter Estimation

Integer Programming Approach for a Class of Staff Scheduling...

引用

international conference on Soft Computing and Intelligent Systems

作者： Makoto Ohara Hisashi Tamaki Graduate School of Law Kobe University Graduate School of System Informatics Kobe University

ISBN: (纸本)9781467327428

this paper introduces an integer programming approach for a class of staff scheduling problems which is applicable for various kinds of the problems by both adopting an optimization model and parameter estimation techniques based on a mathematical programming formulation. For a work in which a staff must change or rotate shifts, generally, a responsible personnel (e.g., a manager) makes a schedule (e.g., a dairy or a weekly staff assignment) in a manual way based on some experiences. It is very hard, however, to generate not only a good schedule but also a feasible one, due to several kinds of constraints and requirements should be satisfied. Here, it is the case that the constraints are not be completely clear because these have no evident boundary, which makes the scheduling problems more difficult. In this paper, first, the staff scheduling problem is formally described in a rather generalized form to apply a wide range of work types, and is formulated as a integer programming model. In this formulation, so many parameters concerning the desires of workers as well as the conditions on works are included. then, some ways of identifying the parameters is investigated by utilizing the available information acquired extraction from the past staff schedules and listening from managers. In the case that the setting of the parameters is not suitable, a good schedule or even a practical schedule can not be obtained through the integer programming model. With respect to this point, some computational examples have been done in order to examine the reliability of the way of setting parameters as well as the model of optimizing schedule. through the result of computational examples, the effectiveness and the potential of the proposed approach are confirmed.

关键词：

来源：评论

学校读者我要写书评

暂无评论

thE CULVERT MAINTENANCE PLANNING AND SCHEDULING PROBLEM: A MAthEMATICAL FORMULATION TO OPTIMIZE RESOURCE UTILIZATION 50

THE CULVERT MAINTENANCE PLANNING AND SCHEDULING PROBLEM: A M...

引用

50th international conference on Computers and Industrial Engineering: Sustainable Digital Transformation, CIE 2023

作者： Lyu, Z. Starr, C. Yu, A.J. Department of Industrial and Systems Engineering University of Tennessee Knoxville Knoxville United States Aeronautics Division - Project Development and Delivery Tennessee Department of Transportation Nashville United States

ISBN: (纸本)9781713886952

this paper addresses the culvert maintenance planning and scheduling problem faced by the Tennessee Department of Transportation (TDOT), with the aim of optimizing the overall condition of culverts throughout Tennessee within specific resource constraints. the planning scope is adjustable based on best practices, and decisions to include which culverts to repair, the maintenance type to perform, potential culvert grouping for cost reduction, and the decision to hire contractors. Constraints to consider include budgets, workforce availability, and the minimum contracting requirements. While most current research focuses on culvert condition assessment, few studies focus on maximizing the overall culvert condition given limited resources using optimization approaches. To fill this gap, we formulate the problem as an integer linear programming model and solve it using the commercial solver Gurobi. Our approach is evaluated using real-life instances. the proposed approach is found effective in solving the problem and can contribute to TDOT's decision-making process. Furthermore, the model can be used to estimate the resource requirements for restoring the culvert condition to a particular level. © 2023 Computers and Industrial Engineering. All rights reserved.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

A New Integrated Mathematical Model for Agro-Food Supply Chain 8

A New Integrated Mathematical Model for Agro-Food Supply Cha...

引用

8th IEEE international conference on Industrial Engineering and Applications, ICIEA 2021

作者： Fikry, I. Gheith, Mohamed Eltawil, Amr Egypt-Japan University for Science and Technology Department of Industrial and Manufacturing Engineering Alexandria Egypt Alexandria University Faculty of Engineering Production Engineering Department Alexandria Egypt

ISBN: (纸本)9781665428958

Sustainable agriculture production has been recently one of the required changes in many countries. In this paper, an optimization model is presented for stimulating the crop rotation problem with industrial-related decisions in the agro-food supply chain. the current study's main purpose is to identify the optimal rotation schedules in a restricted area while satisfying the required demand in the industrial sector. the combinatorial nature of the agricultural problem is due to several factors that must be considered simultaneously. these factors include but are not limited to the succession of crops, irrigation amount, fallow periods, and space limitation. the mentioned factors make crop rotation a complex problem, so combining this problem with the tactical industrial problem leads to a challenging integrated problem in the agro-food supply chain. Set of instances for exploring the problem's complexity are solved to optimality. From the results, the associated number of variables and the computational time were outlined within the rotation planning horizon. the solutions for the production and logistics plans were discussed along the supply chain. © 2021 IEEE.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

optimization of a Ship-Based Logistics System for Carbon Capture and Storage 13th

Optimization of a Ship-Based Logistics System for Carbon Cap...

引用

13th international conference on Computational Logistics (ICCL)

作者： Bennaes, Anders Skogset, Martin Svorkdal, Tormod Fagerholt, Kjetil Herlicka, Lisa Meisel, Frank Rickels, Wilfried Norwegian Univ Sci & Technol Dept Ind Econ & Technol Management Trondheim Norway Christian Albrechts Univ Kiel Fac Business Econ & Social Sci Kiel Germany Kiel Inst World Econ Kiel Germany

ISBN: (纸本)9783031165795;9783031165788

Carbon Capture and Storage (CCS) is the process of capturing CO2 before it enters the atmosphere, transporting it, and then storing the CO2 in a permanent underground storage site. CCS is projected to play an important role for compliance with the temperature degree goals set by the Paris Agreement, and with this in mind, we study the so-called Ship-Based CCS Logistics Problem (SCLP). the SCLP deals with designing a cost-effective ship-based logistics system to ensure that CO2 captured from emission sources in the hinterland of loading ports is transported to unloading ports nearby the final storage sites. As part of this, one needs to determine the intermediate storage capacities at the loading ports, ship fleet size and mix, fleet deployment and sailing speeds along each chosen route. To solve the SCLP, we propose a new mixed integer programming model, where candidate ship routes are generated as input. We use our optimization model to analyze three future supply scenarios based on estimations of the volume of captured CO2 from emission sources in mainland Europe that is brought via ports of Antwerp, Dunkirk, Rotterdam and Wilhelmshaven to Norwegian storage sites. Our computational results show that the logistics cost per tonne of CO2 will be around 10 Euros in low volume scenarios and drop to about 8 Euros in high demand scenarios due to economies of scale. In the considered high demand scenario for the year 2050 about 100 ships are required that perform several thousand round trips per year within the considered port network.

关键词： Carbon capture and storage Maritime logistics system optimization Case study

来源：评论

学校读者我要写书评

暂无评论

AN ANALYSIS OF OPTIMIZED CAPEX FOR MULTI-CORE FIBER BASED OPTICAL NETWORKS

AN ANALYSIS OF OPTIMIZED CAPEX FOR MULTI-CORE FIBER BASED OP...

引用

the 13th international conference on Optical Communications and Networks, ICOCN 2014(2014第13届光通信与网络国际会议)

作者： Yao Li Nan Hua Xiaoping Zheng Tsinghua National Laboratory for Information Science and Technology Department of Electronic Engineering Tsinghua UniversityBeijing 100084P.R. China

In this article,we investigate the costs of optical network Capital Expenditure(CapEx)components which include fiber,optical amplifier(OA),cable and *** CapEx of high-capacity optical network under given traffic requests is optimized,and results are analyzed to evaluate the influences of Multi-core Fiber(MCF)communication system on the components of optical network *** solve the optimization problem,network CapEx is modelled and an integer linear programming(ILP)formulation is *** results show that by using MCF communication system,optical network CapEx can be reduced *** cost of OA takes the largest proportion of the network CapEx,and can be reduced by deploying MCF communication system to optical *** density can be increased by using MCF,thus decreasing the costs of cable and conduit.

关键词： Multi-core fiber Network CapEx optimization integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Parallel Hybrid Best-First Search 28

Parallel Hybrid Best-First Search

引用

28th international conference on Principles and Practice of Constraint programming, CP 2022

作者： Beldjilali, Abdelkader Montalbano, Pierre Allouche, David Katsirelos, George de Givry, Simon Université Fédérale de Toulouse INRAE UR 875 Toulouse31326 France Université Fédérale de Toulouse ANITI INRAE UR 875 Toulouse31326 France Université Fédérale de Toulouse ANITI INRAE MIA Paris AgroParisTech Paris75231 France

ISBN: (纸本)9783959772402

While processor frequency has stagnated over the past two decades, the number of available cores in servers or clusters is still growing, offering the opportunity for significant speed-up in combinatorial optimization. Parallelization of exact methods remains a difficult challenge. We revisit the concept of parallel Branch-and-Bound in the framework of Cost Function Networks. We show how to adapt the anytime Hybrid Best-First Search algorithm in a Master-Worker protocol. the resulting parallel algorithm achieves good load-balancing without introducing new parameters to be tuned as is the case, for example, in Embarrassingly Parallel Search (EPS). It has also a small overhead due to its light communication messages. We performed an experimental evaluation on several benchmarks, comparing our parallel algorithm to its sequential version. We observed linear speed-up in some cases. Our approach compared favourably to the EPS approach and also to a state-of-the-art parallel exact integer programming solver. © Abdelkader Beldjilali, Pierre Montalbano, David Allouche, George Katsirelos, and Simon de Givry.

关键词： combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共75页 << < 58 59 60 61 62 63 64 65 66 67 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：