The Quadratic Assignment Problem (QAP) has remained one of the great challenges in combinatorial optimization. It is still considered a computationally nontrivial task to solve modest size problems,â€¦ (More)

This paper aims at describing the state of the art on linear assignment problems (LAPs). Besides sum LAPs it discusses also problems with other objective functions like the bottleneck LAP, theâ€¦ (More)

A class of combinatorial optimization problems with sumand bottleneck objective function is described, having the following probabilistic asymptotic behaviour: With probability tending to one theâ€¦ (More)

Given three n-element sequences a i ; b i and c i of nonnega-tive real numbers, the aim is to nd two permutations and such that the sum P n i=1 a i b (i) c (i) is minimized (maximized, respectively).â€¦ (More)

Split graphs were introduced in [3] where it was shown that these graphs have a simple characterization by means of forbidden subgraphs. Let I and K be two sets. P,(I, K) denotes the set of all setsâ€¦ (More)

The 1-median problem on a network asks for a vertex minimizing the sum of the weighted shortest path distances from itself to all other vertices, each associated with a certain positive weight. Weâ€¦ (More)

The traveling salesman problem (TSP) belongs to the most basic, most important, and most investigated problems in combinatorial optimization. Although it is an NP-hard problem, many of its specialâ€¦ (More)