Journal:Informatica
Volume 26, Issue 2 (2015), pp. 313–334
Abstract
Abstract
In this paper we consider optimal congestion control and routing schemes for multipath networks with non-congestion related packet losses which can be caused by, for example, errors on links on the routes, and develop a relaxed multipath network utility maximization problem. In order to obtain the optimum, we present a primal algorithm which is shown to be globally stable in the absence of round-trip delays. When round-trip delays are considered, decentralized sufficient conditions for local stability of the algorithm are proposed, in both continuous-time and discrete-time forms. Finally, a window-flow control mechanism is presented which can approximate the optimum of the multipath network utility maximization model.
Journal:Informatica
Volume 3, Issue 4 (1992), pp. 524–538
Abstract
In this paper, we present a new local search algorithm for solving the Quadratic Assignment Problem based on the Kernighan-Lin heuristic for the Graph Partitioning Problem. We also prove that finding a local optimum for the Quadratic Assignment Problem, with the neighborhood structure defined in the algorithm, is PLS-complete. The greatest advantages of the algorithm are its simplicity and speed in generating high quality solutions. The algorithm has been implemented and tested on an IBM 3090 computer with a variety of test problems of dimensions up to 100, including many test problems available in the literature and a new set of test problems with known optimal permutations.