Results 1 - 10
of
109
QAPLIB–A Quadratic Assignment Problem Library
- European Journal of Operational Research
, 1991
"... ..."
Exact algorithms for NP-hard problems: a survey, in: Combinatorial Optimization—Eureka, you shrink!”,
- Lecture Notes in Computer Science,
, 2003
"... Abstract. We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, sched ..."
Abstract
-
Cited by 151 (4 self)
- Add to MetaCart
Abstract. We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.
Quick Approximation to Matrices and Applications
, 1998
"... We give algorithms to find the following simply described approximation to a given matrix. Given an m \Theta n matrix A with entries between say-1 and 1, and an error parameter ffl between 0 and 1, we find a matrix D (implicitly) which is the sum of O(1=ffl 2 ) simple rank 1 matrices so that the ..."
Abstract
-
Cited by 145 (7 self)
- Add to MetaCart
We give algorithms to find the following simply described approximation to a given matrix. Given an m \Theta n matrix A with entries between say-1 and 1, and an error parameter ffl between 0 and 1, we find a matrix D (implicitly) which is the sum of O(1=ffl 2 ) simple rank 1 matrices so that the sum of entries of any submatrix (among the 2 m+n ) of (A \Gamma D) is at most fflmn in absolute value. Our algorithm takes time dependent only on ffl and the allowed probability of failure (not on m;n). We draw on two lines of research to develop the algorithms: one is built around the fundamental Regularity Lemma of Szemerédi in Graph Theory and the constructive version of Alon, Duke, Leffman, Rödl and Yuster. The second one is from the papers of Arora, Karger and Karpinski, Fernandez de la Vega and most directly Goldwasser, Goldreich and Ron who develop approximation algorithms for a set of graph problems, typical of which is the maximum cut problem. ?From our matrix approximation, the...
Solving Large Quadratic Assignment Problems on Computational Grids
, 2000
"... The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computat ..."
Abstract
-
Cited by 82 (7 self)
- Add to MetaCart
The quadratic assignment problem (QAP) is among the hardest combinatorial optimization problems. Some instances of size n = 30 have remained unsolved for decades. The solution of these problems requires both improvements in mathematical programming algorithms and the utilization of powerful computational platforms. In this article we describe a novel approach to solve QAPs using a state-of-the-art branch-and-bound algorithm running on a federation of geographically distributed resources known as a computational grid. Solution of QAPs of unprecedented complexity, including the nug30, kra30b, and tho30 instances, is reported.
Semidefinite Programming Relaxations For The Quadratic Assignment Problem
, 1998
"... Semidefinite programming (SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP. These relaxations result in the interesting, special, case where only the dual problem of the SDP re ..."
Abstract
-
Cited by 82 (23 self)
- Add to MetaCart
Semidefinite programming (SDP) relaxations for the quadratic assignment problem (QAP) are derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of QAP. These relaxations result in the interesting, special, case where only the dual problem of the SDP relaxation has strict interior, i.e. the Slater constraint qualification always fails for the primal problem. Although there is no duality gap in theory, this indicates that the relaxation cannot be solved in a numerically stable way. By exploring the geometrical structure of the relaxation, we are able to find projected SDP relaxations. These new relaxations, and their duals, satisfy the Slater constraint qualification, and so can be solved numerically using primal-dual interior-point methods. For one of our models, a preconditioned conjugate gradient method is used for solving the large linear systems which arise when finding the Newton direction. The preconditioner is found by exploiting th...
A Survey on Shape Correspondence
, 2010
"... We present a review of the correspondence problem and its solution methods, targeting the computer graphics audience. With this goal in mind, we focus on the correspondence of geometric shapes represented by point sets, contours or triangle meshes. This survey is motivated by recent developments in ..."
Abstract
-
Cited by 75 (8 self)
- Add to MetaCart
We present a review of the correspondence problem and its solution methods, targeting the computer graphics audience. With this goal in mind, we focus on the correspondence of geometric shapes represented by point sets, contours or triangle meshes. This survey is motivated by recent developments in the field such as those requiring the correspondence of non-rigid or time-varying surfaces and a recent trend towards semantic shape analysis, of which shape correspondence is one of the central tasks. Establishing a meaningful shape correspondence is a difficult problem since it typically relies on an understanding of the structure of the shapes in question at both a local and global level, and sometimes also the shapes ’ functionality. However, despite its inherent complexity, shape correspondence is a recurrent problem and an essential component in numerous geometry processing applications. In this report, we discuss the different forms of the correspondence problem and review the main solution methods, aided by several classification criteria which can be used by the reader to objectively compare the methods. We finalize the report by discussing open problems and future perspectives.
A recipe for semidefinite relaxation for 0-1 quadratic programming
- JOURNAL OF GLOBAL OPTIMIZATION
, 1995
"... We review various relaxations of (0,1)-quadratic programming problems. These include semidefinite programs, parametric trust region problems and concave quadratic maximization. All relaxations that we consider lead to efficiently solvable problems. The main contributions of the paper are the followi ..."
Abstract
-
Cited by 57 (7 self)
- Add to MetaCart
We review various relaxations of (0,1)-quadratic programming problems. These include semidefinite programs, parametric trust region problems and concave quadratic maximization. All relaxations that we consider lead to efficiently solvable problems. The main contributions of the paper are the following. Using Lagrangian duality, we prove equivalence of the relaxations in a unified and simple way. Some of these equivalences have been known previously, but our approach leads to short and transparent proofs. Moreover we extend the approach to the case of equality constrained problems by taking the squared linear constraints into the objective function. We show how this technique can be applied to the Quadratic Assignment Problem, the Graph Partition Problem and the Max-Clique Problem. Finally we show our relaxation to be best possible among all quadratic majorants with zero trace.
On Lagrangian relaxation of quadratic matrix constraints
- SIAM J. MATRIX ANAL. APPL
, 2000
"... Quadratically constrained quadratic programs (QQPs) play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Lagrangian relaxations often provide good approximate solutions to these hard problems. Such relaxations are equivalent ..."
Abstract
-
Cited by 53 (18 self)
- Add to MetaCart
(Show Context)
Quadratically constrained quadratic programs (QQPs) play an important modeling role for many diverse problems. These problems are in general NP hard and numerically intractable. Lagrangian relaxations often provide good approximate solutions to these hard problems. Such relaxations are equivalent to semidefinite programming relaxations. For several special cases of QQP, e.g., convex programs and trust region subproblems, the Lagrangian relaxation provides the exact optimal value, i.e., there is a zero duality gap. However, this is not true for the general QQP, or even the QQP with two convex constraints, but a nonconvex objective. In this paper we consider a certain QQP where the quadratic constraints correspond to the matrix orthogonality condition XXT = I. For this problem we show that the Lagrangian dual based on relaxing the constraints XXT = I and the seemingly redundant constraints XT X = I has a zero duality gap. This result has natural applications to quadratic assignment and graph partitioning problems, as well as the problem of minimizing the weighted sum of the largest eigenvalues of a matrix. We also show that the technique of relaxing quadratic matrix constraints can be used to obtain a strengthened semidefinite relaxation for the max-cut problem.
Outstanding Research Problems in NoC Design: Circuit-, Microarchitecture-, and System-Level Perspectives
"... Abstract—Networks-on-Chip (NoCs) have been recently proposed to replace global interconnects in order to alleviate complex communication problems. While several research problems concerning NoC design have been already addressed in the literature, many others remain to be solved. In this work, we fi ..."
Abstract
-
Cited by 52 (1 self)
- Add to MetaCart
Abstract—Networks-on-Chip (NoCs) have been recently proposed to replace global interconnects in order to alleviate complex communication problems. While several research problems concerning NoC design have been already addressed in the literature, many others remain to be solved. In this work, we first provide a general description of NoC architectures and applications. Then, we enumerate several related research problems organized under five main categories: Application characterization, communication paradigm, communication infrastructure, analysis and solution evaluation. Motivation, problem formulation, proposed approaches and open issues are discussed for each problem enumerated in the paper from circuit, micro-architecture and systemlevel perspectives. Finally, we address the interactions among these research problems and put the NoC design process into perspective. Index terms — On-chip communication architecture, networks-onchip, multiprocessor system-on-chip, CMP. I.
Frequency Assignment Problems
- HANDBOOK OF COMBINATORIAL OPTIMIZATION
, 1999
"... The ever growing number of wireless communications systems deployed around the globe have made the optimal assignment of a limited radio frequency spectrum a problem of primary importance. At issue are planning models for permanent spectrum allocation, licensing, regulation, and network design. Furt ..."
Abstract
-
Cited by 41 (3 self)
- Add to MetaCart
(Show Context)
The ever growing number of wireless communications systems deployed around the globe have made the optimal assignment of a limited radio frequency spectrum a problem of primary importance. At issue are planning models for permanent spectrum allocation, licensing, regulation, and network design. Further at issue are on-line algorithms for dynamically assigning frequencies to users within an established network. Applications include aeronautical mobile, land mobile, maritime mobile, broadcast, land fixed (pointto -point), and satellite systems. This paper surveys research conducted by theoreticians, engineers, and computer scientists regarding the frequency assignment problem (FAP) in all of its guises. The paper begins by defining some of the more common types of FAPs. It continues with a discussion on measures of optimality relating to the use of spectrum, models of interference, and mathematical representations of the many FAPs, both in graph theoretic terms, and as mathematical pro...