Skip to main content
SpringerLink
Log in

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

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. Bruno Simeone
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Mathematics (LNM, volume 1403)

Part of the book sub series: C.I.M.E. Foundation Subseries (LNMCIME)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 papers)

  1. Front Matter

    Pages I-V
    Download chapter PDF

  2. Quadratic functions of binary variables

    • Peter L. Hammer, Bruno Simeone
    Pages 1-56

  3. On binary group problems having the Fulkerson property

    • Ellis L. Johnson
    Pages 57-112

  4. Examples and algorithmic properties of greedoids

    • O. Goecke, B. Korte, L. Lovász
    Pages 113-161

  5. Combinatorial structures and combinatorial optimization

    • Eugene L. Lawler
    Pages 162-197

  6. A polynomial algorithm for partitioning line-graphs

    • Claudio Arbib
    Pages 198-208

  7. Structural dependence and systems of equations

    • J. Bisschop, B. Dorhout, A. Drud
    Pages 209-224

  8. Best network flow bounds for the quadratic knapsack problem

    • Paul Chaillou, Pierre Hansen, Yvon Mahieu
    Pages 225-235

  9. (K4-e)-free perfect graphs and star cutsets

    • Michele Conforti
    Pages 236-253

  10. A bound on the roof-duality gap

    • P. L. Hammer, B. Kalantari
    Pages 254-257

  11. Hyperpaths and shortest hyperpaths

    • Sang Nguyen, Stefano Pallottino
    Pages 258-271

  12. A characterization of centroidal graphs

    • Wiktor Piotrowski, Maciej M. SysÅ‚o
    Pages 272-281

  13. Topological network synthesis

    • Pawel Winter
    Pages 282-303

  14. Back Matter

    Pages 305-318
    Download chapter PDF
Back to top

Keywords

About this book

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:

Bibliographic Information

  • Book Title: Combinatorial Optimization

  • Book Subtitle: 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

  • Editors: Bruno Simeone

  • Series Title: Lecture Notes in Mathematics

  • DOI: https://doi.org/10.1007/BFb0083460

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1989

  • Softcover ISBN: 978-3-540-51797-9Published: 25 October 1989

  • eBook ISBN: 978-3-540-46810-3Published: 14 November 2006

  • Series ISSN: 0075-8434

  • Series E-ISSN: 1617-9692

  • Edition Number: 1

  • Number of Pages: VIII, 320

  • Topics: Economic Theory/Quantitative Economics/Mathematical Methods, Operations Research/Decision Theory

Publish with us

Policies and ethics

Back to top

Search

Navigation