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

A Parallel Macro Partitioning framework for solving mixed integer programs 1

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

作者： Namazifar, Mahdi Miller, Andrew J. Univ Wisconsin Dept Ind & Syst Engn Madison WI 53706 USA

ISBN: (数字)9783540681557

ISBN: (纸本)9783540681540

Mixed integer Programs are a class of optimization problems which have a vast range of applications in engineering, business, science, health care, and other areas. For many applications, however, problems of realistic size can take a an impractical amount of time to solve on a single workstation. However, using parallel computing resources to solve MIP is difficult, as parallelizing the standard branch-and-bound framework presents an array of challenges. In this paper we present a novel framework called a Parallel Macro Partitioning (PMaP) framework for solving mixed integer programs in parallel. the framework exploit ideas from modern MIP heuristics to partition the problem at a high-level into MIP subproblems, each of which can be solved on a separate processor by an MIP algorithm. Initial computational resources suggest that PMaP has significant promise as a framework capable of bringing many processors to bear effectively on difficult problems.

关键词： high-performance computing mixed integer programming primal heuristics branch-and-bound

来源：评论

学校读者我要写书评

暂无评论

Surplus optimization in combinatorial Double Auctions

Surplus Optimization in Combinatorial Double Auctions

引用

6th international conference on New Trends in Information Science, Service Science and Data Mining (ISSDM)

作者： Hsieh, Fu-Shiung Liao, Chi-Shiang Chaoyang Univ Technol Dept Comp Sci & Informat Engn Taichung Taiwan

ISBN: (纸本)9781467308762

Although combinatorial double auctions can improve the efficiency of trading goods between buyers and sellers, several issues of combinatorial double auctions are not addressed. For example, an auction mediator usually charges transaction costs to the winners of combinatorial double auctions. Furthermore, a seller may submit multiple bids, but all the winning bids submitted by a seller cannot exceed the available items. these factors are not taken into account in existing literature. In this paper, we study combinatorial double auction problem with transaction costs and supply constraints. We formulate the combinatorial double auction problem and propose an algorithm for finding near optimal solutions. combinatorial double auctions are notoriously difficult to solve from a computational point of view. To reduce computational complexity, we propose an efficient method by decomposing the combinatorial double auction problem into several buyers' subproblems and sellers' subproblems and applying the subgradient algorithm to iteratively adjust the shadow prices and a heuristic algorithm to find a near-optimal solution. the effectiveness of the proposed algorithm is also demonstrated by a numerical example.

关键词： combinatorial double auction integer programming winner determination problem

来源：评论

学校读者我要写书评

暂无评论

Transmission Capacity Margin Assessment in Power Systems with Uncertain Wind Integration 13

Transmission Capacity Margin Assessment in Power Systems wit...

引用

13th IEEE conference on Automation Science and Engineering (IEEE CASE)

作者： Yang, Yafei Lei, Xuejiao Zhai, Qiaozhu Wu, Jiang Guan, Xiaohong Xi An Jiao Tong Univ Syst Engn Inst MOE KLINNS Lab Xian 710049 Shaanxi Peoples R China Tsinghua Univ Ctr Intelligent & Networked Syst Beijing Peoples R China State Grid Energy Res Inst Beijing 102209 Peoples R China

ISBN: (纸本)9781509067817

High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacity margin assessment (TCMA) is established to quantify the transmission security with uncertain wind generation. the basic formulation is reformulated as a two-stage non-differentiable programming model. It can be transformed into a mixed integer linear programming (MILP) by duality theory and specific linearization techniques. Furthermore, an effective procedure is developed to improve the transmission capacity margin by necessary wind curtailment. A detailed case study is performed on the IEEE 31-bus system and numerical results verify the effectiveness of this TCMA framework.

关键词： Security Wind power generation Uncertainty Power transmission lines programming Linearization techniques optimization

来源：评论

学校读者我要写书评

暂无评论

QoE-aware Data Caching optimization in Edge Computing Environment

QoE-aware Data Caching Optimization in Edge Computing Enviro...

引用

IEEE international conference on Services Computing (IEEE SCC)

作者： Ni, Zhengguo Yuan, Min Tang, Hancheng Nanjing Normal Univ Sch Comp & Elect Informat Sch Artificial Intelligence Nanjing Peoples R China

ISBN: (数字)9781665481465

ISBN: (纸本)9781665481465

Edge computing provides users with computing resources and storage capacity by deploying edge servers around users. Existing edge data caching researches mainly focused on minimizing users' access latency and maximizing service providers' revenue. In this paper, this QEDC problem is addressed from the service provider's point of view. Firstly, this QoE-oriented Edge Data Caching(QEDC) problem is modeled as a combinatorial optimization problem. Users' QoE achieves maximization while satisfying a constraint for service providers' cache budget, and its NP-hardness is proved. Secondly, an edge data fusion method is introduced which is more suitable for real environment and the calculation method of data popularity. In addition, all approach named QEDC-IP is provided based on integer programming to tackle this QEDC problem. Finally, a large number of experiments are conducted by using a mixture of real-world datasets, and the results verify the performance of QEDC-IP approach by comparing it with five representative approaches in data caching.

关键词： edge computing data caching quality of experience constrained optimization data fusion

来源：评论

学校读者我要写书评

暂无评论

Improved Methods for Computing Distances Between Unordered Trees Using integer programming 11th

Improved Methods for Computing Distances Between Unordered T...

引用

11th Annual international conference on combinatorial optimization and Applications (COCOA)

作者： Hong, Eunpyeong Kobayashi, Yasuaki Yamamoto, Akihiro Kyoto Univ Kyoto Japan

ISBN: (纸本)9783319711478;9783319711461

Kondo et al. (DS 2014) proposed integer linear programming formulations for computing the tree edit distance and its variants between unordered rooted trees. they showed that the tree edit distance, segmental distance, and bottom-up segmental distance problems respectively have integer linear programming formulations with O(nm) variables and O(n(2) m(2)) constraints, where n and m are the number of nodes of two input trees. In this work, we propose new integer linear programming formulations for these three distances and the bottom-up distance by combining with dynamic programming. For computing the tree edit distance, we solve O(nm) subproblems, each of which is formulated by an integer linear program with O(nm) variables and O(n + m) constraints. For the other three distances, each subproblem can be reduced to the maximum weight matching problem in a bipartite graph which is solvable in polynomial time. In order to compute the distances from the solutions of subproblems, we also give a unified integer linear formulation with O(nm) variables and O(n + m) constraints. We conducted a computational experiment to evaluate the performance of our methods. the experimental results show that our methods remarkably outperformed to the previous methods due to Kondo et al.

关键词： Tree edit distance Unorderd trees integer programming Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

integer programming and Combinatoral optimization 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Oktay Günlük Gerhard J. Woeginger

ISBN: (数字)9783642208072

ISBN: (纸本)9783642208065

this book constitutes the proceedings of the 15th international conference on integer programming and combinatorial optimization, IPCO 2011, held in New York, USA in June 2011. the 33 papers presented were carefully reviewed and selected from 110 submissions. the conference is a forum for researchers and practitioners working on various aspects of integer programming and combinatorial optimization with the aim to present recent developments in theory, computation, and applications. the scope of IPCO is viewed in a broad sense, to include algorithmic and structural results in integer programming and combinatorial optimization as well as revealing computational studies and novel applications of discrete optimization to practical problems.

关键词： Algorithm Analysis and Problem Complexity Discrete Mathematics in Computer Science Computer Graphics Data Structures Numeric Computing Computer Communication Networks

来源：评论

学校读者我要写书评

暂无评论

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Products 1

引用

24th international conference on integer programming and combinatorial optimization (IPCO)

作者： Bestuzheva, Ksenia Gleixner, Ambros Achterberg, Tobias Zuse Inst Berlin Berlin Germany HTW Berlin Berlin Germany Gurobi GmbH Frankfurt Germany

ISBN: (数字)9783031327261

ISBN: (纸本)9783031327254;9783031327261

the reformulation-linearization technique (RLT) is a prominent approach to constructing tight linear relaxations of non-convex continuous and mixed-integer optimization problems. the goal of this paper is to extend the applicability and improve the performance of RLT for bilinear product relations. First, a method for detecting bilinear product relations implicitly contained in mixed-integer linear programs is developed based on analyzing linear constraints with binary variables, thus enabling the application of bilinear RLT to a new class of problems. Our second contribution addresses the high computational cost of RLT cut separation, which presents one of the major difficulties in applying RLT efficiently in practice. We propose a new RLT cutting plane separation algorithm which identifies combinations of linear constraints and bound factors that are expected to yield an inequality that is violated by the current relaxation solution. A detailed computational study based on implementations in two solvers evaluates the performance impact of the proposed methods.

关键词： Reformulation-linearization technique Bilinear products Cutting planes Mixed-integer programming

来源：评论

学校读者我要写书评

暂无评论

A hybrid constraint programming approach to the log-truck scheduling problem

引用

ANNALS OF OPERATIONS RESEARCH 2011年第1期184卷 163-178页

作者： El Hachemi, Nizar Gendreau, Michel Rousseau, Louis-Martin Interuniv Res Ctr Enterprise Networks Logist & Tr Montreal PQ H3C 3J7 Canada

Scheduling problems in the forest industry have received significant attention in the recent years and have contributed many challenging applications for optimization technologies. this paper proposes a solution method based on constraint programming and mathematical programming for a log-truck scheduling problem. the problem consists of scheduling the transportation of logs between forest areas and woodmills, as well as routing the fleet of vehicles to satisfy these transportation requests. the objective is to minimize the total cost of the non-productive activities such as the waiting time of trucks and forest log-loaders and the empty driven distance of vehicles. We propose a constraint programming model to address the combined scheduling and routing problem and an integer programming model to deal with the optimization of deadheads. Both of these models are combined through the exchange of global constraints. Finally the whole approach is validated on real industrial data.

关键词： CONSTRAINT programming (Computer science) LOGGING trucks SCHEDULING FOREST products industry MAthEMATICAL programming APPROPRIATE technology LOGGING

来源：评论

学校读者我要写书评

暂无评论

Cost-bounded binary decision diagrams for 0-1 programming

引用

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

作者： Hadzic, Tarik Hooker, J. N. IT Univ Copenhagen Rued Langgaards Vej 7 DK-2300 Copenhagen Denmark Carnegie Mellon Univ Pittsburgh PA 15213 USA

In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller BDDs can be used for the same analysis by empl... 详细信息

ISBN: (纸本)9783540723967

关键词： Binary decision diagrams

来源：评论

学校读者我要写书评

暂无评论

RESEARCH ON LOGISTICS LOCATION optimization MODEL BASED ON TIME DIMENSIONS

RESEARCH ON LOGISTICS LOCATION OPTIMIZATION MODEL BASED ON T...

引用

13th international conference on Enterprise Information Systems (ICEIS 2011)

作者： Zhao, Jiuguo Beijing Jiaotong Univ Sch Econ & Management 3 Shang Yuan Cun Beijing Peoples R China

ISBN: (纸本)9789898425560

the classical logistics facility location models seldom lay emphasis on time, which is a critical issue for a company to gain its competitive advantage nowadays. Some scholars study maximal covering location problem based on time-satisfaction, but most of them have not taken the consumption of time cost into account. this paper presents a new location model which incorporates time cost compared with previous approaches of time satisfaction. the model is initially developed based on the integer programming, whose objective function is subject to the maximization of total satisfaction and the minimization of total cost. Finally, it makes precise analysis taking the case of a regional network layout optimization. the computational result proves the feasibility and value of this model in its practical application.

关键词： Location model Time-satisfaction Time cost Service facility

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：