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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,741 篇 期刊文献
519 篇 会议
25 篇 学位论文

馆藏范围

2,285 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,002 篇 工学
- 954 篇 计算机科学与技术...
- 561 篇 电气工程
- 533 篇 软件工程
- 383 篇 石油与天然气工程
- 271 篇 动力工程及工程热...
- 171 篇 化学工程与技术
- 149 篇 控制科学与工程
- 140 篇 交通运输工程
- 134 篇 机械工程
- 119 篇 信息与通信工程
- 83 篇 土木工程
- 66 篇 环境科学与工程（可...
- 33 篇 建筑学
- 29 篇 电子科学与技术（可...
- 27 篇 力学（可授工学、理...
- 23 篇 安全科学与工程
- 19 篇 材料科学与工程（可...
- 16 篇 航空宇航科学与技...
- 12 篇 水利工程
790 篇 理学
- 724 篇 数学
- 52 篇 系统科学
- 48 篇 统计学（可授理学、...
- 34 篇 化学
- 24 篇 物理学
- 21 篇 生物学
633 篇 管理学
- 608 篇 管理科学与工程(可...
- 139 篇 工商管理
- 14 篇 图书情报与档案管...
162 篇 经济学
- 126 篇 应用经济学
- 34 篇 理论经济学
20 篇 农学
15 篇 医学
10 篇 法学
4 篇 教育学
1 篇 军事学

主题

2,285 篇 mixed-integer li...
143 篇 optimization
63 篇 scheduling
52 篇 unit commitment
44 篇 multi-objective ...
39 篇 demand response
39 篇 linear programmi...
36 篇 robust optimizat...
29 篇 stochastic progr...
29 篇 uncertainty
28 篇 energy storage
27 篇 energy managemen...
26 篇 electric vehicle...
26 篇 genetic algorith...
25 篇 model predictive...
22 篇 renewable energy
21 篇 integer programm...
20 篇 energy managemen...
20 篇 stochastic optim...
19 篇 transmission exp...

机构

16 篇 osaka prefecture...
10 篇 carnegie mellon ...
10 篇 dalian univ tech...
9 篇 mcgill univ dept...
8 篇 fuzhou univ sch ...
8 篇 georgia inst tec...
7 篇 beihang univ sch...
7 篇 univ utah dept e...
7 篇 univ tehran coll...
7 篇 beijing jiaotong...
6 篇 natl univ singap...
5 篇 fujian normal un...
5 篇 chinese acad sci...
5 篇 univ houston dep...
5 篇 zuse inst berlin...
5 篇 univ michigan de...
5 篇 univ castilla la...
5 篇 univ bern dept b...
5 篇 tsinghua univ de...
5 篇 aalto univ dept ...

作者

21 篇 yokoyama ryohei
20 篇 wakui tetsuya
18 篇 romero ruben
18 篇 fotuhi-firuzabad...
18 篇 rider marcos j.
16 篇 grossmann ignaci...
13 篇 macedo leonardo ...
13 篇 franco john f.
13 篇 lehtonen matti
12 篇 parvania masood
11 篇 contreras javier
11 篇 gicquel celine
11 篇 jooshaki mohamma...
10 篇 cheng chuntian
10 篇 liang yongtu
10 篇 michels adalbert...
10 篇 castro pedro m.
9 篇 catalao joao p. ...
9 篇 papageorgiou laz...
9 篇 zhang haoran

语言

1,902 篇 英文
350 篇 其他
18 篇 中文
4 篇 德文
3 篇 法文
1 篇 西班牙文
1 篇 日文
1 篇 朝鲜文

检索条件"主题词=Mixed-integer linear programming"

共 2285 条记录，以下是281-290 订阅

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

详细简洁

排序：

A 1.5-Approximation Algorithm for Activating Two Disjoint st-Paths 20th

A 1.5-Approximation Algorithm for Activating Two Disjoint s...

引用

20th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2024

作者： Nutov, Zeev Kahba, Dawod The Open University of Israel Ra’anana Israel

ISBN: (纸本)9783031745799

In the ActivationkDisjointst-Paths (Activationk-DP) problem we are given a graph G=(V,E) with activation costs {cuvu,cuvv} for every edge uv∈E, a source-sink pair s,t∈V, and an integer k. The goal is to compute an edge set F⊆E of k internally node disjoint st-paths of minimum activation cost ∑v∈Vmaxuv∈Fcuvv. The problem admits an easy 2-approximation algorithm. Alqahtani & Erlebach [1] claimed that Activation 2-DP admits a 1.5-approximation algorithm. The proof in [1] has an error, and we will show that the approximation ratio of their algorithm is at least 2. We will then give a different algorithm with approximation ratio 1.5. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

SCUC/SCED Autonomous and Controllable Modeling and Comparative Analysis of Multiple Solvers 9th

SCUC/SCED Autonomous and Controllable Modeling and Comparati...

引用

9th Purple Mountain Form on Smart Grid Protection and Control, PMF 2024

作者： Zhang, Yantao Chang, Li Teng, Xianliang Xu, Lizhong Tang, Qiwen Wang, Jili Wang, Wen Nanjing211106 China NARI Technology Co. Ltd. Nanjing211106 China State Grid Zhejiang Electric Power Co. Ltd. Hangzhou310007 China

ISBN: (纸本)9789819616701

In the face of increasingly complex international relations, the core algorithm SCUC/SCED in the field of power dispatch, which has long relied on foreign optimization solvers, faces enormous technical risks of being stuck in the neck. There is an urgent need to replace SCUC/SCED with domestic optimization solvers. To achieve unified construction of SCUC/SCED models under different optimization solvers and flexible calling of different solvers, a Python based autonomous and controllable modeling language was proposed, and an SCUC/SCED optimization model was constructed. Based on an actual calculation cases of a provincial power grid, optimization solvers such as COPT, MindOpt, SCIP, GUROBI, CPLEX, etc. were called to solve the problem. The effectiveness of the autonomous controllable modeling language and the convergence, stability, and efficiency of the domestically produced solver were verified, and it was proved that the SCUC/SCED algorithm has the substitute conditions for the domestically produced optimization solver. © State Grid Electric Power 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Applying Instance Space Analysis to Optimize the Construction of Matheuristics 18th

Applying Instance Space Analysis to Optimize the Construct...

引用

18th International Conference on Learning and Intelligent Optimization, LION 2024

作者： Hildebrandt, Sophie Sand, Guido Pforzheim University of Applied Science Pforzheim Germany University of Twente Enschede Netherlands

ISBN: (纸本)9783031756221

The combination of mathematical programming and heuristics is known as matheuristic. Constructing a matheuristic comprises two steps: First selecting its components, second parameterizing those components. The construction of a matheuristic is often done manually by experts, which leads to expensive engineering processes. To bring matheuristics into practice, their construction should be automated. In this paper a matheuristic construction approach is proposed to close this gap. The approach is based on instance space analysis for the selection and Bayesian optimization for the parametrization of the matheuristic. First computational studies show, how Bayesian optimization can be used to parameterize an original heuristic. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Explicit Bounds for Large Gaps Between Cubefree integers 20th

Explicit Bounds for Large Gaps Between Cubefree Integers

引用

20th Combinatorial and Additive Number Theory, New York Number Theory Seminar, CANT 2022 and 21st Combinatorial and Additive Number Theory, New York Number Theory Seminar, CANT 2023

作者： Kumchev, Angel McCormick, Wade McNew, Nathan Park, Ariana Scherr, Russell Ziehr, Willow Department of Mathematics Towson University Towson MD21252 United States Department of Mathematics Northwestern University EvanstonIL60208 United States School of Mathematics University of Minnesota Twin Cities MinneapolisMN55455 United States Department of Mathematics University of California Berkeley BerkeleyCA94720 United States

ISBN: (纸本)9783031650635

We obtain explicit forms of the current best known asymptotic upper bounds for gaps between cubefree integers. In particular, we show that the interval (Formula presented) contains a cubefree integer for any (Formula presented). The constant 5 can be improved further, if. x is assumed to be larger than a very large constant. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Optimization for Cross-Regional Planning and Scheduling of Hydrogen Energy Storage Systems Considering Uncertainty

Hierarchical Optimization for Cross-Regional Planning and Sc...

引用

International Conference of Electrical, Electronic and Networked Energy Systems, EENES 2024

作者： Tang, Zihang Wang, Yingxiao Liu, Yuqian Wu, Jianghua School of Computer Science and Technology Xi’an Jiaotong University Xi’an 710049 China Department of Mathematics Nanjing University Nanjing210023 China Shenzhen Research Institute of Big Data the Chinese University of Hong Kong-Shenzhen Guangdong Shenzhen518172 China

ISBN: (纸本)9789819620418

Cross-regional Hydrogen Energy Storage System (HESS) effectively addresses the uneven spatial and temporal distribution of renewable energy sources by facilitating energy storage, transfer, and scheduling across regions. However, the intermittency of renewable energy sources, dynamic changes in demand, and the high costs pose complex challenges for the planning and scheduling of cross-regional HESSs. Although hierarchical modeling, which is divided into upper-level planning and lower-level scheduling, provides flexibility and robustness in handling uncertainties, the difficulties of high model complexity and low solution efficiency still exist. To this end, this paper improves hierarchical modeling by introducing the concept of dynamic transmission price into HESS, which quantifies the difficulty of transferring stored energy to neighboring cities. This concept then guides the energy trading decisions and the power distribution strategies among HESS, eliminating the need to consider the discrete variable of cross-regional connections in the lower-level scheduling for the significant simplification of the solution process. In addition, this paper synchronously integrates simulated annealing and linear programming algorithms as an efficient optimization approach for this novel hierarchical modeling. A case study considering 50 cities demonstrates the feasibility of the hierarchical model and the effectiveness of the optimization approach, providing strong support for the large-scale consumption and absorption of renewable energy across regions. © Beijing Paike Culture Commu. Co., Ltd. 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

The Use of Artificial Intelligence for the Unit Commitment Problem: State of the Art

The Use of Artificial Intelligence for the Unit Commitment P...

引用

International Conference of the TC Electrimacs Committee, ELECTRIMACS 2024

作者： Milla, José Pérez-Díaz, Juan I. Department of Hydraulic Energy and Environmental Engineering Universidad Politécnica de Madrid Madrid Spain

ISBN: (纸本)9783031739200

With the increasing complexity of the electricity network, optimizing short-term planning for unit commitment (UC) demands more time and resources. This has prompted many researchers in the field to explore alternative methods, serving as auxiliary accelerators or even replacements for classical mixed integer programming (MIP) algorithms. The core idea behind these alternatives is to leverage the fact that the UC problem is typically solved daily by Independent System Operators (ISOs) with minor changes, resulting in a substantial amount of available data. This characteristic makes the problem particularly suitable for Artificial Intelligence (AI) techniques, such as Machine Learning (ML). This paper aims to delineate the state of the art of AI applied to the UC problem, categorizing articles based on the different AI techniques employed and the characteristics and complexity of the UC problem addressed. Additionally, it seeks to compare the outcomes achieved. As of the author’s knowledge, this systematization task has not yet been accomplished in this emerging research area. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Forbidden Patterns in mixed linear Layouts 42

Forbidden Patterns in Mixed Linear Layouts

引用

42nd International Symposium on Theoretical Aspects of Computer Science, STACS 2025

作者： Haun, Deborah Merker, Laura Pupyrev, Sergey Karlsruhe Institute of Technology Germany Menlo Park CA United States

ISBN: (纸本)9783959773652

An ordered graph is a graph with a total order over its vertices. A linear layout of an ordered graph is a partition of the edges into sets of either non-crossing edges, called stacks, or non-nesting edges, called queues. The stack (queue) number of an ordered graph is the minimum number of required stacks (queues). mixed linear layouts combine these layouts by allowing each set of edges to form either a stack or a queue. The minimum number of stacks plus queues is called the mixed page number. It is well known that ordered graphs with small stack number are characterized, up to a function, by the absence of large twists (that is, pairwise crossing edges). Similarly, ordered graphs with small queue number are characterized by the absence of large rainbows (that is, pairwise nesting edges). However, no such characterization via forbidden patterns is known for mixed linear layouts. We address this gap by introducing patterns similar to twists and rainbows, which we call thick patterns;such patterns allow a characterization, again up to a function, of mixed linear layouts of bounded-degree graphs. That is, we show that a family of ordered graphs with bounded maximum degree has bounded mixed page number if and only if the size of the largest thick pattern is bounded. In addition, we investigate an exact characterization of ordered graphs whose mixed page number equals a fixed integer k via a finite set of forbidden patterns. We show that for k = 2, there is no such characterization, which supports the nature of our first result. © Deborah Haun, Laura Merker, and Sergey Pupyrev.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

The flex-route transit planning problem with meeting points

The flex-route transit planning problem with meeting points

引用

作者： Li, Mingyang Wu, Lingxiao Wang, Yadong Tang, Jinjun Feng, Tao Smart Transportation Key Laboratory of Hunan Province School of Traffic and Transportation Engineering Central South University Changsha410075 China Department of Aeronautical and Aviation Engineering The Hong Kong Polytechnic University Hong Kong School of Economics and Management Nanjing University of Science and Technology Nanjing210094 China Department of Logistics and Maritime Studies Faculty of Business The Hong Kong Polytechnic University Hong Kong

As an innovative alternative to ridesharing, flex-route transit (FRT) is widely acknowledged as a promising solution, especially in scenarios in which transportation demand is low or dispersed. This paper addresses the FRT planning problem with meeting points (FRTPP-MP), which conceptualizes each passenger's pick-up/drop-off request as a set of points (i.e., a cluster) containing the designated pick-up/drop-off point and alternative points (i.e., meeting points), stipulating that only one point in each cluster needs to be visited to fulfill the request. The aim is to minimize both the travel cost of vehicles and the walking cost of passengers by simultaneously optimizing the routes of vehicles and the selection of nodes within their respective clusters. We formulate the FRTPP-MP as a mixed-integer programming (MIP) model and develop an exact branch-and-price (BAP) algorithm to solve it. To tackle the specific challenges of cluster visit restrictions in the pricing problem, we design a tailored bidirectional label correction algorithm (TBLCA), which is further enhanced by a novel acceleration strategy. Extensive computational experiments are conducted based on benchmark instances generated from a real-life FRT system. The numerical results highlight our solution algorithm's satisfactory performance. Furthermore, managerial insights from a sensitivity analysis suggest that introducing meeting points can substantially reduce the costs associated with FRT. © 2025 Elsevier Ltd

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Research on the Optimization of Emergency Material Distribution Routes Considering Fairness and Efficiency 14

Research on the Optimization of Emergency Material Distribut...

引用

14th International Conference on Logistics and Systems Engineering

作者： Sun, Haobo Tong, Zeping School of Management Wuhan University of Science and Technology Wuhan430065 China

ISBN: (纸本)9798331314347

In post-disaster relief scenarios, achieving equitable and efficient humanitarian logistics is crucial for the timely delivery of relief materials and the alleviation of suffering among affected populations. This paper integrates the dual objectives of efficiency and equity in conducting optimization research on emergency material distribution routes. It employs deprivation costs arising from material shortages to quantify fairness. A mixed-integer nonlinear programming model was constructed with the goal of minimizing transportation and deprivation costs, and a variable neighborhood search-based metaheuristic algorithm was developed. Using the 2008 Wenchuan earthquake as a case study, the algorithm was implemented and solved using MATLAB 2020b software, yielding the optimal distribution routes and costs. The experimental results confirm that the model and algorithm proposed in this paper are practical and effective in optimizing emergency material distribution routes. © (2025) by Aussino Academic Publishing House All rights reserved.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Energy-Aware Blocking Hybrid Flow Shop Scheduling Problem with Sequence-depend Setup Times and Machine Speed Levels 6

Energy-Aware Blocking Hybrid Flow Shop Scheduling Problem wi...

引用

6th International Conference on Industry 4.0 and Smart Manufacturing, ISM 2024

作者： Missaoui, Ahmed Ozturk, Cemalettin O'Sullivan, Barry Insight Centre for Data Analytics University College Cork Ireland Process Energy and Transport Engineering Munster Technological University Cork Ireland

The industry sector has the second largest energy demand after electricity generation. Given the high trend of energy prices, scarcity of its supply due to political instability and dependency on fossil fuels for its production makes energy the primary challenge for the manufacturing sector to stay competitive. Therefore, in addition to novel equipment technologies that use less energy, energy-efficient scheduling has also been a priority for manufacturing companies. In this study, the Hybrid Flowshop Scheduling Problem with Blocking Constraints and Sequence-Depend Setup Times (BHFS-SDST) is investigated for the minimization of makespan and total energy consumption (TEC). First, a novel bi-objective mixed integer linear programming (MILP) model is formulated and solved through augmented epsilon constraints. Then, a novel multi-objective approach based on Iterated Greedy meta-heuristic is developed for larger instances. Efficiency and the scalability of the proposed approaches are tested with small, medium, and large instances. Computational experiments show the effectiveness of developed methods in solving the BHFS-SDST problem. © 2025 The Authors.

关键词： mixed-integer linear programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共229页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：