## 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 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Quadratic pseudoboolean functions | 12 |

Maximization of quadratic pseudoboolean functions | 21 |

Linearization | 31 |

Copyright | |

12 other sections not shown

### Common terms and phrases

antimatroid augmented matrix binary group problem bipartite graph bottleneck branching greedoid cardinality centroid characterization chord chordal graph circuits combinatorial complete subset Computer contains convex corresponding defined deletion denote dual edge elements equal equivalence classes example exists finite Fulkerson property given graph G greedoid greedy algorithm Hence heuristic homomorphism hypergraph hyperpath incidence matrix integer intersection KORTE Lemma Let G line-graph linear program LOVASZ Math Mathematics matroid maximal and complete maximum minimal minimum modulo node nonzero NP-complete objective function obtained odd cycle operations optimal solution optimal tour oriented matroid partition path perfect graph permutation polyhedra polymatroid polynomial poset poset greedoid posiform Proof result roof roof-dual root rows of Q satisfying series-parallel graph set system signed graph Simeone spanning tree structurally dependent rows subgraph subset of structurally Theorem theory transpositions Traveling Salesman Problem undirected upper plane valid inequality variables vector vertex vertices zero