Results 1  10
of
10
The Quadratic Assignment Problem: A Survey and Recent Developments
 In Proceedings of the DIMACS Workshop on Quadratic Assignment Problems, volume 16 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, 1994
"... . Quadratic Assignment Problems model many applications in diverse areas such as operations research, parallel and distributed computing, and combinatorial data analysis. In this paper we survey some of the most important techniques, applications, and methods regarding the quadratic assignment probl ..."
Abstract

Cited by 89 (16 self)
 Add to MetaCart
. Quadratic Assignment Problems model many applications in diverse areas such as operations research, parallel and distributed computing, and combinatorial data analysis. In this paper we survey some of the most important techniques, applications, and methods regarding the quadratic assignment problem. We focus our attention on recent developments. 1. Introduction Given a set N = f1; 2; : : : ; ng and n \Theta n matrices F = (f ij ) and D = (d kl ), the quadratic assignment problem (QAP) can be stated as follows: min p2\Pi N n X i=1 n X j=1 f ij d p(i)p(j) + n X i=1 c ip(i) ; where \Pi N is the set of all permutations of N . One of the major applications of the QAP is in location theory where the matrix F = (f ij ) is the flow matrix, i.e. f ij is the flow of materials from facility i to facility j, and D = (d kl ) is the distance matrix, i.e. d kl represents the distance from location k to location l [62, 67, 137]. The cost of simultaneously assigning facility i to locat...
An Interior Point Algorithm to Solve Computationally Difficult Set Covering Problems
, 1990
"... ..."
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
 ANNALS OF OPERATIONS RESEARCH
, 2000
"... ... Knapsack Problems to fix some variables to zero and to separate the rest into two groups those that tend to be zero and those that tend to be one, in an optimal integer solution. Using an initial feasible integer solution, we generate logic cuts based on our analysis before solving the problem w ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
... Knapsack Problems to fix some variables to zero and to separate the rest into two groups those that tend to be zero and those that tend to be one, in an optimal integer solution. Using an initial feasible integer solution, we generate logic cuts based on our analysis before solving the problem with branch and bound. Computational testing, including the set of problems in the ORlibrary and our own set of difficult problems, shows our approach helps to solve difficult problems in a reasonable amount of time and, in most cases, with a fewer number of nodes in the search tree than leading commercial software. ______________________________________________________________________________________
A survey on the continuous nonlinear resource allocation problem
 Eur. J. Oper. Res
, 2008
"... Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint described by a separable convex function. Applications are abundant, and vary from equilibrium problems in the engineering a ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint described by a separable convex function. Applications are abundant, and vary from equilibrium problems in the engineering and economic sciences, through resource allocation and balancing problems in manufacturing, statistics, military operations research and production and financial economics, to subproblems in algorithms for a variety of more complex optimization models. This paper surveys the history and applications of the problem, as well as algorithmic approaches to its solution. The most common techniques are based on finding the optimal value of the Lagrange multiplier for the explicit constraint, most often through the use of a type of line search procedure. We analyze the most relevant references, especially regarding their originality and numerical findings, summarizing with remarks on possible extensions and future research. 1 Introduction and
Hierarchical Topological Network Design
"... Abstract—We present a hierarchical solution method to approximately solve the topological network design problem: given positive integers ( 1), minimize the number of arcs required to interconnect nodes, so that the network diameter does not exceed, the maximum node degree does not exceed 1, and the ..."
Abstract
 Add to MetaCart
Abstract—We present a hierarchical solution method to approximately solve the topological network design problem: given positive integers ( 1), minimize the number of arcs required to interconnect nodes, so that the network diameter does not exceed, the maximum node degree does not exceed 1, and the network is single node survivable. The method uses dynamic programming to piece together small networks to create larger networks. The method was used to plan two highspeed packet networks at AT&T. Index Terms—Dynamic programming, hierarchical design, network design, survivability. I. INTRODUCTION AND PROBLEM DEFINITION PLANNING the evolution of a large communications network requires a variety of approximations and estimates. A demand forecast for the various services is required, as well as lowlevel service planning assumptions (e.g., card redundancy).
Integer Programming for . . .
, 1999
"... Auctions allowing bids for combinations of items are important for (agent mediated) electronic commerce; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. The determination of an optimal winner combination in this type of au ..."
Abstract
 Add to MetaCart
Auctions allowing bids for combinations of items are important for (agent mediated) electronic commerce; compared to other auction mechanisms, they often increase the efficiency of the auction, while keeping risks for bidders low. The determination of an optimal winner combination in this type of auctions is a complex computational problem, which has recently attracted some research, and in this paper, we look further into the topic. It is well known that the winner determination problem for a certain class of auctions is equivalent to what in the operations research community is referred to as (weighted) set packing. In this paper we compare some of the recent winner determination algorithms to traditional set packing algorithms, and study how more general auctions can be modeled by use of standard integer programming methods.
Chapter 9 Lagrangian Relaxation for Integer Programming
"... It is a pleasure to write this commentary because it offers an opportunity to express my gratitude to several people who helped me in ways that turned out to be essential to the birth of [8]. They also had a good deal to do with shaping my early career and, consequently, much of what followed. ..."
Abstract
 Add to MetaCart
It is a pleasure to write this commentary because it offers an opportunity to express my gratitude to several people who helped me in ways that turned out to be essential to the birth of [8]. They also had a good deal to do with shaping my early career and, consequently, much of what followed.
NorthHolland Publishing Company A NOTE ON SOME COMPUTATIONALLY DIFFICULT SET COVERING PROBLEMS
, 1978
"... Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple system ..."
Abstract
 Add to MetaCart
Fulkerson et al. have given two examples of set covering problems that are empirically difficult to solve. They arise from Steiner triple systems and the larger problem, which has a constraint matrix of size 330 × 45 has only recently been solved. In this note, we show that the Steiner triple systems do indeed give rise to a series of problems that are probably hard to solve by implicit enumeration. The main result is that for an n variable problem, branch and bound algorithms using a linear programming relaxation, and/or elimination by dominance require the examination of a superpolynomial number of partial solutions
unknown title
, 2005
"... www.elsevier.com/locate/disopt Higherorder cover cuts from zero–one knapsack constraints augmented by twosided bounding inequalities ..."
Abstract
 Add to MetaCart
www.elsevier.com/locate/disopt Higherorder cover cuts from zero–one knapsack constraints augmented by twosided bounding inequalities