Skip to main content
SpringerLink
Log in
Book cover
  • Book
  • © 1985

Mathematiacl Programming Essays in Honor of George B. Dantzig Part I

Editors:

  1. R. W. Cottle
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Sections

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

Table of contents (16 chapters)

  1. Front Matter

    PDF

  4. Faces of a polyhedron

    • Katta G. Murty
    Pages 30-42

  7. A decomposition algorithm for circuit routing

    • T. C. Hu, M. T. Shing
    Pages 87-103

  12. Basis graphs of greedoids and two-connectivity

    • Bernhard Korte, László Lovász
    Pages 158-165

  15. Intermediate feasibility in 0–1 integer linear systems

    • Patricia J. Carstensen, Katta G. Murty, Clovis Perin
    Pages 219-224

  16. Classes of linear programs with integral optimal solutions

    • Y. P. Aneja, R. Chandrasekaran, K. P. K. Nair
    Pages 225-237

  17. On general decomposition schemes in mathematical programming

    • R. E. Burkard, H. W. Hamacher, J. Tind
    Pages 238-252
Back to top

Keywords

Back to top

Bibliographic Information

  • Book Title: Mathematiacl Programming Essays in Honor of George B. Dantzig Part I

  • Editors: R. W. Cottle

  • Series Title: Mathematical Programming Studies

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

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1985

  • eBook ISBN: 978-3-642-00919-8Published: 07 March 2009

  • Series ISSN: 0303-3929

  • Series E-ISSN: 2364-8201

  • Edition Number: 1

  • Number of Pages: 252

  • Topics: Optimization, Mathematics of Computing

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Search

Navigation