## Mathematical programming: proceedings of the International Congress on Mathematical Programming, Rio de Janeiro, Brazil, 6-8 April, 1981 |

### What people are saying - Write a review

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

### Contents

Preface | 1 |

Lifting and Complementing Yields All the Facets of Positive | 13 |

Characterization of Minimal Points and Parametric SemiInfinite | 25 |

Copyright | |

17 other sections not shown

### Common terms and phrases

applied approximate solution assume assumption Benders bound clique clique problem coefficients construction contains a hamiltonian convergence convex cycle decentralization Decomposition defined definition denote digraph G dual e-approximate element epi-converge exists facet feasible solution finite FPAS given graph greedy greedy algorithm Hamiltonian circuit hamiltonian path Hence hypohamiltonian hypotraceable digraphs implies independence system inequalities inf f integer programming iterations knapsack problem Korte Editors Lemma linear programming M.L. Kelmanson Math Mathematical Programming minimal cover node North-Holland NP-complete objective function obtained Operations Research optimal solution optimization problems oriented matroid parameter path in G permutation polynomial algorithm polytope procedure programming problems Proof properties Proposition quadratic assignment problem quadratic programming R.W. Cottle real number resp SAHNI satisfied schedule sequence SIAM simplex method solve subset Suppose Theorem Theory travelling salesman problem variables vector vertex