๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A simple and effective algorithm for the MaxMin diversity problem

โœ Scribed by Daniel Cosmin Porumbel; Jin-Kao Hao; Fred Glover

Publisher
Springer US
Year
2011
Tongue
English
Weight
554 KB
Volume
186
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Simple design for cost-effective diversi
Simple design for cost-effective diversity antennas
โœ N. Belmar-Moliner; A. Valero-Nogueira; M. Cabedo-Fabrรฉs; E. Antonino-Daviu ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 169 KB

## Abstract This letter shows a simple design for a diversity planar monopole antenna with two feed points that can be used in multiple input multiple output (MIMO) systems. The design is based on the theory of characteristic modes. The final antenna has two highly isolated ports with an envelope c

A Simple Algorithm for the Planar Multiw
A Simple Algorithm for the Planar Multiway Cut Problem
โœ Wei-Chang Yeh ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

The traditional min-cut problem involves finding a cut with minimum weight between two specified vertices. The planar multiway cut problem is a NP-hard generalization of the min-cut problem. It involves separating a weighted planar graph with k specified vertices into k components such that the tota

A simple approximation algorithm for the
A simple approximation algorithm for the weighted matching problem
โœ Doratha E Drake; Stefan Hougardy ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 61 KB

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [

A simple dual algorithm for the generali
A simple dual algorithm for the generalised assignment problem
โœ John M. Wilson ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Springer US ๐ŸŒ English โš– 415 KB

A new algorithm for the generalised assignment problem is described in this paper. The dual-type algorithm uses a simple heuristic derived from a relaxation of the problem. The algorithm has been tested on generalised assignment problems of substantial size and compared to an exact integer programmi