## Discrete Optimization: Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium, Co-sponsored by IBM Canada and SIAM, Banff, Alta. and Vancouver, B.C., Canada, August 1977, Volume 1Peter L. Hammer, Ellis L. Johnson, Bernhard H. Korte North-Holland Publishing Company, 1979 - Mathematical optimization |

### What people are saying - Write a review

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

### Contents

Methodology | 3 |

J Edmonds Matroid intersection | 39 |

Hammer Boolean elements in combinatorial optimization | 51 |

Copyright | |

28 other sections not shown

### Other editions - View all

### Common terms and phrases

antiblocking approximative algorithm assignment problem bipartite Boolean bound branch and bound circuit column combinatorial problems complexity Comput consider constraints convex hull corresponding covering problem cutting stock problem defined denote directed graph discrete optimization dual Edmonds elements equivalent EVFA example extreme point facets feasible solution find shortest finite formulation given graph G graph theory greedy algorithm Hamiltonian Hence hypergraph incidence matrix independence system integer programming integer programming problem knapsack problem Let G linear inequalities linear programming problem Lovasz matching matroid maximal maximum number method minimal minimum Nemhauser network flow nodes non-negative NP-complete objective function obtained odd cycle Operations Res optimal solution oracle packing problem Padberg pair perfect graph polyhedra polyhedron polynomial polytope primal procedure proof satisfying Section shortest path solved stock length structure subgraph subset symmetric totally unimodular transversal travelling salesman problem Turing machine undirected variables vector vertex vertices weight zero-one