The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases

Burkard, Rainer E.; Çela, Eranda; Rote, Günter; Woeginger, Gerhard J.

doi:10.1007/3-540-61310-2_16

Cited by 25 publications

(51 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…1) Heuristic optimization algorithms overview: Several exact algorithms have been used for solving the QAP problems, like branch and bound, cutting plane and branch and cut algorithms [4]. Although substantial improvements have been done in the development of exact algorithms for the QAP, they remain inefficient to solve problems with size n>20 in reasonable computational time (there are n!…”

Section: Optimized Partitioning Processmentioning

confidence: 99%

“…Many research have been devoted to the development of such approaches. We distinguish the following heuristic algorithms [4]: Tabu search (TS), Simulated annealing (SA), Genetic algorithms (GA), Greedy randomized adaptive search procedures (GRASP), Ant systems (AS)...etc. These methods are also known as local search algorithms.…”

Section: Optimized Partitioning Processmentioning

confidence: 99%

“…To cope with this complexity, the proposal relies on heuristic optimization techniques [4]. Specifically, we present and analyze a greedy algorithm to build an initial solution, and we outline how Tabu search can be applied to improve the initial solution.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimized decentralization of composite web services

Fdhila¹,

Dumas²,

Godart³

2010

Proceedings of the 6th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing

View full text Add to dashboard Cite

Abstract-Composite services are usually specified by means of orchestration models that capture control and data-flow relations between activities. Concrete services are then assigned to each activity based on various criteria. In mainstream service orchestration platforms, the orchestration model is executed by a centralized orchestrator through which all interactions are channeled. This architecture is not optimal in terms of communication overhead and has the usual problems of a single point of failure. In previous work, we proposed a method for executing service orchestrations in a decentralized manner while fulfilling collocation and separation constraints. However, this and similar methods for decentralized orchestration do not seek to optimize the communication overhead between services participating in the orchestration. This paper presents a method for optimizing the selection of services assigned to activities in a service orchestration in terms of QoS properties and communication overhead. The method takes into account the communication cost between pairs of services, the amount of data that these services need to exchange in the orchestration, and the collocation and separation constraints imposed by the service providers.

show abstract

Section: Optimized Partitioning Processmentioning

confidence: 99%

Section: Optimized Partitioning Processmentioning

confidence: 99%

See 1 more Smart Citation

Optimized decentralization of composite web services

Fdhila¹,

Dumas²,

Godart³

2010

Proceedings of the 6th International ICST Conference on Collaborative Computing: Networking, Applications, Worksharing

View full text Add to dashboard Cite

show abstract

“…Данная работа продолжает исследования, связанные с выявлением эффективно разре-шимых случаев КЗН, для которых гарантировано достижение оптимума на подстановке заданного вида [6]- [15]. В дальнейшем такие случаи КЗН называются сильно разреши-мыми.…”

Section: Introductionunclassified

“…Демиденко КЗН. Введенное понятие аддитивно монотонных по строкам и столбцам матриц является естественным обобщением фольклорного понятия монотонности матриц, использованно-го в [6]. Неполными матрицами анти-Монжа названы матрицы, для которых выполняется только часть из противоположных неравенств, определяющих условия Монжа [4].…”

Section: Introductionunclassified

Квадратичная Задача О Назначениях С Аддитивно Монотонными Матрицами И Неполными Матрицами Анти-Монжа: Условия Эффективной Разрешимости

Demidenko¹

2007

Дискрет. матем.

View full text Add to dashboard Cite

Quadratic Assignment Problem

Pitsoulis

Pardalos

2001

Encyclopedia of Optimization

View full text Add to dashboard Cite

This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, and asymptotic behavior. Moreover, it also considers problems related to the QAP, e.g. the biquadratic assignment problem, and discusses the relationship between the QAP and other well known combinatorial optimization problems, e.g. the traveling salesman problem, the graph partitioning problem, etc. The paper will appear in the Handbook of Combinatorial Optimization to be published by Kluwer Academic Publishers, P. Pardalos and D.-Z. Du, eds.

show abstract

The quadratic assignment problem with a monotone anti-monge and a symmetric toeplitz matrix: Easy and hard cases

Cited by 25 publications

References 5 publications

Optimized decentralization of composite web services

Optimized decentralization of composite web services

Квадратичная Задача О Назначениях С Аддитивно Монотонными Матрицами И Неполными Матрицами Анти-Монжа: Условия Эффективной Разрешимости

Quadratic Assignment Problem

Contact Info

Product

Resources

About