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

School on combinatorial optimization


Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
75 KB
Volume
11
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On simple combinatorial optimization pro
โœ 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.

Combinatorial optimization on a Boltzman
โœ Jan H.M. Korst; Emile H.L. Aarts ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 483 KB

We discuss the problem of solving (approximately) combinatorial optimization problems on a Boltzmann machine. It is shown for a number of combinatorial optimization problems how they can be mapped directly onto a Boltzmann machine by choosing appropriate connection patterns and connection strengths.

Minmax combinatorial optimization
โœ Abraham P. Punnen; Y.P. Aneja ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 638 KB
Convex Combinatorial Optimization
โœ Shmuel Onn; Uriel G. Rothblum ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer ๐ŸŒ English โš– 222 KB