Skip to main content
SpringerLink
Log in

Mathematical Programming at Oberwolfach

  • Book
  • © 1981

Overview

Editors:
  1. H. König
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. B. Korte
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. K. Ritter
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Mathematical Programming Studies (MATHPROGRAMM, volume 14)

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

Access this book

Log in via an institution

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (16 chapters)

  1. Front Matter

    Download chapter PDF

  2. Characterizations of adjacency of faces of polyhedra

    • Achim Bachem, Martin Grötschel
    Pages 1-22

  3. Linear programming by an effective method using triangular matrices

    • Jürgen Bräuninger
    Pages 23-31

  4. Minimal cost flows in regular matroids

    • Rainer E. Burkard, Horst Hamacher
    Pages 32-47

  5. Lagrangean functions and affine minorants

    • R. J. Duffin, R. G. Jeroslow
    Pages 48-60

  6. Khachiyan’s algorithm for linear programming

    • Peter Gács, Laszlo Lovász
    Pages 61-68

  7. Higher order necessary conditions for an abstract optimization problem

    • Bernhard Gollan
    Pages 69-76

  8. On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets

    • Martin Grötschel, Yoshiko Wakabayashi
    Pages 77-97

  9. Algorithmic versus axiomatic definitions of matroids

    • D. Hausmann, B. Korte
    Pages 98-111

  10. Characterization of facets for multiple right-hand choice linear programs

    • Ellis L. Johnson
    Pages 112-142

  11. Secant approximation methods for convex optimization

    • C. Y. Kao, R. R. Meyer
    Pages 143-162

  12. First and second order sufficient optimality conditions in mathematical programming and optimal control

    • Helmut Maurer
    Pages 163-177

  13. Global and superlinear convergence of a class of variable metric methods

    • Klaus Ritter
    Pages 178-205

  14. Some continuity properties of polyhedral multifunctions

    • Stephen M. Robinson
    Pages 206-214

  15. On conditions warranting Φ-subdifferentiability

    • S. Rolewicz
    Pages 215-224

  16. On self-transformable combinatorial problems

    • C. P. Schnorr
    Pages 225-243

  17. A resource decomposition algorithm for general mathematical programs

    • Laurence A. Wolsey
    Pages 244-257
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation