𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the depth of combinatorial optimization problems

✍ Scribed by W. Kern

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
845 KB
Volume
43
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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.

Domination analysis of combinatorial opt
Domination analysis of combinatorial optimization problems
✍ Gregory Gutin; Alek Vainshtein; Anders Yeo πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 141 KB

We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classiΓΏcation of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results already proved in the 1970s that min TSP (both symmetric and asymmetric versions) is DOM-e

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