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

The Quantitative Analysis of Equipment Operational Test Credibility Based on Dynamic programming and 0-1 integer linear programming

The Quantitative Analysis of Equipment Operational Test Cred...

引用

International Conference on Industrial Informatics - Computing Technology, Intelligent Technology, Industrial Information Integration

作者： Lei, Z. Sun, Y. Song, Y. H. Li, D. Acad Armored Force Engn Dept Sci Res Beijing Peoples R China Acad Armored Force Engn Dept Equipment Command & Adm Beijing Peoples R China

ISBN: (纸本)9781467383127

This paper takes the operational test credibility as the analysis object, designs multi-stage test patterns through quantitative decision analysis, thus maximizes the system test credibility. A dynamic programming based model for the credibility of equipment operational test is established. In addition, a method based on the 0-1 integer linear programming is also used and transformed to fit for the minimum path problem. The experimental results indicate that the methods proposed by this paper are effective and advanced.

关键词： dynamic programming 0-1 integer linear programming equipment operational test quantitative assessment

来源：评论

学校读者我要写书评

暂无评论

Multi-platform Air Defence Scheduling Based on 0-1 integer linear programming 4

Multi-platform Air Defence Scheduling Based on 0-1 Integer L...

引用

4th International Conference on Information Science and Control Engineering (ICISCE)

作者： Chen, Xingjun Shi, Hongquan Dalian Navy Acad Operat Software & Simulat Inst Dalian Peoples R China

ISBN: (纸本)9781538630136

In order to solve the nonlinear combinational optimization problem of weapons resources dynamic combination and target matching on different platforms stably and efficiently. Using the discrete time dynamic model of cooperative air defense, based on equivalent approximation of linear inequality combination to nonlinearity equation under the 0-1 integer linear feature, this paper establish a 0-1 integer linear programming model for the cooperative air defense scheduling, which provide a feasible theory scheme for the solution of global optimization scheme in the dynamic environment.

关键词： air defense scheduling multi-platform cooperative surface ship 0-1 integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Certifying MIP-Based Presolve Reductions for 0-1 integer linear Programs 21st

Certifying MIP-Based Presolve Reductions for 0-1 Integer Lin...

引用

21st International Conference on the Integration of Constraint programming, Artificial Intelligence, and Operations Research (CPAIOR)

作者： Hoen, Alexander Oerte, Andy Gleixner, Ambros Nordstrom, Jakob Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany HTW Berlin D-10313 Berlin Germany Lund Univ Lund Sweden Univ Copenhagen Copenhagen Denmark

ISBN: (纸本)9783031605963;9783031605970

It is well known that reformulating the original problem can be crucial for the performance of mixed-integer programming (MIP) solvers. To ensure correctness, all transformations must preserve the feasibility status and optimal value of the problem, but there is currently no established methodology to express and verify the equivalence of two mixed-integer programs. In this work, we take a first step in this direction by showing how the correctness of MIP presolve reductions on 0-1 integer linear programs can be certified by using (and suitably extending) the VeriPB tool for pseudo-Boolean proof logging. Our experimental evaluation on both decision and optimization instances demonstrates the computational viability of the approach and leads to suggestions for future revisions of the proof format that will help to reduce the verbosity of the certificates and to accelerate the certification and verification process further.

关键词： Proof logging Presolving 0-1 integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Exact and approximate algorithms for the index selection problem in physical database design

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 1995年第6期7卷 955-967页

作者： Caprara, A Fischetti, M Maio, D UNIV PADUA DEII-35131 PADUAITALY

The inner selection problem (ISP) is an important optimization problem in the physical design of databases, The aim of this paper is to show that ISP, although NP-hard, can in practice be solved effectively through well-designed algorithms. We formulate ISP as a 0-1 integer linear program and describe an exact branch-and-bound algorithm based on the linear programming relaxation of the model. The performance of the algorithm is enhanced by means of procedures to reduce the size of the candidate index set, We also describe heuristic algorithms based on the solution of a suitably defined knapsack subproblem and on Lagrangian decomposition. Finally, computational results on several classes of test problems are given. We report the exact solution of large-scale ISP instances involving several hundred indexes and queries. We also evaluate one of the heuristic algorithms we propose on very large-scale instances involving several thousand indexes and queries and show that it consistently produces very tight approximate (and sometimes provably optimal) solutions. Finally, we discuss possible extensions and future directions of research.

关键词： index selection problem relational database physical database design 0-1 integer linear programming branch-and-bound algorithm heuristic algorithm

来源：评论

学校读者我要写书评

暂无评论

High-level algorithms for the optimization of gate-level area in digit-serial multiple constant multiplications

引用

INTEGRATION-THE VLSI JOURNAL 2012年第3期45卷 294-306页

作者： Aksoy, Levent Lazzari, Cristiano Costa, Eduardo Flores, Paulo Monteiro, Jose INESC ID Lisbon Portugal Univ Catolica Pelotas Pelotas Brazil Univ Tecn Lisboa INESC ID IST Lisbon Portugal

The last two decades have seen tremendous effort on the development of high-level synthesis algorithms for efficient realization of the multiplication of a variable by a set of constants using only addition, subtraction, and shift operations. These algorithms generally target the minimization of the number of adders and subtractors, assuming that shifts are realized using only wires due to the bit-parallel processing of the input data. On the other hand, digit-serial architectures offer alternative low-complexity designs since digit-serial operators occupy less area and are independent of the data wordlength. However, in this case, shifts are no longer free in terms of hardware and require D flip-flops. Moreover, each digit-serial addition, subtraction, and shift operation has different implementation cost at gate-level. Hence, this article introduces high-level algorithms that optimize the area of digit-serial constant multiplications under the shift-adds architecture by taking into account the implementation cost of each operation at gate-level. Experimental results indicate that our high-level algorithms obtain better solutions than prominent algorithms designed for the minimization of the number of operations in terms of gate-level area and their solutions lead to less complex digit-serial MCM designs. It is also shown that the use of shift-adds architecture yields significant area reductions when compared to the constant multiplications designed using generic digit-serial constant multipliers. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Multiple constant multiplications Digit-serial architectures Gate-level area optimization 0-1 integer linear programming Graph-based algorithms

来源：评论

学校读者我要写书评

暂无评论

A three-layer over-the-cell multi-channel router for a new cell model

引用

INTEGRATION-THE VLSI JOURNAL 1996年第3期21卷 171-189页

作者： Koide, T Tsuchiya, M Wakabayashi, S Yoshida, N HIROSHIMA CITY UNIV FAC INFORMAT SCIASAMINAMI KUHIROSHIMA 73131JAPAN

This paper proposes a new cell model for over-the-cell routing, and presents a heuristic three-layer over-the-cell multi-channel routing method for the new cell model. In the proposed cell model, terminals can be placed arbitrarily on the second metal (M2) layer of a cell so that each cell does not require the extra routing region on the first metal(M1) layer of a cell to align terminals. Unlike conventional cell models, some parts of the M2 layer may also be utilized for intra-cell routing in order to reduce the chip area. Therefore the size of a cell with the proposed cell model can be smaller than that with conventional cell models. The proposed three-layer-over-the-cell routing method consists of three phases. In order to utilize the proposed cell model effectively, in phase 1, we simultaneously handle all channels to determine the most effective routing patterns from the set of possible routing patterns to minimize the chip area. In phase 2 for the routing patterns of nets selected in phase 1, over-the-cell routing nets are selected by a new greedy algorithm considering obstacles in over-the-cell regions. Finally, in phase 3, the conventional three-layer channel routing algorithm is applied for remaining nets. From the experimental results with MCNC benchmarks, the proposed cell model and routing algorithm produce the smaller height of layouts as compared to those produced by conventional cell models and algorithms, and the effectiveness of the proposed cell model and routing method was shown.

关键词： standard cell layout over-the-cell routing 0-1 integer linear programming horizontal constraint graph channel density

来源：评论

学校读者我要写书评

暂无评论

An efficient timing-driven global routing method for standard cell layout

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 1996年第10期E79D卷 1410-1418页

作者： Koide, T Suzuki, T Wakabayashi, S Yoshida, N Faculty of Engineering Hiroshima University Higashi-Hiroshima-shi 739 Japan Faculty of Information Sciences Hiroshima City University Hiroshima-shi 731-31 Japan

This paper presents a new timing-driven global routing method for standard cell layout. The proposed method can explicitly consider the timing constraint between two registers and minimize the channel density under the given timing constraint. In the proposed method, first, we determine the initial global routes. Next, we improve the global routes to satisfy the timing constraint between two registers as well as to minimize the channel density. Finally, for each cell row, the nets incident to terminals on the cell row are assigned to channels to minimize the channel density using 0-1 integer linear programming. We also show the experimental results of the proposed method implemented on an engineering workstation. Experimental results show that the proposed method is quite promising.

关键词： standard cell layout global routing timing constraints slack distribution 0-1 integer linear programming

来源：评论

学校读者我要写书评

暂无评论

A modeling and computational study of the frustration index in signed networks

引用

NETWORKS 2020年第1期75卷 95-110页

作者： Aref, Samin Mason, Andrew J. Wilson, Mark C. Max Planck Inst Demog Res Lab Digital & Computat Demog Rostock Germany Univ Auckland Sch Comp Sci Auckland New Zealand Univ Auckland Dept Engn Sci Auckland New Zealand

Computing the frustration index of a signed graph is a key step toward solving problems in many fields including social networks, political science, physics, chemistry, and biology. The frustration index determines the distance of a network from a state of total structural balance. Although the definition of the frustration index goes back to the 1950s, its exact algorithmic computation, which is closely related to classic NP-hard graph problems, has only become a focus in recent years. We develop three new binary linear programming models to compute the frustration index exactly and efficiently as the solution to a global optimization problem. Solving the models with prioritized branching and valid inequalities in Gurobi, we can compute the frustration index of real signed networks with over 15 000 edges in less than a minute on inexpensive hardware. We provide extensive performance analysis for both random and real signed networks and show that our models outperform all existing approaches by large factors. Based on resolution time, algorithm output, and effective branching factor we highlight the superiority of our models to both exact and heuristic methods in the literature.

关键词： 0-1 integer linear programming balance theory binary programming frustration index line index of balance optimization signed graph signed networks

来源：评论

学校读者我要写书评

暂无评论

An iterative improvement approach for high-speed train maintenance scheduling

引用

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2023年第1期173卷 292-312页

作者： Lin, Boliang Shen, Yaoming Wang, Zhongkai Ni, Shaoquan Zhao, Yinan Beijing Jiaotong Univ Sch Traff & Transportat Beijing 100044 Peoples R China China Acad Railway Sci Co Ltd Inst Comp Technol Beijing 100081 Peoples R China Southwest Jiaotong Univ Sch Transportat & Logist Chengdu 610031 Peoples R China

The high-level maintenance plan is the train-set overhaul arrangement that is scheduled annually and manually in China. Previous studies have investigated this issue based on deterministic daily mileages. However, future daily mileages are difficult to predict, which may cause existing plans to be inaccurate and unfeasible in practice. Therefore, this study only considers the historical daily mileages as raw inputs, and the future daily mileages are considered as ranges to generate wider maintenance time windows for train-sets. Subsequently, a 0-1 integer linear programming model for high-level maintenance scheduling is formulated. After obtaining a high-level maintenance plan, the planned daily mileages of all train-sets are calculated and verified. To make all planned daily mileages feasible, we design an iterative algorithm to adjust the time windows and update the plan. A real-world case study is conducted using the data of 124 CRH2 EMU train-sets belonging to China Railway Shanghai Group to prove the effectiveness of the model and the algorithm. The commercial solver Gurobi is used to solve this case. A program supporting high-level maintenance scheduling has been developed, and it has been used by planners for testing.

关键词： High-speed railway High-level maintenance planning Daily mileage 0-1 integer linear programming Iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

The design of a 0-1 integer optimizer and its application in the Carmen system

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 1995年第3期87卷 722-730页

作者： Wedelin, D CHALMERS UNIV TECHNOL DEPT COMP SCI S-41296 GOTHENBURG SWEDEN

We describe the design of an optimizer for 0-1 integer programming aimed at solving large problems. The algorithm is based on very simple operations giving it a low complexity, and we show that for large set covering problems it can produce very good solutions compared to other methods. This is the only optimizer in the Carmen system for airline crew scheduling, used by several major European airlines, and we discuss how it has affected the overall design and success of this system.

关键词： 0-1 integer linear programming efficient algorithms set covering airline crew scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：