𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The bandpass problem: combinatorial optimization and

✍ Scribed by Djangir A. Babayev; George I. Bell; Urfat G. Nuriyev

Publisher
Springer US
Year
2008
Tongue
English
Weight
373 KB
Volume
18
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The base-matroid and inverse combinatori
The base-matroid and inverse combinatorial optimization problems
✍ Mauro Dell'Amico; Francesco Maffioli; Federico Malucelli πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 196 KB

A new matroid is introduced: this matroid is deΓΏned starting from any matroid and one of its bases, hence we call it base-matroid. Besides some properties of the base-matroid, a non-trivial algorithm for the solution of the related matroid optimization problem is presented. The new matroid has appli

On simple combinatorial optimization pro
On simple combinatorial optimization problems
✍ A.J. Hoffman πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 228 KB

We characterize (0,l) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.