Quadratic Assignment and Related Problems最新文献

Using QAP Bounds for the Circulant TSP to Design Reconfigurable 基于QAP边界的循环TSP可重构设计

Quadratic Assignment and Related Problems Pub Date : 1994-08-17 DOI: 10.1090/dimacs/016/14

E. Medova

引用次数: 9

Difficulties of Exact Methods for Solving the Quadratic Assignment Problem 求解二次分配问题的精确方法的难点

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/13

T. Mautor, C. Roucairol

引用次数: 12

A Reformulation Scheme and New Lower Bounds for the QAP 质量评估计划的重新制定方案和新的下界

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/06

P. Carraresi, F. Malucelli

引用次数: 30

Partitioning Multiple Data Sets: Multidimensional Assignments and Lagrangian Relaxation 多数据集划分:多维分配和拉格朗日松弛

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/16

A. Poore, N. Rijavec

引用次数: 17

Genetic Hybrids for the Quadratic Assignment Problem 二次分配问题的遗传杂交

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/08

C. Fleurent, J. Ferland

引用次数: 277

Advanced Search Techniques for Circuit Partitioning 电路划分的高级搜索技术

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/03

S. Areibi, A. Vannelli

{"title":"Advanced Search Techniques for Circuit Partitioning","authors":"S. Areibi, A. Vannelli","doi":"10.1090/dimacs/016/03","DOIUrl":"https://doi.org/10.1090/dimacs/016/03","url":null,"abstract":"Most real world problems especially circuit layout and VLSI design are too complex for any single processing technique to solve in isolation. Stochastic, adaptive and local search approaches have strengths and weaknesses and should be viewed not as competing models but as complimentary ones. This paper describes the application of a combined Tabu Search 1] and Genetic Algorithm heuristic to guide an eecient interchange algorithm to explore and exploit the solution space of a hypergraph partitioning problem. Results obtained indicate, that the generated solutions and running time of this hybrid are superior to results obtained from a combined eigenvector and node interchange method 11]. 1. Introduction In the combinatorial sense, the layout problem is a constrained optimization problem. We are given a description of a circuit (usually called a netlist) which is a description of switching elements and their connecting wires. We seek an assignment of geometric coordinates of the circuit components that satisses the requirements of the fabrication technology (suucient spacing between wires, restricted number of wiring layers, and so on), and that minimizes certain cost criteria. Practically all versions of the layout problem as a whole are intractable; that is, they are NP-hard. Thus, we have to resort to heuristic methods to attempt to solve such problems. One of these methods is to break up the problem into subproblems (circuit partitioning, component placement and wire routing).","PeriodicalId":376860,"journal":{"name":"Quadratic Assignment and Related Problems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114631544","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 30

Improved Linear Programming-based Lower Bounds for the Quadratic Assignment Proglem 基于改进线性规划的二次分配问题下界

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/02

Warren P. Adams, T. Johnson

引用次数: 173

A Constructive Method to Improve Lower Bounds for the Quadratic Assignment Problem 一种改进二次分配问题下界的构造方法

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/07

Jaishankar Chakrapani, J. Skorin-Kapov

引用次数: 9

A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem 一类特殊的二次分配问题的遗传算法

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/04

T. N. Bui, B. Moon

{"title":"A Genetic Algorithm for a Special Class of the Quadratic Assignment Problem","authors":"T. N. Bui, B. Moon","doi":"10.1090/dimacs/016/04","DOIUrl":"https://doi.org/10.1090/dimacs/016/04","url":null,"abstract":"A special class of the quadratic assignment problem (QAP) is considered. This class of QAP describes the multiway partitioning problem which is the problem of partitioning a graph into disjoint subgraphs of prescribed sizes by removing the fewest number of edges. A genetic algorithm (GA) for solving this problem is described. A novel feature of this algorithm is the schema preprocessing phase that helps create important building blocks, which in turn improves the performance of the GA. Experimental tests on graphs with published solutions showed that the algorithm performed comparable to or better than the simulated annealing algorithm. Consider the quadratic assignment problem (QAP) where the n x n flow matrix F is a 0-1 symmetric matrix with O'son the main diagonal and the n x n distance matrix D is a block matrix of the form whereObi is a bi x bi matrix of all zeros, for integers b1, ... , bk such that L:~=lbi = n. All other entries of Dare 1. This QAP can be easily seen to describe the followinggraph problem. Let G = (V,E) be an undirected graph on n vertices and k integers b1, ... ,bk be given. The multiway partitioning problem is the 1993 Mathematics Subject Classification. Primary 65KlO; Secondary 68T05, 68RlO. This paper is in preliminary form. problem of finding the smallest set of edges in G whose removal separates G into k disjoint subgraphs Gi = (Vi, Ei), i = 1, ... ,k such that (i) IViI = bi, for all i, (ii) U~=lVi = V, and (iii) Vj n Vi = 0 for j f. t. In other words, it is the problem of finding a partition of the vertex set V into k disjoint subsets of specified sizes and minimizing the number of edges with endpoints in different subsets of the partition. The number of edges having endpoints in different parts of the partition is called the size or cut size of the partition. The flowmatrix F in the QAP is simply the adjacency matrix of the graph G and the number of edges connecting different parts of the partition, Le., the quantity to be minimized, is n L D[i,j)F[1r(i),1r(j)],","PeriodicalId":376860,"journal":{"name":"Quadratic Assignment and Related Problems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133572856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 29

Approximation of Association Data by Structures and Clusters 基于结构和聚类的关联数据逼近

Quadratic Assignment and Related Problems Pub Date : 1900-01-01 DOI: 10.1090/dimacs/016/15

B. Mirkin

引用次数: 4