Combinatorial optimization : lectures given at the 3rd session of the Centro internazionale matematico estivo (C.I.M.E.) held at Como, Italy, August 25-September 2, 1986
Author(s)
Bibliographic Information
Combinatorial optimization : lectures given at the 3rd session of the Centro internazionale matematico estivo (C.I.M.E.) held at Como, Italy, August 25-September 2, 1986
(Lecture notes in mathematics, 1403)
Springer-Verlag, c1989
- : gw
- : us
Available at 82 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library & Science Information Center, Osaka Prefecture University
: gwNDC8:410.8||||10009557410
Note
Proceedings of the CIME International Summer School on Combinatorial Optimization, held in Como, Italy, Aug. 25-Sept. 2, 1986
Includes bibliographical references
Description and Table of Contents
Description
The C.I.M.E. Summer School at Como in 1986 was the first in that series on the subject of combinatorial optimization. Situated between combinatorics, computer science and operations research, the subject draws on a variety of mathematical methods to deal with problems motivated by real-life applications. Recent research has focussed on the connections to theoretical computer science, in particular to computational complexity and algorithmic issues. The Summer School's activity centered on the 4 main lecture courses, the notes of which are included in this volume:
Table of Contents
Quadratic functions of binary variables.- On binary group problems having the Fulkerson property.- Examples and algorithmic properties of greedoids.- Combinatorial structures and combinatorial optimization.- A polynomial algorithm for partitioning line-graphs.- Structural dependence and systems of equations.- Best network flow bounds for the quadratic knapsack problem.- (K4-e)-free perfect graphs and star cutsets.- A bound on the roof-duality gap.- Hyperpaths and shortest hyperpaths.- A characterization of centroidal graphs.- Topological network synthesis.
by "Nielsen BookData"