Skip to main content
SpringerLink
Log in

Integer Programming and Network Models

  • Book
  • © 2000

Overview

Authors:
  1. H. A. Eiselt

    1. Faculty of Administration, University of New Brunswick, Fredericton, Canada

    View author publications

    You can also search for this author in PubMed   Google Scholar

  2. C.-L. Sandblom

    1. Department of Industrial Engineering, Dalhousie University, Halifax, Canada

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • The models and their structures are described in detail

  • The problems are motivated, structured, formulated, and solved in detail

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

Access this book

Log in via an institution
eBook USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (20 chapters)

  1. Front Matter

    Pages I-XII
    Download chapter PDF

  2. Introduction: Basic Definitions and Results

    1. Front Matter

      Pages 1-1
      Download chapter PDF

    2. Linear Programming

      • H. A. Eiselt, C.-L. Sandblom
      Pages 3-12

    3. Analysis of Algorithms

      • H. A. Eiselt, C.-L. Sandblom
      Pages 13-33

    4. Graph Theory

      • H. A. Eiselt, C.-L. Sandblom
      Pages 35-64

    5. Dynamic Programming

      • H. A. Eiselt, C.-L. Sandblom
      Pages 65-85

  3. Integer Programming

    1. Front Matter

      Pages 87-87
      Download chapter PDF

    2. The Integer Programming Problem and its Properties

      • H. A. Eiselt, C.-L. Sandblom
      Pages 89-109

    3. Formulations in Logical Variables

      • H. A. Eiselt, C.-L. Sandblom
      Pages 111-128

    4. Applications and Special Structures

      • H. A. Eiselt, C.-L. Sandblom
      Pages 129-160

    5. Reformulation of Problems

      • H. A. Eiselt, C.-L. Sandblom
      Pages 161-185

    6. Cutting Plane Methods

      • H. A. Eiselt, C.-L. Sandblom
      Pages 187-204

    7. Branch and Bound Methods

      • H. A. Eiselt, C.-L. Sandblom
      Pages 205-228

    8. Heuristic Algorithms

      • H. A. Eiselt, C.-L. Sandblom
      Pages 229-258

  4. Network Path Models

    1. Front Matter

      Pages 259-259
      Download chapter PDF

    2. Tree Networks

      • H. A. Eiselt, C.-L. Sandblom
      Pages 261-281

    3. Shortest Path Problems

      • H. A. Eiselt, C.-L. Sandblom
      Pages 283-313

    4. Traveling Salesman Problems and Extensions

      • H. A. Eiselt, C.-L. Sandblom
      Pages 315-341

    5. ARC Routing

      • H. A. Eiselt, C.-L. Sandblom
      Pages 343-357

  5. Network Flow and Network Design Models

    1. Front Matter

      Pages 359-359
      Download chapter PDF
Back to top

Keywords

About this book

The purpose of this book is to provide readers with an introduction to the very active field of integer programming and network models. The idea is to cover the main parts of the field without being too detailed or too technical. As a matter of fact, we found it somewhat surprising that most--especially newer---books are strongly algorithmically oriented. In contrast, the main emphasis of this book is on models rather than methods. This focus expresses our view that methods are tools to solve actual problems and not ends in themselves. As such, graduate (and with some omissions, undergraduate) students may find this book helpful in their studies as will practitioners who would like to get acquainted with a field or use this text as a refresher. This premise has resulted in a coverage that omits material that is standard fare in other books, whereas it covers topics that are only infrequently found elsewhere. There are some, yet relatively few, prerequisites for the reader. Most material that is required for the understanding of more than one chapter is presented in one of the four chapters of the introductory part, which reviews the main results in linear programming, the analysis of algorithms, graphs and networks, and dynamic programming, respectively. Readers who are familiar with the issues involved can safely skip that part. The three main parts of the book rely on intuitive reasoning and examples, whenever practical, instead of theorems and proofs.

Authors and Affiliations

  • Faculty of Administration, University of New Brunswick, Fredericton, Canada

    H. A. Eiselt

  • Department of Industrial Engineering, Dalhousie University, Halifax, Canada

    C.-L. Sandblom

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation